summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
025e264)
fix merging new and old nodes in case if not all edges are meshed
// only by faces created by mapper
//if ( is1DComputed )
{
// only by faces created by mapper
//if ( is1DComputed )
{
- SMDS_ElemIteratorPtr invEdge = node->GetInverseElementIterator(SMDSAbs_Edge);
- bool isOld = invEdge->more();
+ bool isOld = node->NbInverseElements(SMDSAbs_Edge) > 0;
void Release() { sm = 0; } // mesh will not be removed
static void Clean( SMESH_subMesh* sm, bool withSub=true )
{
void Release() { sm = 0; } // mesh will not be removed
static void Clean( SMESH_subMesh* sm, bool withSub=true )
{
+ if ( !sm || !sm->GetSubMeshDS() ) return;
// PAL16567, 18920. Remove face nodes as well
// switch ( sm->GetSubShape().ShapeType() ) {
// case TopAbs_VERTEX:
// PAL16567, 18920. Remove face nodes as well
// switch ( sm->GetSubShape().ShapeType() ) {
// case TopAbs_VERTEX:
{
SMESH_subMesh* sm = smIt->next();
SMESHDS_SubMesh* smDS = sm->GetSubMeshDS();
{
SMESH_subMesh* sm = smIt->next();
SMESHDS_SubMesh* smDS = sm->GetSubMeshDS();
-
- if ( !is1DComputed && sm->GetSubShape().ShapeType() == TopAbs_EDGE )
+ if ( !sm->IsMeshComputed() )
+ //if ( !is1DComputed && sm->GetSubShape().ShapeType() == TopAbs_EDGE )
+ //break;
// Sort new and old nodes of a submesh separately
// Sort new and old nodes of a submesh separately
continue;
if ( u2nodesMaps[ OLD_NODES ].size() == 0 &&
continue;
if ( u2nodesMaps[ OLD_NODES ].size() == 0 &&
- sm->GetSubShape().ShapeType() == TopAbs_VERTEX &&
- !is1DComputed )
+ sm->GetSubShape().ShapeType() == TopAbs_VERTEX )
// old nodes are optional on vertices in the case of 1D-2D projection
continue;
// old nodes are optional on vertices in the case of 1D-2D projection
continue;