1 // Copyright (C) 2007-2012 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
23 // SMESH SMESHDS : management of mesh data and SMESH document
24 // File : SMESH_SubMesh.cxx
25 // Author : Yves FRICAUD, OCC
29 #include "SMESHDS_SubMesh.hxx"
30 #include "SMESHDS_Mesh.hxx"
32 #include "utilities.h"
33 #include "SMDS_SetIterator.hxx"
40 //================================================================================
44 //================================================================================
46 SMESHDS_SubMesh::SMESHDS_SubMesh(SMESHDS_Mesh *parent, int index)
53 myUnusedIdElements = 0;
56 //================================================================================
60 //================================================================================
62 SMESHDS_SubMesh::~SMESHDS_SubMesh()
66 //=======================================================================
67 //function : AddElement
69 //=======================================================================
70 void SMESHDS_SubMesh::AddElement(const SMDS_MeshElement * ME)
72 if (!IsComplexSubmesh())
74 if ( ME->GetType() == SMDSAbs_Node )
76 AddNode( static_cast< const SMDS_MeshNode* >( ME ));
79 //MESSAGE("in " << myIndex << " AddElement "<< ME->GetID());
80 int oldShapeId = ME->getshapeId();
83 if (oldShapeId != myIndex)
85 MESSAGE("add element in subshape already belonging to another subshape "
86 << ME->GetID() << " " << oldShapeId << " " << myIndex);
87 throw SALOME_Exception(LOCALIZED("add element in subshape already belonging to a subshape"));
91 int idInSubShape = ME->getIdInShape();
92 if (idInSubShape >= 0)
94 MESSAGE("add element in subshape already belonging to that subshape "
95 << ME->GetID() << " " << oldShapeId << " " << idInSubShape);
96 // check if ok: do nothing if ok
97 if (idInSubShape >= myElements.size())
99 MESSAGE("out of bounds " << idInSubShape << " " << myElements.size());
100 throw SALOME_Exception(LOCALIZED("out of bounds"));
102 if (ME != myElements[idInSubShape])
104 MESSAGE("not the same element");
105 throw SALOME_Exception(LOCALIZED("not the same element"));
107 MESSAGE("already done, OK, nothing to do");
113 SMDS_MeshElement* elem = (SMDS_MeshElement*) (ME);
114 elem->setShapeId(myIndex);
115 elem->setIdInShape(myElements.size());
116 myElements.push_back(ME);
120 //=======================================================================
121 //function : RemoveElement
123 //=======================================================================
124 bool SMESHDS_SubMesh::RemoveElement(const SMDS_MeshElement * ME, bool isElemDeleted)
128 MESSAGE("-----------------> Remove Null Element " << isElemDeleted);
131 //MESSAGE("-----------------> RemoveElement "<< ME->GetID() << " " << isElemDeleted);
132 if (!IsComplexSubmesh())
134 if ( ME->getshapeId() != myIndex )
136 int idInSubShape = ME->getIdInShape();
137 //MESSAGE("in "<< myIndex << " RemoveElement " << ME->GetID() << " " << idInSubShape << " " << myUnusedIdElements);
138 SMDS_MeshElement* elem = (SMDS_MeshElement*) (ME);
140 elem->setIdInShape(-1);
141 if ((idInSubShape >= 0) && (idInSubShape < myElements.size()))
143 myElements[idInSubShape] = 0; // this vector entry is no more used
144 myUnusedIdElements++;
150 MESSAGE("Try to remove an element from a complex submesh ");
154 //=======================================================================
157 //=======================================================================
158 void SMESHDS_SubMesh::AddNode(const SMDS_MeshNode * N)
160 if ( !IsComplexSubmesh() )
162 int idInSubShape = N->getIdInShape();
163 int shapeId = N->getshapeId();
164 if ((shapeId > 0) && (idInSubShape >= 0))
166 // MESSAGE("========== AddNode already belonging to other subShape " << N->GetID());
167 // OK for vertex nodes
168 throw SALOME_Exception(LOCALIZED("add node in subshape already belonging to a subshape"));
170 SMDS_MeshNode* node = (SMDS_MeshNode*)(N);
171 node->setShapeId(myIndex);
172 node->setIdInShape(myNodes.size());
173 myNodes.push_back(N);
174 //MESSAGE("in "<< myIndex << " AddNode " << node->GetID());
176 //MESSAGE("try to add node in a complex submesh " << N->GetID());
179 //=======================================================================
180 //function : RemoveNode
182 //=======================================================================
184 bool SMESHDS_SubMesh::RemoveNode(const SMDS_MeshNode * N, bool isNodeDeleted)
186 if (!IsComplexSubmesh())
188 // if (!isNodeDeleted) // alive node has valid ID and can be found
190 if ( N->getshapeId() != myIndex )
192 int idInSubShape = N->getIdInShape();
193 //int shapeId = N->getshapeId();
194 //MESSAGE("in "<< myIndex << " RemoveNode " << shapeId << " " << idInSubShape << " " << N->GetID());
195 SMDS_MeshNode* node = (SMDS_MeshNode*) (N);
197 node->setIdInShape(-1);
198 if ((idInSubShape >= 0) && (idInSubShape < myNodes.size()))
200 myNodes[idInSubShape] = 0; // this vector entry is no more used
207 MESSAGE("Try to remove a node from a complex submesh");
211 //=======================================================================
212 //function : NbElements
214 //=======================================================================
215 int SMESHDS_SubMesh::NbElements() const
217 //MESSAGE(this << " NbElements " << IsComplexSubmesh() << " " << myElements.size() - myUnusedIdElements);
218 if ( !IsComplexSubmesh() )
219 return myElements.size() - myUnusedIdElements;
222 set<const SMESHDS_SubMesh*>::const_iterator it = mySubMeshes.begin();
223 for ( ; it != mySubMeshes.end(); it++ )
224 nbElems += (*it)->NbElements();
229 //=======================================================================
232 //=======================================================================
234 int SMESHDS_SubMesh::NbNodes() const
236 //MESSAGE(this << " NbNodes " << IsComplexSubmesh() << " " << myNodes.size() - myUnusedIdNodes);
237 if ( !IsComplexSubmesh() )
238 return myNodes.size() - myUnusedIdNodes;
241 set<const SMESHDS_SubMesh*>::const_iterator it = mySubMeshes.begin();
242 for ( ; it != mySubMeshes.end(); it++ )
243 nbElems += (*it)->NbNodes();
249 * template class used for iteration on submesh elements. Interface of iterator remains
250 * unchanged after redesign of SMDS to avoid modification everywhere in SMESH.
251 * instances are stored in shared_ptr for automatic destruction.
252 * Container is copied for iteration, because original can be modified
253 * by addition of elements, for instance, and then reallocated (vector)
255 template <class ELEM, typename TSET> class MySetIterator : public SMDS_Iterator<ELEM>
258 typename TSET::const_iterator _it, _end;
261 MySetIterator(const TSET& table)
264 _it = _table.begin();
266 while ((_it != _end) && (*_it == 0))
272 while ((_it != _end) && (*_it == 0))
274 return (_it != _end);
285 // =====================
287 // =====================
289 template<typename VALUE> class MyIterator : public SMDS_Iterator<VALUE>
292 MyIterator (const set<const SMESHDS_SubMesh*>& theSubMeshes)
293 : mySubIt( theSubMeshes.begin() ), mySubEnd( theSubMeshes.end() ), myMore(false)
297 while (( !myElemIt.get() || !myElemIt->more() ) && mySubIt != mySubEnd)
299 myElemIt = getElements(*mySubIt);
302 myMore = myElemIt.get() && myElemIt->more();
309 elem = myElemIt->next();
313 virtual boost::shared_ptr< SMDS_Iterator<VALUE> >
314 getElements(const SMESHDS_SubMesh*) const = 0;
318 set<const SMESHDS_SubMesh*>::const_iterator mySubIt, mySubEnd;
319 boost::shared_ptr< SMDS_Iterator<VALUE> > myElemIt;
322 // =====================
323 // class MyElemIterator
324 // =====================
326 class MyElemIterator: public MyIterator<const SMDS_MeshElement*>
329 MyElemIterator (const set<const SMESHDS_SubMesh*>& theSubMeshes)
330 :MyIterator<const SMDS_MeshElement*>( theSubMeshes ) {}
331 SMDS_ElemIteratorPtr getElements(const SMESHDS_SubMesh* theSubMesh) const
332 { return theSubMesh->GetElements(); }
335 // =====================
336 // class MyNodeIterator
337 // =====================
339 class MyNodeIterator: public MyIterator<const SMDS_MeshNode*>
342 MyNodeIterator (const set<const SMESHDS_SubMesh*>& theSubMeshes)
343 :MyIterator<const SMDS_MeshNode*>( theSubMeshes ) {}
344 SMDS_NodeIteratorPtr getElements(const SMESHDS_SubMesh* theSubMesh) const
345 { return theSubMesh->GetNodes(); }
348 //=======================================================================
349 //function : GetElements
351 //=======================================================================
353 SMDS_ElemIteratorPtr SMESHDS_SubMesh::GetElements() const
355 if ( IsComplexSubmesh() )
356 return SMDS_ElemIteratorPtr( new MyElemIterator( mySubMeshes ));
357 return SMDS_ElemIteratorPtr(new MySetIterator<const SMDS_MeshElement*, std::vector<const SMDS_MeshElement*> >(myElements));
360 //=======================================================================
361 //function : GetNodes
363 //=======================================================================
365 SMDS_NodeIteratorPtr SMESHDS_SubMesh::GetNodes() const
367 if ( IsComplexSubmesh() )
368 return SMDS_NodeIteratorPtr( new MyNodeIterator( mySubMeshes ));
370 return SMDS_NodeIteratorPtr(new MySetIterator<const SMDS_MeshNode*, std::vector<const SMDS_MeshNode*> >(myNodes));
373 //=======================================================================
374 //function : Contains
375 //purpose : check if elem or node is in
376 //=======================================================================
378 bool SMESHDS_SubMesh::Contains(const SMDS_MeshElement * ME) const
380 // DO NOT TRY TO FIND A REMOVED ELEMENT !!
381 //if ( IsComplexSubmesh() || !ME )
385 if (IsComplexSubmesh())
387 set<const SMESHDS_SubMesh*>::const_iterator aSubIt = mySubMeshes.begin();
388 for (; aSubIt != mySubMeshes.end(); aSubIt++)
389 if ((*aSubIt)->Contains(ME))
394 if (ME->GetType() == SMDSAbs_Node)
396 int idInShape = ME->getIdInShape();
397 if ((idInShape >= 0) && (idInShape < myNodes.size()))
398 if (myNodes[idInShape] == ME)
403 int idInShape = ME->getIdInShape();
404 if ((idInShape >= 0) && (idInShape < myElements.size()))
405 if (myElements[idInShape] == ME)
411 //=======================================================================
412 //function : AddSubMesh
414 //=======================================================================
416 void SMESHDS_SubMesh::AddSubMesh( const SMESHDS_SubMesh* theSubMesh )
418 ASSERT( theSubMesh );
419 mySubMeshes.insert( theSubMesh );
422 //=======================================================================
423 //function : RemoveSubMesh
425 //=======================================================================
427 bool SMESHDS_SubMesh::RemoveSubMesh( const SMESHDS_SubMesh* theSubMesh )
429 return mySubMeshes.erase( theSubMesh );
432 //=======================================================================
433 //function : RemoveAllSubmeshes
435 //=======================================================================
437 void SMESHDS_SubMesh::RemoveAllSubmeshes()
442 //=======================================================================
443 //function : ContainsSubMesh
445 //=======================================================================
447 bool SMESHDS_SubMesh::ContainsSubMesh( const SMESHDS_SubMesh* theSubMesh ) const
449 return mySubMeshes.find( theSubMesh ) != mySubMeshes.end();
452 //=======================================================================
453 //function : GetSubMeshIterator
455 //=======================================================================
457 SMESHDS_SubMeshIteratorPtr SMESHDS_SubMesh::GetSubMeshIterator() const
459 typedef set<const SMESHDS_SubMesh*>::const_iterator TIterator;
460 return SMESHDS_SubMeshIteratorPtr
461 ( new SMDS_SetIterator< const SMESHDS_SubMesh*, TIterator >( mySubMeshes.begin(),
465 //=======================================================================
467 //purpose : remove the contents
468 //=======================================================================
470 void SMESHDS_SubMesh::Clear()
475 myUnusedIdElements = 0;
476 SMESHDS_SubMeshIteratorPtr sub = GetSubMeshIterator();
477 while ( sub->more() ) {
478 if ( SMESHDS_SubMesh* sm = (SMESHDS_SubMesh*) sub->next())
483 int SMESHDS_SubMesh::getSize()
486 int d = NbElements();
487 //cerr << "SMESHDS_SubMesh::NbNodes " << c << endl;
488 //cerr << "SMESHDS_SubMesh::NbElements " << d << endl;
492 void SMESHDS_SubMesh::compactList()
494 //MESSAGE("compactList old: nodes " << myNodes.size() << " elements " << myElements.size());
500 std::vector<const SMDS_MeshElement*> newElems;
502 for (int i = 0; i < myElements.size(); i++)
505 SMDS_MeshElement* elem = (SMDS_MeshElement*)myElements[i];
506 elem->setIdInShape(newElems.size());
507 newElems.push_back(elem);
508 //a << elem->GetID() << " ";
509 //b << elem->GetID() << " ";
513 myElements.swap(newElems);
514 myUnusedIdElements = 0;
515 //MESSAGE("in " << myIndex << " oldElems " << a.str());
516 //MESSAGE("in " << myIndex << " newElems " << b.str());
518 std::vector<const SMDS_MeshNode*> newNodes;
520 for (int i = 0; i < myNodes.size(); i++)
523 SMDS_MeshNode* node = (SMDS_MeshNode*)myNodes[i];
524 node->setIdInShape(newNodes.size());
525 newNodes.push_back(node);
526 //c << node->GetID() << " ";
527 //d << node->GetID() << " ";
531 myNodes.swap(newNodes);
533 //MESSAGE("in " << myIndex << " oldNodes " << c.str());
534 //MESSAGE("in " << myIndex << " newNodes " << d.str());
535 //MESSAGE("compactList new: nodes " << myNodes.size() << " elements " << myElements.size());