Version: 8.3.0
SMESHDS_SubMesh.hxx
Go to the documentation of this file.
1 // Copyright (C) 2007-2016 CEA/DEN, EDF R&D, OPEN CASCADE
2 //
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
5 //
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, or (at your option) any later version.
10 //
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.
15 //
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
19 //
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
21 //
22 
23 // SMESH SMESHDS : management of mesh data and SMESH document
24 // File : SMESHDS_SubMesh.hxx
25 // Module : SMESH
26 //
27 #ifndef _SMESHDS_SubMesh_HeaderFile
28 #define _SMESHDS_SubMesh_HeaderFile
29 
30 #include "SMESH_SMESHDS.hxx"
31 
32 #include "SMDS_Mesh.hxx"
33 #include <set>
34 #include <vector>
35 
38 typedef boost::shared_ptr< SMESHDS_SubMeshIterator > SMESHDS_SubMeshIteratorPtr;
39 
40 class SMESHDS_Mesh;
41 
43 {
44  public:
45  SMESHDS_SubMesh(SMESHDS_Mesh *parent, int index);
46  virtual ~SMESHDS_SubMesh();
47 
48  virtual bool IsComplexSubmesh() const { return !mySubMeshes.empty(); }
49 
50  // if !IsComplexSubmesh()
51  virtual void AddElement(const SMDS_MeshElement * ME);
52  virtual bool RemoveElement(const SMDS_MeshElement * ME, bool isElemDeleted); // ret true if ME was in
53  virtual void AddNode(const SMDS_MeshNode * ME);
54  virtual bool RemoveNode(const SMDS_MeshNode * ME, bool isNodeDeleted); // ret true if ME was in
55  virtual const SMDS_MeshElement* GetElement( size_t idInShape ) const;
56  virtual const SMDS_MeshNode* GetNode ( size_t idInShape ) const;
57 
58  // if IsComplexSubmesh()
59  void AddSubMesh( const SMESHDS_SubMesh* theSubMesh );
60  bool RemoveSubMesh( const SMESHDS_SubMesh* theSubMesh );
61  void RemoveAllSubmeshes();
62  bool ContainsSubMesh( const SMESHDS_SubMesh* theSubMesh ) const;
63  int NbSubMeshes() const { return mySubMeshes.size(); }
64  SMESHDS_SubMeshIteratorPtr GetSubMeshIterator() const;
65 
66  // for both types
67  virtual int NbElements() const;
68  virtual SMDS_ElemIteratorPtr GetElements(bool reverse=false) const;
69  virtual int NbNodes() const;
70  virtual SMDS_NodeIteratorPtr GetNodes(bool reverse=false) const;
71  virtual bool Contains(const SMDS_MeshElement * ME) const; // check if elem or node is in
72  virtual bool IsQuadratic() const;
73 
74  // clear the contents
75  virtual void Clear();
76  int getSize();
77  void compactList();
78 
79  SMESHDS_Mesh* GetParent() const { return const_cast< SMESHDS_Mesh*>( myParent ); }
80  int GetID() const { return myIndex; }
81 
82  private:
84  std::vector<const SMDS_MeshElement*> myElements;
85  std::vector<const SMDS_MeshNode*> myNodes;
86 
89  int myIndex;
90 
91  std::set<const SMESHDS_SubMesh*> mySubMeshes;
92 };
93 #endif