smesh/src/SMESH/SMESH_subMesh.hxx

179 lines
5.4 KiB
C++
Raw Normal View History

2003-07-10 16:13:42 +06:00
// SMESH SMESH : implementaion of SMESH idl descriptions
//
// Copyright (C) 2003 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.opencascade.org/SALOME/ or email : webmaster.salome@opencascade.org
//
//
//
// File : SMESH_subMesh.hxx
// Author : Paul RASCLE, EDF
// Module : SMESH
// $Header$
2003-05-19 19:18:36 +06:00
#ifndef _SMESH_SUBMESH_HXX_
#define _SMESH_SUBMESH_HXX_
#include "SMESHDS_Mesh.hxx"
#include "SMESHDS_SubMesh.hxx"
2004-06-18 14:55:35 +06:00
#include "SMESH_Hypothesis.hxx"
2003-05-19 19:18:36 +06:00
#include "Utils_SALOME_Exception.hxx"
#include <TopoDS_Shape.hxx>
#include <TColStd_IndexedMapOfTransient.hxx>
#include <TopTools_IndexedDataMapOfShapeListOfShape.hxx>
#include <set>
#include <list>
#include <map>
class SMESH_Mesh;
class SMESH_Hypothesis;
2004-06-18 14:55:35 +06:00
class SMESH_Algo;
class SMESH_Gen;
2003-05-19 19:18:36 +06:00
class SMESH_subMesh
{
2004-06-18 14:55:35 +06:00
public:
SMESH_subMesh(int Id, SMESH_Mesh * father, SMESHDS_Mesh * meshDS,
2003-05-19 19:18:36 +06:00
const TopoDS_Shape & aSubShape);
2004-06-18 14:55:35 +06:00
virtual ~ SMESH_subMesh();
2003-05-19 19:18:36 +06:00
2004-06-18 14:55:35 +06:00
int GetId() const;
2003-05-19 19:18:36 +06:00
2004-06-18 14:55:35 +06:00
// bool Contains(const TopoDS_Shape & aSubShape)
// throw (SALOME_Exception);
2003-05-19 19:18:36 +06:00
SMESH_Mesh* GetFather() { return _father; }
2004-06-18 14:55:35 +06:00
SMESHDS_SubMesh * GetSubMeshDS();
2003-05-19 19:18:36 +06:00
2004-06-18 14:55:35 +06:00
SMESHDS_SubMesh* CreateSubMeshDS();
// Explicit SMESHDS_SubMesh creation method, required for persistence mechanism
SMESH_subMesh *GetFirstToCompute();
const map < int, SMESH_subMesh * >&DependsOn();
//const map < int, SMESH_subMesh * >&Dependants();
const TopoDS_Shape & GetSubShape() const;
2004-06-18 14:55:35 +06:00
2004-12-01 15:48:31 +05:00
// bool _vertexSet; // only for vertex subMesh, set to false for dim > 0
2004-06-18 14:55:35 +06:00
enum compute_state
{
NOT_READY, READY_TO_COMPUTE,
COMPUTE_OK, FAILED_TO_COMPUTE
};
enum algo_state
{
NO_ALGO, MISSING_HYP, HYP_OK
};
enum algo_event
{
ADD_HYP, ADD_ALGO,
REMOVE_HYP, REMOVE_ALGO,
ADD_FATHER_HYP, ADD_FATHER_ALGO,
REMOVE_FATHER_HYP, REMOVE_FATHER_ALGO
};
enum compute_event
{
MODIF_HYP, MODIF_ALGO_STATE, COMPUTE,
CLEAN, SUBMESH_COMPUTED, SUBMESH_RESTORED,
2004-12-01 15:48:31 +05:00
MESH_ENTITY_REMOVED, CHECK_COMPUTE_STATE
2004-06-18 14:55:35 +06:00
};
SMESH_Hypothesis::Hypothesis_Status
AlgoStateEngine(int event, SMESH_Hypothesis * anHyp);
SMESH_Hypothesis::Hypothesis_Status
SubMeshesAlgoStateEngine(int event, SMESH_Hypothesis * anHyp);
int GetAlgoState() const { return _algoState; }
int GetComputeState() const { return _computeState; };
2004-06-18 14:55:35 +06:00
void DumpAlgoState(bool isMain);
bool ComputeStateEngine(int event);
bool IsConform(const SMESH_Algo* theAlgo);
// check if a conform mesh will be produced by the Algo
bool CanAddHypothesis(const SMESH_Hypothesis* theHypothesis) const;
// return true if theHypothesis can be attached to me:
// its dimention is checked
static bool IsApplicableHypotesis(const SMESH_Hypothesis* theHypothesis,
const TopAbs_ShapeEnum theShapeType);
bool IsApplicableHypotesis(const SMESH_Hypothesis* theHypothesis) const
{ return IsApplicableHypotesis( theHypothesis, _subShape.ShapeType() ); }
2004-06-18 14:55:35 +06:00
// return true if theHypothesis can be used to mesh me:
// its shape type is checked
2004-12-17 16:07:35 +05:00
SMESH_Hypothesis::Hypothesis_Status CheckConcurentHypothesis (const int theHypType);
// check if there are several applicable hypothesis on fathers
2004-06-18 14:55:35 +06:00
protected:
void InsertDependence(const TopoDS_Shape aSubShape);
bool SubMeshesComputed();
bool SubMeshesReady();
void RemoveSubMeshElementsAndNodes();
void UpdateDependantsState(const compute_event theEvent);
void UpdateSubMeshState(const compute_state theState);
void ComputeSubMeshStateEngine(int event);
void CleanDependants();
void CleanDependsOn();
void SetAlgoState(int state);
bool IsMeshComputed() const;
// check if _subMeshDS contains mesh elements
TopoDS_Shape GetCollection(SMESH_Gen * theGen, SMESH_Algo* theAlgo);
// return a shape containing all sub-shapes of the MainShape that can be
// meshed at once along with _subShape
bool ApplyToCollection (SMESH_Algo* theAlgo,
const TopoDS_Shape& theCollection);
// Apply theAlgo to all subshapes in theCollection
2004-12-01 15:48:31 +05:00
const SMESH_Hypothesis* GetSimilarAttached(const TopoDS_Shape& theShape,
const SMESH_Hypothesis * theHyp,
const int theHypType = 0);
// return a hypothesis attached to theShape.
2004-06-18 14:55:35 +06:00
// If theHyp is provided, similar but not same hypotheses
2004-12-01 15:48:31 +05:00
// is returned; else an applicable ones having theHypType
// is returned
2004-06-18 14:55:35 +06:00
TopoDS_Shape _subShape;
SMESHDS_Mesh * _meshDS;
SMESHDS_SubMesh * _subMeshDS;
int _Id;
SMESH_Mesh *_father;
map < int, SMESH_subMesh * >_mapDepend;
bool _dependenceAnalysed;
int _algoState;
int _computeState;
2003-05-19 19:18:36 +06:00
};
#endif