mirror of
https://git.salome-platform.org/gitpub/modules/smesh.git
synced 2024-12-25 08:50:35 +05:00
simply code
This commit is contained in:
parent
0556492614
commit
73a829efdf
@ -2774,8 +2774,6 @@ void SMESH_MeshEditor::sweepElement(const SMDS_MeshElement* elem,
|
|||||||
|
|
||||||
int iNode, nbSame = 0, iNotSameNode = 0, iSameNode = 0;
|
int iNode, nbSame = 0, iNotSameNode = 0, iSameNode = 0;
|
||||||
vector<int> sames(nbNodes);
|
vector<int> sames(nbNodes);
|
||||||
|
|
||||||
//bool issimple[nbNodes];
|
|
||||||
vector<bool> issimple(nbNodes);
|
vector<bool> issimple(nbNodes);
|
||||||
|
|
||||||
for ( iNode = 0; iNode < nbNodes; iNode++ ) {
|
for ( iNode = 0; iNode < nbNodes; iNode++ ) {
|
||||||
@ -2785,12 +2783,7 @@ void SMESH_MeshEditor::sweepElement(const SMDS_MeshElement* elem,
|
|||||||
if ( listNewNodes.empty() )
|
if ( listNewNodes.empty() )
|
||||||
return;
|
return;
|
||||||
|
|
||||||
if(listNewNodes.size()==nbSteps) {
|
issimple[iNode] = (listNewNodes.size()==nbSteps);
|
||||||
issimple[iNode] = true;
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
issimple[iNode] = false;
|
|
||||||
}
|
|
||||||
|
|
||||||
itNN[ iNode ] = listNewNodes.begin();
|
itNN[ iNode ] = listNewNodes.begin();
|
||||||
prevNod[ iNode ] = node;
|
prevNod[ iNode ] = node;
|
||||||
@ -2835,11 +2828,8 @@ void SMESH_MeshEditor::sweepElement(const SMDS_MeshElement* elem,
|
|||||||
//MESSAGE("Reversed elem " << elem );
|
//MESSAGE("Reversed elem " << elem );
|
||||||
i0 = 2;
|
i0 = 2;
|
||||||
i2 = 0;
|
i2 = 0;
|
||||||
if ( nbSame > 0 ) {
|
if ( nbSame > 0 )
|
||||||
int iAB = iAfterSame + iBeforeSame;
|
std::swap( iAfterSame, iAfterSame );
|
||||||
iBeforeSame = iAB - iBeforeSame;
|
|
||||||
iAfterSame = iAB - iAfterSame;
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// make new elements
|
// make new elements
|
||||||
@ -2858,8 +2848,7 @@ void SMESH_MeshEditor::sweepElement(const SMDS_MeshElement* elem,
|
|||||||
nextNod[ iNode ] = *itNN[ iNode ];
|
nextNod[ iNode ] = *itNN[ iNode ];
|
||||||
itNN[ iNode ]++;
|
itNN[ iNode ]++;
|
||||||
}
|
}
|
||||||
else if(!elem->IsQuadratic() ||
|
else if(!elem->IsQuadratic() || elem->IsMediumNode(prevNod[iNode]) ) {
|
||||||
elem->IsQuadratic() && elem->IsMediumNode(prevNod[iNode]) ) {
|
|
||||||
// we have to use each second node
|
// we have to use each second node
|
||||||
itNN[ iNode ]++;
|
itNN[ iNode ]++;
|
||||||
nextNod[ iNode ] = *itNN[ iNode ];
|
nextNod[ iNode ] = *itNN[ iNode ];
|
||||||
|
Loading…
Reference in New Issue
Block a user