smesh/src/SMESH/SMESH_subMesh.hxx

330 lines
11 KiB
C++
Raw Normal View History

2012-08-09 16:03:55 +06:00
// Copyright (C) 2007-2012 CEA/DEN, EDF R&D, OPEN CASCADE
2009-02-17 10:27:49 +05:00
//
2012-08-09 16:03:55 +06:00
// Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
// CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
2009-02-17 10:27:49 +05:00
//
2012-08-09 16:03:55 +06:00
// 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.
2003-07-10 16:13:42 +06:00
//
2012-08-09 16:03:55 +06:00
// 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.
2003-07-10 16:13:42 +06:00
//
2012-08-09 16:03:55 +06:00
// 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
2003-07-10 16:13:42 +06:00
//
2012-08-09 16:03:55 +06:00
// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
2003-07-10 16:13:42 +06:00
//
2012-08-09 16:03:55 +06:00
2003-07-10 16:13:42 +06:00
// File : SMESH_subMesh.hxx
// Author : Paul RASCLE, EDF
// Module : SMESH
2009-02-17 10:27:49 +05:00
//
2003-05-19 19:18:36 +06:00
#ifndef _SMESH_SUBMESH_HXX_
#define _SMESH_SUBMESH_HXX_
#include "SMESH_SMESH.hxx"
2003-05-19 19:18:36 +06:00
#include "SMESHDS_Mesh.hxx"
#include "SMESHDS_SubMesh.hxx"
2004-06-18 14:55:35 +06:00
#include "SMESH_Hypothesis.hxx"
#include "SMESH_ComputeError.hxx"
2012-08-09 16:03:55 +06:00
#include "SMESH_Algo.hxx"
2003-05-19 19:18:36 +06:00
#include "Utils_SALOME_Exception.hxx"
2003-05-19 19:18:36 +06:00
#include <TopoDS_Shape.hxx>
#include <list>
#include <map>
class SMESH_Mesh;
class SMESH_Hypothesis;
2004-06-18 14:55:35 +06:00
class SMESH_Algo;
class SMESH_Gen;
class SMESH_subMeshEventListener;
class SMESH_subMeshEventListenerData;
class SMESH_subMesh;
typedef SMESH_subMeshEventListener EventListener;
typedef SMESH_subMeshEventListenerData EventListenerData;
typedef boost::shared_ptr< SMDS_Iterator<SMESH_subMesh*> > SMESH_subMeshIteratorPtr;
2003-05-19 19:18:36 +06:00
class SMESH_EXPORT SMESH_subMesh
2003-05-19 19:18:36 +06:00
{
2004-06-18 14:55:35 +06:00
public:
2012-12-13 17:41:29 +06:00
SMESH_subMesh(int Id,
SMESH_Mesh * father,
SMESHDS_Mesh * meshDS,
2012-08-09 16:03:55 +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
2012-12-13 17:41:29 +06:00
int GetId() const; // == meshDS->ShapeToIndex( aSubShape )
2003-05-19 19:18:36 +06:00
SMESH_Mesh* GetFather() { return _father; }
2012-12-13 17:41:29 +06:00
SMESHDS_SubMesh * GetSubMeshDS();
const SMESHDS_SubMesh * GetSubMeshDS() const;
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();
2012-08-09 16:03:55 +06:00
SMESH_Algo* GetAlgo() const;
2009-02-17 10:27:49 +05:00
const std::map < int, SMESH_subMesh * >& DependsOn();
/*!
* \brief Return iterator on the submeshes this one depends on
*/
SMESH_subMeshIteratorPtr getDependsOnIterator(const bool includeSelf,
2013-02-12 20:37:44 +06:00
const bool complexShapeFirst) const;
2004-06-18 14:55:35 +06:00
const TopoDS_Shape & GetSubShape() const;
2004-06-18 14:55:35 +06:00
enum compute_state
{
NOT_READY, READY_TO_COMPUTE,
COMPUTE_OK, FAILED_TO_COMPUTE
2012-08-09 16:03:55 +06:00
};
2004-06-18 14:55:35 +06:00
enum algo_state
{
NO_ALGO, MISSING_HYP, HYP_OK
2012-08-09 16:03:55 +06:00
};
2004-06-18 14:55:35 +06:00
enum algo_event
{
ADD_HYP , ADD_ALGO,
REMOVE_HYP , REMOVE_ALGO,
ADD_FATHER_HYP , ADD_FATHER_ALGO,
REMOVE_FATHER_HYP, REMOVE_FATHER_ALGO,
MODIF_HYP
2012-08-09 16:03:55 +06:00
};
2004-06-18 14:55:35 +06:00
enum compute_event
{
2013-03-15 20:59:29 +06:00
MODIF_ALGO_STATE, COMPUTE, COMPUTE_SUBMESH, COMPUTE_CANCELED,
2012-08-09 16:03:55 +06:00
CLEAN, SUBMESH_COMPUTED, SUBMESH_RESTORED, SUBMESH_LOADED,
2004-12-01 15:48:31 +05:00
MESH_ENTITY_REMOVED, CHECK_COMPUTE_STATE
2012-08-09 16:03:55 +06:00
};
enum event_type
{
ALGO_EVENT, COMPUTE_EVENT
};
// ==================================================================
// Members to track non hierarchical dependencies between submeshes
// ==================================================================
/*!
* \brief Sets an event listener and its data to a submesh
* \param listener - the listener to store
* \param data - the listener data to store
* \param where - the submesh to store the listener and it's data
*
* The method remembers the submesh \awhere it puts the listener in order to delete
2012-08-09 16:03:55 +06:00
* it when HYP_OK algo_state is lost
* After being set, event listener is notified on each event of \awhere submesh.
*/
void SetEventListener(EventListener* listener,
EventListenerData* data,
SMESH_subMesh* where);
/*!
* \brief Return an event listener data
* \param listener - the listener whose data is
* \retval EventListenerData* - found data, maybe NULL
*/
EventListenerData* GetEventListenerData(EventListener* listener) const;
2012-10-08 17:56:59 +06:00
/*!
* \brief Return an event listener data
* \param listenerName - the listener name
* \retval EventListenerData* - found data, maybe NULL
*/
EventListenerData* GetEventListenerData(const std::string& listenerName) const;
/*!
* \brief Unregister the listener and delete it and it's data
* \param listener - the event listener to delete
*/
void DeleteEventListener(EventListener* listener);
protected:
//!< event listeners to notify
2012-08-09 16:03:55 +06:00
std::map< EventListener*, EventListenerData* > _eventListeners;
//!< event listeners to delete when HYP_OK algo_state is lost
2012-08-09 16:03:55 +06:00
struct OwnListenerData {
SMESH_subMesh* mySubMesh;
int myMeshID; // id of mySubMesh->GetFather()
int mySubMeshID;
EventListener* myListener;
OwnListenerData( SMESH_subMesh* sm=0, EventListener* el=0);
};
std::list< OwnListenerData > _ownListeners;
/*!
* \brief Sets an event listener and its data to a submesh
* \param listener - the listener to store
* \param data - the listener data to store
*
* After being set, event listener is notified on each event of a submesh.
*/
2012-08-09 16:03:55 +06:00
void setEventListener(EventListener* listener, EventListenerData* data);
/*!
* \brief Notify stored event listeners on the occured event
* \param event - algo_event or compute_event itself
* \param eventType - algo_event or compute_event
* \param hyp - hypothesis, if eventType is algo_event
*/
2012-08-09 16:03:55 +06:00
void notifyListenersOnEvent( const int event,
const event_type eventType,
SMESH_Hypothesis* hyp = 0);
/*!
* \brief Delete event listeners depending on algo of this submesh
*/
2012-08-09 16:03:55 +06:00
void deleteOwnListeners();
2012-08-09 16:03:55 +06:00
/*!
* \brief loads dependent meshes on SUBMESH_LOADED event
*/
void loadDependentMeshes();
// END: Members to track non hierarchical dependencies between submeshes
// =====================================================================
public:
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);
2012-12-13 17:41:29 +06:00
algo_state GetAlgoState() const { return _algoState; }
compute_state GetComputeState() const { return _computeState; };
SMESH_ComputeErrorPtr& GetComputeError() { return _computeError; }
2004-06-18 14:55:35 +06:00
void DumpAlgoState(bool isMain);
bool ComputeStateEngine(int event);
2012-08-09 16:03:55 +06:00
void ComputeSubMeshStateEngine(int event, const bool includeSelf=false);
bool Evaluate(MapShapeNbElems& aResMap);
2004-06-18 14:55:35 +06:00
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
2009-02-17 10:27:49 +05:00
/*!
* \brief Return true if no mesh entities is bound to the submesh
*/
bool IsEmpty() const;
bool IsMeshComputed() const;
// check if _subMeshDS contains mesh elements
/*!
* \brief Allow algo->Compute() if a subshape of lower dim is meshed but
* none mesh entity is bound to it
*/
void SetIsAlwaysComputed(bool isAlCo);
2012-08-09 16:03:55 +06:00
bool IsAlwaysComputed() { return _alwaysComputed; }
2013-02-28 21:07:35 +06:00
bool SubMeshesComputed(bool * isFailedToCompute=0) const;
2013-02-12 20:37:44 +06:00
2012-08-09 16:03:55 +06:00
/*!
* \brief Find common submeshes (based on shared subshapes with other
* \param theOther submesh to check
* \param theCommonIds set of common submesh IDs
* NOTE: this method does not cleat set before collect common IDs
*/
bool FindIntersection( const SMESH_subMesh * theOther,
std::set<const SMESH_subMesh*>& theSetOfCommon ) const;
protected:
// ==================================================================
2012-08-09 16:03:55 +06:00
void insertDependence(const TopoDS_Shape aSubShape);
2004-06-18 14:55:35 +06:00
2012-08-09 16:03:55 +06:00
void removeSubMeshElementsAndNodes();
void updateDependantsState(const compute_event theEvent);
void updateSubMeshState(const compute_state theState);
void cleanDependants();
2013-03-06 19:57:01 +06:00
void cleanDependsOn( SMESH_Algo* algoRequiringCleaning=0 );
2012-12-13 17:41:29 +06:00
void setAlgoState(algo_state state);
2004-06-18 14:55:35 +06:00
/*!
* \brief Return a shape containing all sub-shapes of the MainShape that can be
* meshed at once along with _subShape
*/
2012-08-09 16:03:55 +06:00
TopoDS_Shape getCollection(SMESH_Gen * theGen,
2009-02-17 10:27:49 +05:00
SMESH_Algo* theAlgo,
2013-02-28 21:07:35 +06:00
bool & theSubComputed,
bool & theSubFailed);
/*!
* \brief Update compute_state by _computeError
* \retval bool - false if there are errors
*/
2012-10-08 17:56:59 +06:00
bool checkComputeError(SMESH_Algo* theAlgo,
const bool theComputeOK,
const TopoDS_Shape& theShape=TopoDS_Shape());
/*!
* \brief Return a hypothesis attached to theShape.
*
* If theHyp is provided, similar but not same hypotheses
* is returned; else an applicable ones having theHypType
* is returned
*/
2012-08-09 16:03:55 +06:00
const SMESH_Hypothesis* getSimilarAttached(const TopoDS_Shape& theShape,
2004-12-01 15:48:31 +05:00
const SMESH_Hypothesis * theHyp,
const int theHypType = 0);
//
protected:
TopoDS_Shape _subShape;
SMESHDS_SubMesh * _subMeshDS;
SMESH_Mesh * _father;
int _Id;
2009-02-17 10:27:49 +05:00
std::map < int, SMESH_subMesh * >_mapDepend;
bool _dependenceAnalysed;
2013-02-28 21:07:35 +06:00
SMESH_Algo * _algo; // the algorithm found by last *StateEngine() call
2012-12-13 17:41:29 +06:00
algo_state _algoState;
compute_state _computeState;
SMESH_ComputeErrorPtr _computeError;
2004-06-18 14:55:35 +06:00
2013-02-28 21:07:35 +06:00
// allow algo->Compute() if a sub-shape of lower dim is meshed but
// none mesh entity is bound to it. Eg StdMeshers_CompositeSegment_1D can
// mesh several edges as a whole and leave some of them without mesh entities
bool _alwaysComputed;
2003-05-19 19:18:36 +06:00
};
#endif