-// Copyright (C) 2007-2008 CEA/DEN, EDF R&D, OPEN CASCADE
+// Copyright (C) 2007-2012 CEA/DEN, EDF R&D, OPEN CASCADE
//
-// Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
-// CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
+// Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
+// CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
//
-// This library is free software; you can redistribute it and/or
-// modify it under the terms of the GNU Lesser General Public
-// License as published by the Free Software Foundation; either
-// version 2.1 of the License.
+// This library is free software; you can redistribute it and/or
+// modify it under the terms of the GNU Lesser General Public
+// License as published by the Free Software Foundation; either
+// version 2.1 of the License.
//
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-// Lesser General Public License for more details.
+// This library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+// Lesser General Public License for more details.
//
-// You should have received a copy of the GNU Lesser General Public
-// License along with this library; if not, write to the Free Software
-// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+// You should have received a copy of the GNU Lesser General Public
+// License along with this library; if not, write to the Free Software
+// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
-// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
+// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
//
+
// SMESH SMESHDS : management of mesh data and SMESH document
// File : SMESHDS_SubMesh.hxx
// Module : SMESH
#include "SMDS_Mesh.hxx"
#include <set>
+#include <vector>
class SMESHDS_SubMesh;
typedef SMDS_Iterator<const SMESHDS_SubMesh*> SMESHDS_SubMeshIterator;
typedef boost::shared_ptr< SMESHDS_SubMeshIterator > SMESHDS_SubMeshIteratorPtr;
+class SMESHDS_Mesh;
+
class SMESHDS_EXPORT SMESHDS_SubMesh
{
public:
+ SMESHDS_SubMesh(SMESHDS_Mesh *parent, int index);
+ virtual ~SMESHDS_SubMesh();
- bool IsComplexSubmesh() const { return !mySubMeshes.empty(); }
+ virtual bool IsComplexSubmesh() const { return !mySubMeshes.empty(); }
// if !IsComplexSubmesh()
- void AddElement(const SMDS_MeshElement * ME);
- bool RemoveElement(const SMDS_MeshElement * ME); // ret true if ME was in
- void AddNode(const SMDS_MeshNode * ME);
- bool RemoveNode(const SMDS_MeshNode * ME); // ret true if ME was in
+ virtual void AddElement(const SMDS_MeshElement * ME);
+ virtual bool RemoveElement(const SMDS_MeshElement * ME, bool isElemDeleted); // ret true if ME was in
+ virtual void AddNode(const SMDS_MeshNode * ME);
+ virtual bool RemoveNode(const SMDS_MeshNode * ME, bool isNodeDeleted); // ret true if ME was in
// if IsComplexSubmesh()
void AddSubMesh( const SMESHDS_SubMesh* theSubMesh );
bool RemoveSubMesh( const SMESHDS_SubMesh* theSubMesh );
+ void RemoveAllSubmeshes();
bool ContainsSubMesh( const SMESHDS_SubMesh* theSubMesh ) const;
int NbSubMeshes() const { return mySubMeshes.size(); }
SMESHDS_SubMeshIteratorPtr GetSubMeshIterator() const;
// for both types
- int NbElements() const;
- SMDS_ElemIteratorPtr GetElements() const;
- int NbNodes() const;
- SMDS_NodeIteratorPtr GetNodes() const;
- bool Contains(const SMDS_MeshElement * ME) const; // check if elem or node is in
+ virtual int NbElements() const;
+ virtual SMDS_ElemIteratorPtr GetElements() const;
+ virtual int NbNodes() const;
+ virtual SMDS_NodeIteratorPtr GetNodes() const;
+ virtual bool Contains(const SMDS_MeshElement * ME) const; // check if elem or node is in
// clear the contents
- void Clear();
+ virtual void Clear();
+ int getSize();
+ void compactList();
+
+ SMESHDS_Mesh *GetParent() { return myParent; }
+ int GetID() const { return myIndex; }
private:
- struct TIDCompare { // to have nodes and elements sorted by ID
- bool operator () (const SMDS_MeshElement* e1, const SMDS_MeshElement* e2) const
- { return e1->GetID() < e2->GetID(); }
- };
- typedef std::set<const SMDS_MeshElement*, TIDCompare > TElemSet;
- typedef std::set<const SMDS_MeshNode* , TIDCompare> TNodeSet;
- TElemSet myElements;
- TNodeSet myNodes;
+ SMESHDS_Mesh * myParent;
+ std::vector<const SMDS_MeshElement*> myElements;
+ std::vector<const SMDS_MeshNode*> myNodes;
+
+ int myUnusedIdNodes;
+ int myUnusedIdElements;
+ int myIndex;
+
std::set<const SMESHDS_SubMesh*> mySubMeshes;
};
#endif