mirror of
https://git.salome-platform.org/gitpub/modules/smesh.git
synced 2025-01-10 08:40:34 +05:00
a84fe0415c
0020214: Project_2D_4 failed on V5_1 64 bits different ways of removing deleted and alive elements from submesh
79 lines
2.8 KiB
C++
79 lines
2.8 KiB
C++
// Copyright (C) 2007-2008 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
|
|
//
|
|
// 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.
|
|
//
|
|
// 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
|
|
//
|
|
// SMESH SMESHDS : management of mesh data and SMESH document
|
|
// File : SMESHDS_SubMesh.hxx
|
|
// Module : SMESH
|
|
//
|
|
#ifndef _SMESHDS_SubMesh_HeaderFile
|
|
#define _SMESHDS_SubMesh_HeaderFile
|
|
|
|
#include "SMESH_SMESHDS.hxx"
|
|
|
|
#include "SMDS_Mesh.hxx"
|
|
#include <set>
|
|
|
|
class SMESHDS_SubMesh;
|
|
typedef SMDS_Iterator<const SMESHDS_SubMesh*> SMESHDS_SubMeshIterator;
|
|
typedef boost::shared_ptr< SMESHDS_SubMeshIterator > SMESHDS_SubMeshIteratorPtr;
|
|
|
|
class SMESHDS_EXPORT SMESHDS_SubMesh
|
|
{
|
|
public:
|
|
|
|
bool IsComplexSubmesh() const { return !mySubMeshes.empty(); }
|
|
|
|
// if !IsComplexSubmesh()
|
|
void AddElement(const SMDS_MeshElement * ME);
|
|
bool RemoveElement(const SMDS_MeshElement * ME, bool isElemDeleted); // ret true if ME was in
|
|
void AddNode(const SMDS_MeshNode * ME);
|
|
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 );
|
|
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
|
|
|
|
// clear the contents
|
|
void Clear();
|
|
|
|
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;
|
|
TElemSet myElements, myNodes;
|
|
|
|
std::set<const SMESHDS_SubMesh*> mySubMeshes;
|
|
};
|
|
#endif
|