1 // Copyright (C) 2007-2020 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
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.
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.
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
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
23 // SMESH SMESH : implementation of SMESH idl descriptions
24 // File : SMESH_subMesh.cxx
25 // Author : Paul RASCLE, EDF
28 #include "SMESH_subMesh.hxx"
30 #include "SMDS_SetIterator.hxx"
31 #include "SMESHDS_Mesh.hxx"
32 #include "SMESH_Algo.hxx"
33 #include "SMESH_Comment.hxx"
34 #include "SMESH_Gen.hxx"
35 #include "SMESH_HypoFilter.hxx"
36 #include "SMESH_Hypothesis.hxx"
37 #include "SMESH_Mesh.hxx"
38 #include "SMESH_MesherHelper.hxx"
39 #include "SMESH_subMeshEventListener.hxx"
41 #include "utilities.h"
43 #include "Basics_Utils.hxx"
45 #include <BRep_Builder.hxx>
46 #include <BRep_Tool.hxx>
48 #include <TopExp_Explorer.hxx>
49 #include <TopTools_IndexedMapOfShape.hxx>
50 #include <TopTools_ListIteratorOfListOfShape.hxx>
51 #include <TopTools_ListOfShape.hxx>
53 #include <TopoDS_Compound.hxx>
54 #include <TopoDS_Iterator.hxx>
57 #include <Standard_OutOfMemory.hxx>
58 #include <Standard_ErrorHandler.hxx>
65 // enable printing algo + shape id + hypo used while meshing
66 //#define PRINT_WHO_COMPUTE_WHAT
69 //=============================================================================
71 * \brief Allocate some memory at construction and release it at destruction.
72 * Is used to be able to continue working after mesh generation breaks due to
75 //=============================================================================
80 MemoryReserve(): myBuf( new char[1024*1024*2] ){}
81 ~MemoryReserve() { delete [] myBuf; }
84 //=============================================================================
86 * default constructor:
88 //=============================================================================
90 SMESH_subMesh::SMESH_subMesh(int Id,
92 SMESHDS_Mesh * meshDS,
93 const TopoDS_Shape & aSubShape)
95 _subShape = aSubShape;
96 _subMeshDS = meshDS->MeshElements(_subShape); // may be null ...
99 _dependenceAnalysed = _alwaysComputed = false;
101 if (_subShape.ShapeType() == TopAbs_VERTEX)
104 _computeState = READY_TO_COMPUTE;
108 _algoState = NO_ALGO;
109 _computeState = NOT_READY;
111 _computeCost = 0; // how costly is to compute this sub-mesh
112 _realComputeCost = 0;
115 //=============================================================================
119 //=============================================================================
121 SMESH_subMesh::~SMESH_subMesh()
123 deleteOwnListeners();
126 //=============================================================================
130 //=============================================================================
132 int SMESH_subMesh::GetId() const
134 //MESSAGE("SMESH_subMesh::GetId");
138 //=============================================================================
142 //=============================================================================
144 SMESHDS_SubMesh * SMESH_subMesh::GetSubMeshDS()
146 // submesh appears in DS only when a mesher set nodes and elements on a shape
147 return _subMeshDS ? _subMeshDS : _subMeshDS = _father->GetMeshDS()->MeshElements(_subShape); // may be null
150 //=============================================================================
154 //=============================================================================
156 const SMESHDS_SubMesh * SMESH_subMesh::GetSubMeshDS() const
158 return ((SMESH_subMesh*) this )->GetSubMeshDS();
161 //=============================================================================
165 //=============================================================================
167 SMESHDS_SubMesh* SMESH_subMesh::CreateSubMeshDS()
169 if ( !GetSubMeshDS() ) {
170 SMESHDS_Mesh* meshDS = _father->GetMeshDS();
171 meshDS->NewSubMesh( meshDS->ShapeToIndex( _subShape ) );
173 return GetSubMeshDS();
176 //=============================================================================
180 //=============================================================================
182 SMESH_subMesh *SMESH_subMesh::GetFirstToCompute()
184 SMESH_subMeshIteratorPtr smIt = getDependsOnIterator(true,false);
185 while ( smIt->more() ) {
186 SMESH_subMesh *sm = smIt->next();
187 if ( sm->GetComputeState() == READY_TO_COMPUTE )
190 return 0; // nothing to compute
193 //================================================================================
195 * \brief Returns a current algorithm
197 //================================================================================
199 SMESH_Algo* SMESH_subMesh::GetAlgo() const
203 SMESH_subMesh* me = const_cast< SMESH_subMesh* >( this );
204 me->_algo = _father->GetGen()->GetAlgo( me, & me->_algoShape );
209 //================================================================================
211 * \brief Allow algo->Compute() if a sub-shape of lower dim is meshed but
212 * none mesh entity is bound to it (PAL13615, 2nd part)
214 //================================================================================
216 void SMESH_subMesh::SetIsAlwaysComputed(bool isAlCo)
218 _alwaysComputed = isAlCo;
219 if ( _alwaysComputed )
220 _computeState = COMPUTE_OK;
222 ComputeStateEngine( CHECK_COMPUTE_STATE );
225 //=======================================================================
227 * \brief Return true if no mesh entities is bound to the submesh
229 //=======================================================================
231 bool SMESH_subMesh::IsEmpty() const
233 if (SMESHDS_SubMesh * subMeshDS = ((SMESH_subMesh*)this)->GetSubMeshDS())
234 return (!subMeshDS->NbElements() && !subMeshDS->NbNodes());
238 //=======================================================================
239 //function : IsMeshComputed
240 //purpose : check if _subMeshDS contains mesh elements
241 //=======================================================================
243 bool SMESH_subMesh::IsMeshComputed() const
245 if ( _alwaysComputed )
247 // algo may bind a sub-mesh not to _subShape, eg 3D algo
248 // sets nodes on SHELL while _subShape may be SOLID
250 SMESHDS_Mesh* meshDS = _father->GetMeshDS();
251 int dim = SMESH_Gen::GetShapeDim( _subShape );
252 int type = _subShape.ShapeType();
253 for ( ; type <= TopAbs_VERTEX; type++) {
254 if ( dim == SMESH_Gen::GetShapeDim( (TopAbs_ShapeEnum) type ))
256 TopExp_Explorer exp( _subShape, (TopAbs_ShapeEnum) type );
257 for ( ; exp.More(); exp.Next() )
259 if ( SMESHDS_SubMesh * smDS = meshDS->MeshElements( exp.Current() ))
261 bool computed = (dim > 0) ? smDS->NbElements() : smDS->NbNodes();
274 //=============================================================================
276 * Return true if all sub-meshes have been meshed
278 //=============================================================================
280 bool SMESH_subMesh::SubMeshesComputed(bool * isFailedToCompute/*=0*/) const
282 int myDim = SMESH_Gen::GetShapeDim( _subShape );
283 int dimToCheck = myDim - 1;
284 bool subMeshesComputed = true;
285 if ( isFailedToCompute ) *isFailedToCompute = false;
286 // check sub-meshes with upper dimension => reverse iteration
287 SMESH_subMeshIteratorPtr smIt = getDependsOnIterator(false,true);
288 while ( smIt->more() )
290 SMESH_subMesh *sm = smIt->next();
291 if ( sm->_alwaysComputed )
293 const TopoDS_Shape & ss = sm->GetSubShape();
295 // MSV 07.04.2006: restrict checking to myDim-1 only. Ex., there is no sense
296 // in checking of existence of edges if the algo needs only faces. Moreover,
297 // degenerated edges may have no sub-mesh, as after computing NETGEN_2D.
298 if ( !_algo || _algo->NeedDiscreteBoundary() ) {
299 int dim = SMESH_Gen::GetShapeDim( ss );
300 if (dim < dimToCheck)
301 break; // the rest sub-meshes are all of less dimension
303 SMESHDS_SubMesh * ds = sm->GetSubMeshDS();
304 bool computeOk = ((sm->GetComputeState() == COMPUTE_OK ) ||
305 (ds && ( dimToCheck ? ds->NbElements() : ds->NbNodes() )));
308 subMeshesComputed = false;
310 if ( isFailedToCompute && !(*isFailedToCompute) )
311 *isFailedToCompute = ( sm->GetComputeState() == FAILED_TO_COMPUTE );
313 if ( !isFailedToCompute )
317 return subMeshesComputed;
320 //================================================================================
322 * \brief Return cost of computing this sub-mesh. If hypotheses are not well defined,
324 * \return int - the computation cost in abstract units.
326 //================================================================================
328 int SMESH_subMesh::GetComputeCost() const
330 return _realComputeCost;
333 //================================================================================
335 * \brief Return cost of computing this sub-mesh. The cost depends on the shape type
336 * and number of sub-meshes this one DependsOn().
337 * \return int - the computation cost in abstract units.
339 //================================================================================
341 int SMESH_subMesh::computeCost() const
346 switch ( _subShape.ShapeType() ) {
348 case TopAbs_SHELL: computeCost = 5000; break;
349 case TopAbs_FACE: computeCost = 500; break;
350 case TopAbs_EDGE: computeCost = 2; break;
351 default: computeCost = 1;
353 SMESH_subMeshIteratorPtr childIt = getDependsOnIterator(/*includeSelf=*/false);
354 while ( childIt->more() )
355 computeCost += childIt->next()->computeCost();
357 ((SMESH_subMesh*)this)->_computeCost = computeCost;
362 //=============================================================================
364 * Returns all sub-meshes this one depend on
366 //=============================================================================
368 const std::map < int, SMESH_subMesh * >& SMESH_subMesh::DependsOn()
370 if ( _dependenceAnalysed || !_father->HasShapeToMesh() )
373 int type = _subShape.ShapeType();
376 case TopAbs_COMPOUND:
378 list< TopoDS_Shape > compounds( 1, _subShape );
379 list< TopoDS_Shape >::iterator comp = compounds.begin();
380 for ( ; comp != compounds.end(); ++comp )
382 for ( TopoDS_Iterator sub( *comp ); sub.More(); sub.Next() )
383 switch ( sub.Value().ShapeType() )
385 case TopAbs_COMPOUND: compounds.push_back( sub.Value() ); break;
386 case TopAbs_COMPSOLID: insertDependence( sub.Value(), TopAbs_SOLID ); break;
387 case TopAbs_SOLID: insertDependence( sub.Value(), TopAbs_SOLID ); break;
388 case TopAbs_SHELL: insertDependence( sub.Value(), TopAbs_FACE ); break;
389 case TopAbs_FACE: insertDependence( sub.Value(), TopAbs_FACE ); break;
390 case TopAbs_WIRE: insertDependence( sub.Value(), TopAbs_EDGE ); break;
391 case TopAbs_EDGE: insertDependence( sub.Value(), TopAbs_EDGE ); break;
392 case TopAbs_VERTEX: insertDependence( sub.Value(), TopAbs_VERTEX ); break;
398 case TopAbs_COMPSOLID: insertDependence( _subShape, TopAbs_SOLID ); break;
399 case TopAbs_SOLID: insertDependence( _subShape, TopAbs_FACE );
400 { /*internal EDGE*/ insertDependence( _subShape, TopAbs_EDGE, TopAbs_WIRE ); break; }
401 case TopAbs_SHELL: insertDependence( _subShape, TopAbs_FACE ); break;
402 case TopAbs_FACE: insertDependence( _subShape, TopAbs_EDGE ); break;
403 case TopAbs_WIRE: insertDependence( _subShape, TopAbs_EDGE ); break;
404 case TopAbs_EDGE: insertDependence( _subShape, TopAbs_VERTEX ); break;
407 _dependenceAnalysed = true;
411 //================================================================================
413 * \brief Return a key for SMESH_subMesh::_mapDepend map
415 //================================================================================
419 int dependsOnMapKey( TopAbs_ShapeEnum type, int shapeID )
421 int ordType = 9 - int(type); // 2 = Vertex, 8 = CompSolid
423 cle += 10000000 * ordType; // sort map by ordType then index
426 int dependsOnMapKey( const SMESH_subMesh* sm )
428 return dependsOnMapKey( sm->GetSubShape().ShapeType(), sm->GetId() );
432 //=============================================================================
434 * Add sub-meshes on sub-shapes of a given type into the dependence map.
436 //=============================================================================
438 void SMESH_subMesh::insertDependence(const TopoDS_Shape aShape,
439 TopAbs_ShapeEnum aSubType,
440 TopAbs_ShapeEnum avoidType)
442 TopExp_Explorer sub( aShape, aSubType, avoidType );
443 for ( ; sub.More(); sub.Next() )
445 SMESH_subMesh *aSubMesh = _father->GetSubMesh( sub.Current() );
446 if ( aSubMesh->GetId() == 0 )
447 continue; // not a sub-shape of the shape to mesh
448 int cle = dependsOnMapKey( aSubMesh );
449 if ( _mapDepend.find( cle ) == _mapDepend.end())
451 _mapDepend[cle] = aSubMesh;
452 const map < int, SMESH_subMesh * > & subMap = aSubMesh->DependsOn();
453 _mapDepend.insert( subMap.begin(), subMap.end() );
458 //================================================================================
460 * \brief Return \c true if \a this sub-mesh depends on \a other
462 //================================================================================
464 bool SMESH_subMesh::DependsOn( const SMESH_subMesh* other ) const
466 return other ? _mapDepend.count( dependsOnMapKey( other )) : false;
469 //================================================================================
471 * \brief Return \c true if \a this sub-mesh depends on a \a shape
473 //================================================================================
475 bool SMESH_subMesh::DependsOn( const int shapeID ) const
477 return DependsOn( _father->GetSubMeshContaining( shapeID ));
480 //=============================================================================
482 * Return a shape of \a this sub-mesh
484 //=============================================================================
486 const TopoDS_Shape & SMESH_subMesh::GetSubShape() const
491 //=======================================================================
492 //function : CanAddHypothesis
493 //purpose : return true if theHypothesis can be attached to me:
494 // its dimension is checked
495 //=======================================================================
497 bool SMESH_subMesh::CanAddHypothesis(const SMESH_Hypothesis* theHypothesis) const
499 int aHypDim = theHypothesis->GetDim();
500 int aShapeDim = SMESH_Gen::GetShapeDim(_subShape);
501 // issue 21106. Forbid 3D mesh on the SHELL
502 // if (aHypDim == 3 && aShapeDim == 3) {
503 // // check case of open shell
504 // //if (_subShape.ShapeType() == TopAbs_SHELL && !_subShape.Closed())
505 // if (_subShape.ShapeType() == TopAbs_SHELL && !BRep_Tool::IsClosed(_subShape))
508 if ( aHypDim <= aShapeDim )
514 //=======================================================================
515 //function : IsApplicableHypothesis
516 //purpose : check if this sub-mesh can be computed using a hypothesis
517 //=======================================================================
519 bool SMESH_subMesh::IsApplicableHypothesis(const SMESH_Hypothesis* theHypothesis) const
521 if ( !_father->HasShapeToMesh() && _subShape.ShapeType() == TopAbs_SOLID )
522 return true; // true for the PseudoShape
524 return IsApplicableHypothesis( theHypothesis, _subShape.ShapeType() );
527 //=======================================================================
528 //function : IsApplicableHypothesis
529 //purpose : compare shape type and hypothesis type
530 //=======================================================================
532 bool SMESH_subMesh::IsApplicableHypothesis(const SMESH_Hypothesis* theHypothesis,
533 const TopAbs_ShapeEnum theShapeType)
535 if ( theHypothesis->GetType() > SMESHDS_Hypothesis::PARAM_ALGO)
538 if ( theHypothesis->GetShapeType() & (1<< theShapeType))
539 // issue 21106. Forbid 3D mesh on the SHELL
540 return !( theHypothesis->GetDim() == 3 && theShapeType == TopAbs_SHELL );
546 switch ( theShapeType ) {
551 return SMESH_Gen::GetShapeDim( theShapeType ) == theHypothesis->GetDim();
554 // Special case for algorithms, building 2D mesh on a whole shell.
555 // Before this fix there was a problem after restoring from study,
556 // because in that case algorithm is assigned before hypothesis
557 // (on shell in problem case) and hypothesis is checked on faces
558 // (because it is 2D), where we have NO_ALGO state.
559 // Now 2D hypothesis is also applicable to shells.
560 return (theHypothesis->GetDim() == 2 || theHypothesis->GetDim() == 3);
563 // case TopAbs_COMPSOLID:
564 // case TopAbs_COMPOUND:
570 //================================================================================
572 * \brief Treats modification of hypotheses definition
573 * \param [in] event - what happens
574 * \param [in] anHyp - a hypothesis
575 * \return SMESH_Hypothesis::Hypothesis_Status - a treatment result.
577 * Optional description of a problematic situation (if any) can be retrieved
578 * via GetComputeError().
580 //================================================================================
582 SMESH_Hypothesis::Hypothesis_Status
583 SMESH_subMesh::AlgoStateEngine(algo_event event, SMESH_Hypothesis * anHyp)
585 // **** les retour des evenement shape sont significatifs
586 // (add ou remove fait ou non)
587 // le retour des evenement father n'indiquent pas que add ou remove fait
589 SMESH_Hypothesis::Hypothesis_Status aux_ret, ret = SMESH_Hypothesis::HYP_OK;
590 if ( _Id == 0 ) return ret; // not a sub-shape of the shape to mesh
592 SMESHDS_Mesh* meshDS =_father->GetMeshDS();
593 SMESH_Algo* algo = 0;
596 if (_subShape.ShapeType() == TopAbs_VERTEX )
598 if ( anHyp->GetDim() != 0) {
599 if (event == ADD_HYP || event == ADD_ALGO)
600 return SMESH_Hypothesis::HYP_BAD_DIM;
602 return SMESH_Hypothesis::HYP_OK;
605 else if ( _algoState == HYP_OK ) {
606 // update default _algoState
607 if ( event != REMOVE_FATHER_ALGO )
609 _algoState = NO_ALGO;
612 _algoState = MISSING_HYP;
613 if ( event == REMOVE_FATHER_HYP ||
614 algo->CheckHypothesis(*_father,_subShape, aux_ret))
621 int oldAlgoState = _algoState;
622 bool modifiedHyp = (event == MODIF_HYP); // if set to true, force event MODIF_ALGO_STATE
623 SMESH_Algo* algoRequiringCleaning = 0;
625 bool isApplicableHyp = IsApplicableHypothesis( anHyp );
627 if (event == ADD_ALGO || event == ADD_FATHER_ALGO)
629 // -------------------------------------------
630 // check if a shape needed by algo is present
631 // -------------------------------------------
632 algo = static_cast< SMESH_Algo* >( anHyp );
633 if ( !_father->HasShapeToMesh() && algo->NeedShape() )
634 return SMESH_Hypothesis::HYP_NEED_SHAPE;
635 // ----------------------
636 // check mesh conformity
637 // ----------------------
638 if (isApplicableHyp && !_father->IsNotConformAllowed() && !IsConform( algo ))
639 return SMESH_Hypothesis::HYP_NOTCONFORM;
641 // check if all-dimensional algo is hidden by other local one
642 if ( event == ADD_ALGO ) {
643 SMESH_HypoFilter filter( SMESH_HypoFilter::HasType( algo->GetType() ));
644 filter.Or( SMESH_HypoFilter::HasType( algo->GetType()+1 ));
645 filter.Or( SMESH_HypoFilter::HasType( algo->GetType()+2 ));
646 if ( SMESH_Algo * curAlgo = (SMESH_Algo*)_father->GetHypothesis( this, filter, true ))
647 if ( !curAlgo->NeedDiscreteBoundary() && curAlgo != anHyp )
648 algoRequiringCleaning = curAlgo;
652 // ----------------------------------
653 // add a hypothesis to DS if possible
654 // ----------------------------------
655 if (event == ADD_HYP || event == ADD_ALGO)
657 if ( ! CanAddHypothesis( anHyp )) // check dimension
658 return SMESH_Hypothesis::HYP_BAD_DIM;
660 if ( !anHyp->IsAuxiliary() && getSimilarAttached( _subShape, anHyp ) )
661 return SMESH_Hypothesis::HYP_ALREADY_EXIST;
663 if ( !meshDS->AddHypothesis(_subShape, anHyp))
664 return SMESH_Hypothesis::HYP_ALREADY_EXIST;
667 // --------------------------
668 // remove a hypothesis from DS
669 // --------------------------
670 if (event == REMOVE_HYP || event == REMOVE_ALGO)
672 if (!meshDS->RemoveHypothesis(_subShape, anHyp))
673 return SMESH_Hypothesis::HYP_OK; // nothing changes
675 if (event == REMOVE_ALGO)
677 algo = dynamic_cast<SMESH_Algo*> (anHyp);
678 if (!algo->NeedDiscreteBoundary())
679 algoRequiringCleaning = algo;
683 // ------------------
684 // analyse algo state
685 // ------------------
686 if (!isApplicableHyp)
687 return ret; // not applicable hypotheses do not change algo state
689 if (( algo = GetAlgo()))
690 algo->InitComputeError();
695 // ----------------------------------------------------------------------
704 if (algo->CheckHypothesis((*_father),_subShape, aux_ret))
705 setAlgoState(HYP_OK);
706 else if ( algo->IsStatusFatal( aux_ret )) {
707 meshDS->RemoveHypothesis(_subShape, anHyp);
711 setAlgoState(MISSING_HYP);
718 case ADD_FATHER_ALGO: { // Algo just added in father
721 if ( algo == anHyp ) {
722 if ( algo->CheckHypothesis((*_father),_subShape, aux_ret))
723 setAlgoState(HYP_OK);
725 setAlgoState(MISSING_HYP);
729 case REMOVE_FATHER_HYP:
731 case REMOVE_FATHER_ALGO: {
735 if ( algo->CheckHypothesis((*_father),_subShape, aux_ret ))
736 setAlgoState(HYP_OK);
738 setAlgoState(MISSING_HYP);
742 case MODIF_HYP: break;
749 // ----------------------------------------------------------------------
757 if ( algo->CheckHypothesis((*_father),_subShape, ret ))
758 setAlgoState(HYP_OK);
759 if (SMESH_Hypothesis::IsStatusFatal( ret ))
760 meshDS->RemoveHypothesis(_subShape, anHyp);
761 else if (!_father->IsUsedHypothesis( anHyp, this ))
763 meshDS->RemoveHypothesis(_subShape, anHyp);
764 ret = SMESH_Hypothesis::HYP_INCOMPATIBLE;
768 case ADD_ALGO: { //already existing algo : on father ?
771 if ( algo->CheckHypothesis((*_father),_subShape, aux_ret ))// ignore hyp status
772 setAlgoState(HYP_OK);
773 else if ( algo->IsStatusFatal( aux_ret )) {
774 meshDS->RemoveHypothesis(_subShape, anHyp);
778 setAlgoState(MISSING_HYP);
783 case REMOVE_ALGO: { // perhaps a father algo applies ?
785 if (algo == NULL) // no more algo applying on sub-shape...
787 setAlgoState(NO_ALGO);
791 if ( algo->CheckHypothesis((*_father),_subShape, aux_ret ))
792 setAlgoState(HYP_OK);
794 setAlgoState(MISSING_HYP);
798 case MODIF_HYP: // assigned hypothesis value may become good
799 case ADD_FATHER_HYP: {
802 if ( algo->CheckHypothesis((*_father),_subShape, aux_ret ))
803 setAlgoState(HYP_OK);
805 setAlgoState(MISSING_HYP);
808 case ADD_FATHER_ALGO: { // new father algo
811 if ( algo == anHyp ) {
812 if ( algo->CheckHypothesis((*_father),_subShape, aux_ret ))
813 setAlgoState(HYP_OK);
815 setAlgoState(MISSING_HYP);
819 case REMOVE_FATHER_HYP: // nothing to do
821 case REMOVE_FATHER_ALGO: {
823 if (algo == NULL) // no more applying algo on father
825 setAlgoState(NO_ALGO);
829 if ( algo->CheckHypothesis((*_father),_subShape , aux_ret ))
830 setAlgoState(HYP_OK);
832 setAlgoState(MISSING_HYP);
842 // ----------------------------------------------------------------------
850 if (!algo->CheckHypothesis((*_father),_subShape, ret ))
852 if ( !SMESH_Hypothesis::IsStatusFatal( ret ))
853 // ret should be fatal: anHyp was not added
854 ret = SMESH_Hypothesis::HYP_INCOMPATIBLE;
856 else if (!_father->IsUsedHypothesis( anHyp, this ))
857 ret = SMESH_Hypothesis::HYP_INCOMPATIBLE;
859 if (SMESH_Hypothesis::IsStatusFatal( ret ))
861 MESSAGE("do not add extra hypothesis");
862 meshDS->RemoveHypothesis(_subShape, anHyp);
870 case ADD_ALGO: { //already existing algo : on father ?
872 if ( algo->CheckHypothesis((*_father),_subShape, aux_ret )) {
873 // check if algo changes
875 f.Init( SMESH_HypoFilter::IsAlgo() );
876 f.And( SMESH_HypoFilter::IsApplicableTo( _subShape ));
877 f.AndNot( SMESH_HypoFilter::Is( algo ));
878 const SMESH_Hypothesis * prevAlgo = _father->GetHypothesis( this, f, true );
880 string( algo->GetName()) != prevAlgo->GetName())
882 oldAlgoState = NO_ALGO; // force setting event listener (#16648)
887 setAlgoState(MISSING_HYP);
893 if ( algo->CheckHypothesis((*_father),_subShape, aux_ret ))
894 setAlgoState(HYP_OK);
896 setAlgoState(MISSING_HYP);
900 case REMOVE_ALGO: { // perhaps a father algo applies ?
902 if (algo == NULL) // no more algo applying on sub-shape...
904 setAlgoState(NO_ALGO);
908 if ( algo->CheckHypothesis((*_father),_subShape, aux_ret )) {
909 // check if algo remains
910 if ( anHyp != algo && strcmp( anHyp->GetName(), algo->GetName()) )
914 setAlgoState(MISSING_HYP);
918 case MODIF_HYP: // hypothesis value may become bad
919 case ADD_FATHER_HYP: { // new father hypothesis ?
922 if ( algo->CheckHypothesis((*_father),_subShape, aux_ret ))
924 if (_father->IsUsedHypothesis( anHyp, this )) // new Hyp
928 setAlgoState(MISSING_HYP);
931 case ADD_FATHER_ALGO: {
933 if ( algo == anHyp ) { // a new algo on father
934 if ( algo->CheckHypothesis((*_father),_subShape, aux_ret )) {
935 // check if algo changes
937 f.Init( SMESH_HypoFilter::IsAlgo() );
938 f.And( SMESH_HypoFilter::IsApplicableTo( _subShape ));
939 f.AndNot( SMESH_HypoFilter::Is( algo ));
940 const SMESH_Hypothesis* prevAlgo = _father->GetHypothesis( this, f, true );
942 string(algo->GetName()) != string(prevAlgo->GetName()) )
946 setAlgoState(MISSING_HYP);
950 case REMOVE_FATHER_HYP: {
953 if ( algo->CheckHypothesis((*_father),_subShape, aux_ret )) {
954 // is there the same local hyp or maybe a new father algo applied?
955 if ( !getSimilarAttached( _subShape, anHyp ) )
959 setAlgoState(MISSING_HYP);
962 case REMOVE_FATHER_ALGO: {
963 // IPAL21346. Edges not removed when Netgen 1d-2d is removed from a SOLID.
964 // CLEAN was not called at event REMOVE_ALGO because the algo is not applicable to SOLID.
965 algo = dynamic_cast<SMESH_Algo*> (anHyp);
966 if (!algo->NeedDiscreteBoundary())
967 algoRequiringCleaning = algo;
969 if (algo == NULL) // no more applying algo on father
971 setAlgoState(NO_ALGO);
975 if ( algo->CheckHypothesis((*_father),_subShape, aux_ret )) {
976 // check if algo changes
977 if ( string(algo->GetName()) != string( anHyp->GetName()) )
981 setAlgoState(MISSING_HYP);
991 // ----------------------------------------------------------------------
998 // detect algorithm hiding
1000 if ( ret == SMESH_Hypothesis::HYP_OK &&
1001 ( event == ADD_ALGO || event == ADD_FATHER_ALGO ) && algo &&
1002 algo->GetName() == anHyp->GetName() )
1005 SMESH_Gen* gen = _father->GetGen();
1006 const std::vector< SMESH_subMesh * > & ancestors = GetAncestors();
1007 for ( size_t iA = 0; ( ret == SMESH_Hypothesis::HYP_OK && iA < ancestors.size()); ++iA ) {
1008 if ( SMESH_Algo* upperAlgo = ancestors[ iA ]->GetAlgo() )
1009 if ( !upperAlgo->NeedDiscreteBoundary() && !upperAlgo->SupportSubmeshes())
1010 ret = SMESH_Hypothesis::HYP_HIDDEN_ALGO;
1013 if ( ret == SMESH_Hypothesis::HYP_OK &&
1014 !algo->NeedDiscreteBoundary() &&
1015 !algo->SupportSubmeshes())
1017 TopoDS_Shape algoAssignedTo, otherAssignedTo;
1018 gen->GetAlgo( this, &algoAssignedTo );
1019 map<int, SMESH_subMesh*>::reverse_iterator i_sm = _mapDepend.rbegin();
1020 for ( ; ( ret == SMESH_Hypothesis::HYP_OK && i_sm != _mapDepend.rend()) ; ++i_sm )
1021 if ( gen->GetAlgo( i_sm->second, &otherAssignedTo ) &&
1022 SMESH_MesherHelper::IsSubShape( /*sub=*/otherAssignedTo, /*main=*/algoAssignedTo ))
1023 ret = SMESH_Hypothesis::HYP_HIDING_ALGO;
1027 if ( _algo ) { // get an error description set by _algo->CheckHypothesis()
1028 _computeError = _algo->GetComputeError();
1029 _algo->InitComputeError();
1032 bool stateChange = ( _algoState != oldAlgoState );
1034 if ( stateChange && _algoState == HYP_OK ) // hyp becomes OK
1035 algo->SetEventListener( this );
1037 if ( event == REMOVE_ALGO || event == REMOVE_FATHER_ALGO )
1040 notifyListenersOnEvent( event, ALGO_EVENT, anHyp );
1042 if ( stateChange && oldAlgoState == HYP_OK ) { // hyp becomes KO
1043 deleteOwnListeners();
1044 SetIsAlwaysComputed( false );
1045 if (_subShape.ShapeType() == TopAbs_VERTEX ) {
1046 // restore default states
1047 _algoState = HYP_OK;
1048 _computeState = READY_TO_COMPUTE;
1052 if ( algoRequiringCleaning ) {
1053 // added or removed algo is all-dimensional
1054 ComputeStateEngine( CLEAN );
1055 cleanDependsOn( algoRequiringCleaning );
1056 ComputeSubMeshStateEngine( CHECK_COMPUTE_STATE );
1059 if ( stateChange || modifiedHyp )
1060 ComputeStateEngine( MODIF_ALGO_STATE );
1062 _realComputeCost = ( _algoState == HYP_OK ) ? computeCost() : 0;
1067 //=======================================================================
1068 //function : IsConform
1069 //purpose : check if a conform mesh will be produced by the Algo
1070 //=======================================================================
1072 bool SMESH_subMesh::IsConform(const SMESH_Algo* theAlgo)
1074 // MESSAGE( "SMESH_subMesh::IsConform" );
1075 if ( !theAlgo ) return false;
1077 // Suppose that theAlgo is applicable to _subShape, do not check it here
1078 //if ( !IsApplicableHypothesis( theAlgo )) return false;
1080 // check only algo that doesn't NeedDiscreteBoundary(): because mesh made
1081 // on a sub-shape will be ignored by theAlgo
1082 if ( theAlgo->NeedDiscreteBoundary() ||
1083 !theAlgo->OnlyUnaryInput() ) // all adjacent shapes will be meshed by this algo?
1086 // only local algo is to be checked
1087 //if ( gen->IsGlobalHypothesis( theAlgo, *_father ))
1088 if ( _subShape.ShapeType() == _father->GetMeshDS()->ShapeToMesh().ShapeType() )
1091 // check algo attached to adjacent shapes
1093 // loop on one level down sub-meshes
1094 TopoDS_Iterator itsub( _subShape );
1095 for (; itsub.More(); itsub.Next())
1097 // loop on adjacent subShapes
1098 const std::vector< SMESH_subMesh * > & ancestors = GetAncestors();
1099 for ( size_t iA = 0; iA < ancestors.size(); ++iA )
1101 const TopoDS_Shape& adjacent = ancestors[ iA ]->GetSubShape();
1102 if ( _subShape.IsSame( adjacent )) continue;
1103 if ( adjacent.ShapeType() != _subShape.ShapeType())
1106 // check algo attached to smAdjacent
1107 SMESH_Algo * algo = ancestors[ iA ]->GetAlgo();
1109 !algo->NeedDiscreteBoundary() &&
1110 algo->OnlyUnaryInput())
1111 return false; // NOT CONFORM MESH WILL BE PRODUCED
1118 //=============================================================================
1122 //=============================================================================
1124 void SMESH_subMesh::setAlgoState(algo_state state)
1129 //================================================================================
1131 * \brief Send an event to sub-meshes
1132 * \param [in] event - the event
1133 * \param [in] anHyp - an hypothesis
1134 * \param [in] exitOnFatal - to stop iteration on sub-meshes if a sub-mesh
1135 * reports a fatal result
1136 * \return SMESH_Hypothesis::Hypothesis_Status - the worst result
1138 * Optional description of a problematic situation (if any) can be retrieved
1139 * via GetComputeError().
1141 //================================================================================
1143 SMESH_Hypothesis::Hypothesis_Status
1144 SMESH_subMesh::SubMeshesAlgoStateEngine(algo_event event,
1145 SMESH_Hypothesis * anHyp,
1148 SMESH_Hypothesis::Hypothesis_Status ret = SMESH_Hypothesis::HYP_OK;
1149 //EAP: a wire (dim==1) should notify edges (dim==1)
1150 //EAP: int dim = SMESH_Gen::GetShapeDim(_subShape);
1151 //if (_subShape.ShapeType() < TopAbs_EDGE ) // wire,face etc
1153 SMESH_subMeshIteratorPtr smIt = getDependsOnIterator(false,false);
1154 while ( smIt->more() ) {
1155 SMESH_subMesh* sm = smIt->next();
1156 SMESH_Hypothesis::Hypothesis_Status ret2 = sm->AlgoStateEngine(event, anHyp);
1160 _computeError = sm->_computeError;
1161 sm->_computeError.reset();
1162 if ( exitOnFatal && SMESH_Hypothesis::IsStatusFatal( ret ))
1170 //================================================================================
1172 * \brief Remove elements from sub-meshes.
1173 * \param algoRequiringCleaning - an all-dimensional algorithm whose presence
1174 * causes the cleaning.
1176 //================================================================================
1178 void SMESH_subMesh::cleanDependsOn( SMESH_Algo* algoRequiringCleaning/*=0*/ )
1180 SMESH_subMeshIteratorPtr smIt = getDependsOnIterator(false,
1181 /*complexShapeFirst=*/true);
1182 if ( _father->NbNodes() == 0 )
1184 while ( smIt->more() )
1185 smIt->next()->ComputeStateEngine(CHECK_COMPUTE_STATE);
1187 else if ( !algoRequiringCleaning || !algoRequiringCleaning->SupportSubmeshes() )
1189 while ( smIt->more() )
1190 smIt->next()->ComputeStateEngine(CLEAN);
1192 else if ( algoRequiringCleaning && algoRequiringCleaning->SupportSubmeshes() )
1194 // find sub-meshes to keep elements on
1195 set< SMESH_subMesh* > smToKeep;
1196 TopAbs_ShapeEnum prevShapeType = TopAbs_SHAPE;
1197 bool toKeepPrevShapeType = false;
1198 while ( smIt->more() )
1200 SMESH_subMesh* sm = smIt->next();
1201 sm->ComputeStateEngine(CHECK_COMPUTE_STATE);
1202 if ( !sm->IsEmpty() )
1204 const bool sameShapeType = ( prevShapeType == sm->GetSubShape().ShapeType() );
1205 bool keepSubMeshes = ( sameShapeType && toKeepPrevShapeType );
1206 if ( !sameShapeType )
1208 // check if the algo allows presence of global algos of dimension the algo
1209 // can generate it-self;
1210 // always keep a node on VERTEX, as this node can be shared by segments
1211 // lying on EDGEs not shared by the VERTEX of sm, due to MergeNodes (PAL23068)
1212 int shapeDim = SMESH_Gen::GetShapeDim( sm->GetSubShape() );
1213 keepSubMeshes = ( algoRequiringCleaning->NeedLowerHyps( shapeDim ) || shapeDim == 0 );
1214 prevShapeType = sm->GetSubShape().ShapeType();
1215 toKeepPrevShapeType = keepSubMeshes;
1217 if ( !keepSubMeshes )
1219 // look for a local algo used to mesh sm
1220 TopoDS_Shape algoShape = SMESH_MesherHelper::GetShapeOfHypothesis
1221 ( algoRequiringCleaning, _subShape, _father );
1222 SMESH_HypoFilter moreLocalAlgo;
1223 moreLocalAlgo.Init( SMESH_HypoFilter::IsMoreLocalThan( algoShape, *_father ));
1224 moreLocalAlgo.And ( SMESH_HypoFilter::IsAlgo() );
1225 bool localAlgoFound = _father->GetHypothesis( sm->_subShape, moreLocalAlgo, true );
1226 keepSubMeshes = localAlgoFound;
1228 // remember all sub-meshes of sm
1229 if ( keepSubMeshes )
1231 SMESH_subMeshIteratorPtr smIt2 = sm->getDependsOnIterator(true);
1232 while ( smIt2->more() )
1233 smToKeep.insert( smIt2->next() );
1238 SMESH_subMeshIteratorPtr smIt = getDependsOnIterator(false,true);
1239 while ( smIt->more() )
1241 SMESH_subMesh* sm = smIt->next();
1242 if ( !smToKeep.count( sm ))
1243 sm->ComputeStateEngine(CLEAN);
1248 //=============================================================================
1252 //=============================================================================
1254 void SMESH_subMesh::DumpAlgoState(bool isMain)
1258 const map < int, SMESH_subMesh * >&subMeshes = DependsOn();
1260 map < int, SMESH_subMesh * >::const_iterator itsub;
1261 for (itsub = subMeshes.begin(); itsub != subMeshes.end(); itsub++)
1263 SMESH_subMesh *sm = (*itsub).second;
1264 sm->DumpAlgoState(false);
1267 MESSAGE("dim = " << SMESH_Gen::GetShapeDim(_subShape) <<
1268 " type of shape " << _subShape.ShapeType());
1271 case NO_ALGO : MESSAGE(" AlgoState = NO_ALGO"); break;
1272 case MISSING_HYP : MESSAGE(" AlgoState = MISSING_HYP"); break;
1273 case HYP_OK : MESSAGE(" AlgoState = HYP_OK");break;
1275 switch (_computeState)
1277 case NOT_READY : MESSAGE(" ComputeState = NOT_READY");break;
1278 case READY_TO_COMPUTE : MESSAGE(" ComputeState = READY_TO_COMPUTE");break;
1279 case COMPUTE_OK : MESSAGE(" ComputeState = COMPUTE_OK");break;
1280 case FAILED_TO_COMPUTE: MESSAGE(" ComputeState = FAILED_TO_COMPUTE");break;
1284 //================================================================================
1286 * \brief Remove nodes and elements bound to submesh
1287 * \param subMesh - submesh containing nodes and elements
1289 //================================================================================
1291 static void cleanSubMesh( SMESH_subMesh * subMesh )
1294 if (SMESHDS_SubMesh * subMeshDS = subMesh->GetSubMeshDS())
1296 SMESHDS_Mesh * meshDS = subMesh->GetFather()->GetMeshDS();
1297 int nbElems = subMeshDS->NbElements();
1299 for ( SMDS_ElemIteratorPtr ite = subMeshDS->GetElements(); ite->more(); )
1300 meshDS->RemoveFreeElement( ite->next(), subMeshDS );
1302 int nbNodes = subMeshDS->NbNodes();
1304 for ( SMDS_NodeIteratorPtr itn = subMeshDS->GetNodes(); itn->more() ; )
1306 const SMDS_MeshNode * node = itn->next();
1307 if ( node->NbInverseElements() == 0 )
1308 meshDS->RemoveFreeNode( node, subMeshDS );
1309 else // for StdMeshers_CompositeSegment_1D: node in one submesh, edge in another
1310 meshDS->RemoveNode( node );
1317 //=============================================================================
1321 //=============================================================================
1323 bool SMESH_subMesh::ComputeStateEngine(compute_event event)
1326 case MODIF_ALGO_STATE:
1328 case COMPUTE_SUBMESH:
1329 //case COMPUTE_CANCELED:
1331 //case SUBMESH_COMPUTED:
1332 //case SUBMESH_RESTORED:
1333 //case SUBMESH_LOADED:
1334 //case MESH_ENTITY_REMOVED:
1335 //case CHECK_COMPUTE_STATE:
1336 _computeError.reset(); break;
1340 if ( event == CLEAN )
1341 _alwaysComputed = false; // Unset 'true' set by MergeNodes() (issue 0022182)
1343 if (_subShape.ShapeType() == TopAbs_VERTEX)
1345 _computeState = READY_TO_COMPUTE;
1346 SMESHDS_SubMesh* smDS = GetSubMeshDS();
1347 if ( smDS && smDS->NbNodes() )
1349 if ( event == CLEAN ) {
1351 cleanSubMesh( this );
1354 _computeState = COMPUTE_OK;
1356 else if (( event == COMPUTE || event == COMPUTE_SUBMESH )
1357 && !_alwaysComputed )
1359 const TopoDS_Vertex & V = TopoDS::Vertex( _subShape );
1360 gp_Pnt P = BRep_Tool::Pnt(V);
1361 if ( SMDS_MeshNode * n = _father->GetMeshDS()->AddNode(P.X(), P.Y(), P.Z()) ) {
1362 _father->GetMeshDS()->SetNodeOnVertex(n,_Id);
1363 _computeState = COMPUTE_OK;
1366 if ( event == MODIF_ALGO_STATE )
1370 SMESH_Gen *gen = _father->GetGen();
1371 SMESH_Algo *algo = 0;
1373 SMESH_Hypothesis::Hypothesis_Status hyp_status;
1374 //algo_state oldAlgoState = (algo_state) GetAlgoState();
1376 switch (_computeState)
1379 // ----------------------------------------------------------------------
1384 case MODIF_ALGO_STATE:
1386 if (algo && !algo->NeedDiscreteBoundary())
1387 cleanDependsOn( algo ); // clean sub-meshes with event CLEAN
1388 if ( _algoState == HYP_OK )
1389 _computeState = READY_TO_COMPUTE;
1391 case COMPUTE: // nothing to do
1392 case COMPUTE_SUBMESH:
1394 case COMPUTE_CANCELED: // nothing to do
1398 removeSubMeshElementsAndNodes();
1400 case SUBMESH_COMPUTED: // nothing to do
1402 case SUBMESH_RESTORED:
1403 ComputeSubMeshStateEngine( SUBMESH_RESTORED );
1405 case MESH_ENTITY_REMOVED:
1407 case SUBMESH_LOADED:
1408 loadDependentMeshes();
1409 ComputeSubMeshStateEngine( SUBMESH_LOADED );
1411 case CHECK_COMPUTE_STATE:
1412 if ( IsMeshComputed() )
1413 _computeState = COMPUTE_OK;
1421 // ----------------------------------------------------------------------
1423 case READY_TO_COMPUTE:
1426 case MODIF_ALGO_STATE:
1427 _computeState = NOT_READY;
1431 if (!algo->NeedDiscreteBoundary())
1432 cleanDependsOn( algo ); // clean sub-meshes with event CLEAN
1433 if ( _algoState == HYP_OK )
1434 _computeState = READY_TO_COMPUTE;
1438 case COMPUTE_NOGEOM: // no geometry; can be several algos
1439 if ( !_father->HasShapeToMesh() )
1441 algo = GetAlgo(); // current algo
1444 // apply algos in the order of increasing dimension
1445 std::list< const SMESHDS_Hypothesis * > algos = _father->GetHypothesisList( _subShape );
1446 for ( int t = SMESHDS_Hypothesis::ALGO_1D; t <= SMESHDS_Hypothesis::ALGO_3D; ++t )
1448 std::list<const SMESHDS_Hypothesis *>::iterator al = algos.begin();
1449 for ( ; al != algos.end(); ++al )
1450 if ( (*al)->GetType() == t )
1452 _algo = (SMESH_Algo*) *al;
1453 _computeState = READY_TO_COMPUTE;
1454 if ( !ComputeStateEngine( COMPUTE ))
1458 _algo = algo; // restore
1463 case COMPUTE_SUBMESH:
1467 ret = algo->CheckHypothesis((*_father), _subShape, hyp_status);
1470 MESSAGE("***** verify compute state *****");
1471 _computeState = NOT_READY;
1472 setAlgoState(MISSING_HYP);
1475 TopoDS_Shape shape = _subShape;
1476 algo->SubMeshesToCompute().assign( 1, this );
1477 // check submeshes needed
1478 if (_father->HasShapeToMesh() ) {
1479 bool subComputed = false, subFailed = false;
1480 if (!algo->OnlyUnaryInput()) {
1481 if ( event == COMPUTE /*&&
1482 ( algo->NeedDiscreteBoundary() || algo->SupportSubmeshes() )*/)
1483 shape = getCollection( gen, algo, subComputed, subFailed, algo->SubMeshesToCompute());
1485 subComputed = SubMeshesComputed( & subFailed );
1488 subComputed = SubMeshesComputed();
1490 ret = ( algo->NeedDiscreteBoundary() ? subComputed :
1491 algo->SupportSubmeshes() ? !subFailed :
1492 ( !subComputed || _father->IsNotConformAllowed() ));
1495 _computeState = FAILED_TO_COMPUTE;
1496 if ( !algo->NeedDiscreteBoundary() && !subFailed )
1498 SMESH_ComputeError::New(COMPERR_BAD_INPUT_MESH,
1499 "Unexpected computed sub-mesh",algo);
1505 // to restore cout that may be redirected by algo
1506 std::streambuf* coutBuffer = std::cout.rdbuf();
1508 //cleanDependants(); for "UseExisting_*D" algos
1509 //removeSubMeshElementsAndNodes();
1510 loadDependentMeshes();
1512 _computeState = FAILED_TO_COMPUTE;
1513 _computeError = SMESH_ComputeError::New(COMPERR_OK,"",algo);
1517 algo->InitComputeError();
1519 MemoryReserve aMemoryReserve;
1520 SMDS_Mesh::CheckMemory();
1521 Kernel_Utils::Localizer loc;
1522 if ( !_father->HasShapeToMesh() ) // no shape
1524 SMESH_MesherHelper helper( *_father );
1525 helper.SetSubShape( shape );
1526 helper.SetElementsOnShape( true );
1527 ret = algo->Compute(*_father, &helper );
1531 ret = algo->Compute((*_father), shape);
1533 // algo can set _computeError of submesh
1534 _computeError = SMESH_ComputeError::Worst( _computeError, algo->GetComputeError() );
1536 catch ( ::SMESH_ComputeError& comperr ) {
1537 cout << " SMESH_ComputeError caught" << endl;
1538 if ( !_computeError ) _computeError = SMESH_ComputeError::New();
1539 *_computeError = comperr;
1541 catch ( std::bad_alloc& exc ) {
1542 MESSAGE("std::bad_alloc thrown inside algo->Compute()");
1543 if ( _computeError ) {
1544 _computeError->myName = COMPERR_MEMORY_PB;
1546 cleanSubMesh( this );
1549 catch ( Standard_OutOfMemory& exc ) {
1550 MESSAGE("Standard_OutOfMemory thrown inside algo->Compute()");
1551 if ( _computeError ) {
1552 _computeError->myName = COMPERR_MEMORY_PB;
1554 cleanSubMesh( this );
1555 throw std::bad_alloc();
1557 catch (Standard_Failure& ex) {
1558 if ( !_computeError ) _computeError = SMESH_ComputeError::New();
1559 _computeError->myName = COMPERR_OCC_EXCEPTION;
1560 _computeError->myComment += ex.DynamicType()->Name();
1561 if ( ex.GetMessageString() && strlen( ex.GetMessageString() )) {
1562 _computeError->myComment += ": ";
1563 _computeError->myComment += ex.GetMessageString();
1566 catch ( SALOME_Exception& S_ex ) {
1567 const int skipSalomeShift = 7; /* to skip "Salome " of
1568 "Salome Exception" prefix returned
1569 by SALOME_Exception::what() */
1570 if ( !_computeError ) _computeError = SMESH_ComputeError::New();
1571 _computeError->myName = COMPERR_SLM_EXCEPTION;
1572 _computeError->myComment = S_ex.what() + skipSalomeShift;
1574 catch ( std::exception& exc ) {
1575 if ( !_computeError ) _computeError = SMESH_ComputeError::New();
1576 _computeError->myName = COMPERR_STD_EXCEPTION;
1577 _computeError->myComment = exc.what();
1580 if ( _computeError )
1581 _computeError->myName = COMPERR_EXCEPTION;
1585 std::cout.rdbuf( coutBuffer ); // restore cout that could be redirected by algo
1587 // check if an error reported on any sub-shape
1588 bool isComputeErrorSet = !checkComputeError( algo, ret, shape );
1589 if ( isComputeErrorSet )
1591 // check if anything was built
1592 TopExp_Explorer subS(shape, _subShape.ShapeType());
1595 for (; ret && subS.More(); subS.Next())
1596 if ( !_father->GetSubMesh( subS.Current() )->IsMeshComputed() &&
1597 ( _subShape.ShapeType() != TopAbs_EDGE ||
1598 !algo->isDegenerated( TopoDS::Edge( subS.Current() ))))
1601 #ifdef PRINT_WHO_COMPUTE_WHAT
1602 for (subS.ReInit(); subS.More(); subS.Next())
1604 const std::list <const SMESHDS_Hypothesis *> & hyps =
1605 _algo->GetUsedHypothesis( *_father, _subShape );
1606 SMESH_Comment hypStr;
1607 if ( !hyps.empty() )
1609 hypStr << hyps.front()->GetName() << " ";
1610 ((SMESHDS_Hypothesis*)hyps.front())->SaveTo( hypStr.Stream() );
1613 cout << _algo->GetName()
1614 << " " << _father->GetSubMesh( subS.Current() )->GetId()
1615 << " " << hypStr << endl;
1618 // Set _computeError
1619 if ( !ret && !isComputeErrorSet )
1621 for ( subS.ReInit(); subS.More(); subS.Next() )
1623 SMESH_subMesh* sm = _father->GetSubMesh( subS.Current() );
1624 if ( !sm->IsMeshComputed() )
1626 if ( !sm->_computeError )
1627 sm->_computeError = SMESH_ComputeError::New();
1628 if ( sm->_computeError->IsOK() )
1629 sm->_computeError->myName = COMPERR_ALGO_FAILED;
1630 sm->_computeState = FAILED_TO_COMPUTE;
1631 sm->_computeError->myAlgo = algo;
1635 if ( ret && _computeError && _computeError->myName != COMPERR_WARNING )
1637 _computeError.reset();
1640 // transform errors into warnings if it is caused by mesh edition (imp 0023068)
1641 if (!ret && _father->GetIsModified() )
1643 for (subS.ReInit(); subS.More(); subS.Next())
1645 SMESH_subMesh* sm = _father->GetSubMesh( subS.Current() );
1646 if ( !sm->IsMeshComputed() && sm->_computeError )
1648 // check if there is a VERTEX w/o nodes
1649 // with READY_TO_COMPUTE state (after MergeNodes())
1650 SMESH_subMeshIteratorPtr smIt = sm->getDependsOnIterator(false,false);
1651 while ( smIt->more() )
1653 SMESH_subMesh * vertSM = smIt->next();
1654 if ( vertSM->_subShape.ShapeType() != TopAbs_VERTEX ) break;
1655 if ( vertSM->GetComputeState() == READY_TO_COMPUTE )
1657 SMESHDS_SubMesh * ds = vertSM->GetSubMeshDS();
1658 if ( !ds || ds->NbNodes() == 0 )
1660 sm->_computeState = READY_TO_COMPUTE;
1661 sm->_computeError->myName = COMPERR_WARNING;
1670 // send event SUBMESH_COMPUTED
1672 if ( !algo->NeedDiscreteBoundary() )
1673 // send SUBMESH_COMPUTED to dependants of all sub-meshes of shape
1674 for (subS.ReInit(); subS.More(); subS.Next())
1676 SMESH_subMesh* sm = _father->GetSubMesh( subS.Current() );
1677 SMESH_subMeshIteratorPtr smIt = sm->getDependsOnIterator(false,false);
1678 while ( smIt->more() ) {
1680 if ( sm->GetSubShape().ShapeType() == TopAbs_VERTEX )
1681 sm->updateDependantsState( SUBMESH_COMPUTED );
1687 updateDependantsState( SUBMESH_COMPUTED );
1689 // let algo clear its data gathered while algo->Compute()
1690 algo->CheckHypothesis((*_father), _subShape, hyp_status);
1693 case COMPUTE_CANCELED: // nothing to do
1697 removeSubMeshElementsAndNodes();
1698 _computeState = NOT_READY;
1702 ret = algo->CheckHypothesis((*_father), _subShape, hyp_status);
1704 _computeState = READY_TO_COMPUTE;
1706 setAlgoState(MISSING_HYP);
1709 case SUBMESH_COMPUTED: // nothing to do
1711 case SUBMESH_RESTORED:
1712 // check if a mesh is already computed that may
1713 // happen after retrieval from a file
1714 ComputeStateEngine( CHECK_COMPUTE_STATE );
1715 ComputeSubMeshStateEngine( SUBMESH_RESTORED );
1717 if (algo) algo->SubmeshRestored( this );
1719 case MESH_ENTITY_REMOVED:
1721 case SUBMESH_LOADED:
1722 loadDependentMeshes();
1723 ComputeSubMeshStateEngine( SUBMESH_LOADED );
1725 case CHECK_COMPUTE_STATE:
1726 if ( IsMeshComputed() )
1727 _computeState = COMPUTE_OK;
1728 else if ( _computeError && _computeError->IsKO() )
1729 _computeState = FAILED_TO_COMPUTE;
1737 // ----------------------------------------------------------------------
1742 case MODIF_ALGO_STATE:
1743 ComputeStateEngine( CLEAN );
1745 if (algo && !algo->NeedDiscreteBoundary())
1746 cleanDependsOn( algo ); // clean sub-meshes with event CLEAN
1748 case COMPUTE: // nothing to do
1750 case COMPUTE_CANCELED: // nothing to do
1753 cleanDependants(); // clean sub-meshes, dependent on this one, with event CLEAN
1754 removeSubMeshElementsAndNodes();
1755 _computeState = NOT_READY;
1756 if ( _algoState == HYP_OK )
1757 _computeState = READY_TO_COMPUTE;
1759 case SUBMESH_COMPUTED: // nothing to do
1761 case SUBMESH_RESTORED:
1762 ComputeStateEngine( CHECK_COMPUTE_STATE );
1763 ComputeSubMeshStateEngine( SUBMESH_RESTORED );
1765 if (algo) algo->SubmeshRestored( this );
1767 case MESH_ENTITY_REMOVED:
1768 updateDependantsState ( CHECK_COMPUTE_STATE );
1769 ComputeStateEngine ( CHECK_COMPUTE_STATE );
1770 ComputeSubMeshStateEngine( CHECK_COMPUTE_STATE );
1772 case CHECK_COMPUTE_STATE:
1773 if ( !IsMeshComputed() ) {
1774 if (_algoState == HYP_OK)
1775 _computeState = READY_TO_COMPUTE;
1777 _computeState = NOT_READY;
1780 case SUBMESH_LOADED:
1781 // already treated event, thanks to which _computeState == COMPUTE_OK
1789 // ----------------------------------------------------------------------
1791 case FAILED_TO_COMPUTE:
1794 case MODIF_ALGO_STATE:
1796 ComputeStateEngine( CLEAN );
1798 if (algo && !algo->NeedDiscreteBoundary())
1799 cleanDependsOn( algo ); // clean sub-meshes with event CLEAN
1800 if (_algoState == HYP_OK)
1801 _computeState = READY_TO_COMPUTE;
1803 _computeState = NOT_READY;
1805 case COMPUTE: // nothing to do
1806 case COMPUTE_SUBMESH:
1808 case COMPUTE_CANCELED:
1811 algo->CancelCompute();
1815 cleanDependants(); // submeshes dependent on me should be cleaned as well
1816 removeSubMeshElementsAndNodes();
1818 case SUBMESH_COMPUTED: // allow retry compute
1819 if ( IsEmpty() ) // 23061
1821 if (_algoState == HYP_OK)
1822 _computeState = READY_TO_COMPUTE;
1824 _computeState = NOT_READY;
1827 case SUBMESH_RESTORED:
1828 ComputeSubMeshStateEngine( SUBMESH_RESTORED );
1830 case MESH_ENTITY_REMOVED:
1832 case CHECK_COMPUTE_STATE:
1833 if ( IsMeshComputed() )
1834 _computeState = COMPUTE_OK;
1836 if (_algoState == HYP_OK)
1837 _computeState = READY_TO_COMPUTE;
1839 _computeState = NOT_READY;
1841 // case SUBMESH_LOADED:
1849 // ----------------------------------------------------------------------
1855 notifyListenersOnEvent( event, COMPUTE_EVENT );
1861 //=============================================================================
1865 //=============================================================================
1867 bool SMESH_subMesh::Evaluate(MapShapeNbElems& aResMap)
1869 _computeError.reset();
1873 if (_subShape.ShapeType() == TopAbs_VERTEX) {
1874 vector<int> aVec(SMDSEntity_Last,0);
1875 aVec[SMDSEntity_Node] = 1;
1876 aResMap.insert(make_pair(this,aVec));
1880 //SMESH_Gen *gen = _father->GetGen();
1881 SMESH_Algo *algo = 0;
1882 SMESH_Hypothesis::Hypothesis_Status hyp_status;
1885 if( algo && !aResMap.count( this ))
1887 ret = algo->CheckHypothesis((*_father), _subShape, hyp_status);
1888 if (!ret) return false;
1890 if (_father->HasShapeToMesh() && algo->NeedDiscreteBoundary() )
1892 // check submeshes needed
1893 bool subMeshEvaluated = true;
1894 int dimToCheck = SMESH_Gen::GetShapeDim( _subShape ) - 1;
1895 SMESH_subMeshIteratorPtr smIt = getDependsOnIterator(false,/*complexShapeFirst=*/true);
1896 while ( smIt->more() && subMeshEvaluated )
1898 SMESH_subMesh* sm = smIt->next();
1899 int dim = SMESH_Gen::GetShapeDim( sm->GetSubShape() );
1900 if (dim < dimToCheck) break; // the rest subMeshes are all of less dimension
1901 const vector<int> & nbs = aResMap[ sm ];
1902 subMeshEvaluated = (std::accumulate( nbs.begin(), nbs.end(), 0 ) > 0 );
1904 if ( !subMeshEvaluated )
1907 _computeError = SMESH_ComputeError::New(COMPERR_OK,"",algo);
1909 if ( IsMeshComputed() )
1911 vector<int> & nbEntities = aResMap[ this ];
1912 nbEntities.resize( SMDSEntity_Last, 0 );
1913 if ( SMESHDS_SubMesh* sm = GetSubMeshDS() )
1915 nbEntities[ SMDSEntity_Node ] = sm->NbNodes();
1916 SMDS_ElemIteratorPtr elemIt = sm->GetElements();
1917 while ( elemIt->more() )
1918 nbEntities[ elemIt->next()->GetEntityType() ]++;
1923 ret = algo->Evaluate((*_father), _subShape, aResMap);
1925 aResMap.insert( make_pair( this,vector<int>(0)));
1932 //=======================================================================
1934 * \brief Update compute_state by _computeError and send proper events to
1935 * dependent submeshes
1936 * \retval bool - true if _computeError is NOT set
1938 //=======================================================================
1940 bool SMESH_subMesh::checkComputeError(SMESH_Algo* theAlgo,
1941 const bool theComputeOK,
1942 const TopoDS_Shape& theShape)
1944 bool noErrors = true;
1946 if ( !theShape.IsNull() )
1948 // Check state of submeshes
1949 if ( !theAlgo->NeedDiscreteBoundary())
1951 SMESH_subMeshIteratorPtr smIt = getDependsOnIterator(false,false);
1952 while ( smIt->more() )
1953 if ( !smIt->next()->checkComputeError( theAlgo, theComputeOK ))
1957 // Check state of neighbours
1958 if ( !theAlgo->OnlyUnaryInput() &&
1959 theShape.ShapeType() == TopAbs_COMPOUND &&
1960 !theShape.IsSame( _subShape ))
1962 for (TopoDS_Iterator subIt( theShape ); subIt.More(); subIt.Next()) {
1963 SMESH_subMesh* sm = _father->GetSubMesh( subIt.Value() );
1965 if ( !sm->checkComputeError( theAlgo, theComputeOK, sm->GetSubShape() ))
1967 updateDependantsState( SUBMESH_COMPUTED ); // send event SUBMESH_COMPUTED
1974 // Set my _computeState
1976 if ( !_computeError || _computeError->IsOK() )
1978 // no error description is set to this sub-mesh, check if any mesh is computed
1979 _computeState = IsMeshComputed() ? COMPUTE_OK : FAILED_TO_COMPUTE;
1980 if ( _computeState != COMPUTE_OK )
1982 if ( _subShape.ShapeType() == TopAbs_EDGE &&
1983 SMESH_Algo::isDegenerated( TopoDS::Edge( _subShape )) )
1984 _computeState = COMPUTE_OK;
1985 else if ( theComputeOK )
1986 _computeError = SMESH_ComputeError::New(COMPERR_NO_MESH_ON_SHAPE,"",theAlgo);
1990 if ( _computeError && !_computeError->IsOK() )
1992 if ( !_computeError->myAlgo )
1993 _computeError->myAlgo = theAlgo;
1997 text << theAlgo->GetName() << " failed on sub-shape #" << _Id << " with error ";
1998 if (_computeError->IsCommon() )
1999 text << _computeError->CommonName();
2001 text << _computeError->myName;
2002 if ( _computeError->myComment.size() > 0 )
2003 text << " \"" << _computeError->myComment << "\"";
2007 _computeState = _computeError->IsKO() ? FAILED_TO_COMPUTE : COMPUTE_OK;
2015 //=======================================================================
2016 //function : updateSubMeshState
2018 //=======================================================================
2020 void SMESH_subMesh::updateSubMeshState(const compute_state theState)
2022 SMESH_subMeshIteratorPtr smIt = getDependsOnIterator(false,false);
2023 while ( smIt->more() )
2024 smIt->next()->_computeState = theState;
2027 //=======================================================================
2028 //function : ComputeSubMeshStateEngine
2030 //=======================================================================
2032 void SMESH_subMesh::ComputeSubMeshStateEngine(compute_event event, const bool includeSelf)
2034 SMESH_subMeshIteratorPtr smIt = getDependsOnIterator(includeSelf,false);
2035 while ( smIt->more() )
2036 smIt->next()->ComputeStateEngine(event);
2039 //=======================================================================
2040 //function : updateDependantsState
2042 //=======================================================================
2044 void SMESH_subMesh::updateDependantsState(const compute_event theEvent)
2046 const std::vector< SMESH_subMesh * > & ancestors = GetAncestors();
2047 for ( size_t iA = 0; iA < ancestors.size(); ++iA )
2049 ancestors[ iA ]->ComputeStateEngine( theEvent );
2053 //=======================================================================
2054 //function : cleanDependants
2056 //=======================================================================
2058 void SMESH_subMesh::cleanDependants()
2060 int dimToClean = SMESH_Gen::GetShapeDim( _subShape ) + 1;
2062 const std::vector< SMESH_subMesh * > & ancestors = GetAncestors();
2063 for ( size_t iA = 0; iA < ancestors.size(); ++iA )
2065 const TopoDS_Shape& ancestor = ancestors[ iA ]->GetSubShape();
2066 if ( SMESH_Gen::GetShapeDim( ancestor ) == dimToClean )
2068 // PAL8021. do not go upper than SOLID, else ComputeStateEngine(CLEAN)
2069 // will erase mesh on other shapes in a compound
2070 if ( ancestor.ShapeType() >= TopAbs_SOLID &&
2071 !ancestors[ iA ]->IsEmpty() ) // prevent infinite CLEAN via event lesteners
2072 ancestors[ iA ]->ComputeStateEngine(CLEAN);
2077 //=======================================================================
2078 //function : removeSubMeshElementsAndNodes
2080 //=======================================================================
2082 void SMESH_subMesh::removeSubMeshElementsAndNodes()
2084 cleanSubMesh( this );
2086 // algo may bind a submesh not to _subShape, eg 3D algo
2087 // sets nodes on SHELL while _subShape may be SOLID
2089 int dim = SMESH_Gen::GetShapeDim( _subShape );
2090 int type = _subShape.ShapeType() + 1;
2091 for ( ; type <= TopAbs_EDGE; type++) {
2092 if ( dim == SMESH_Gen::GetShapeDim( (TopAbs_ShapeEnum) type ))
2094 TopExp_Explorer exp( _subShape, (TopAbs_ShapeEnum) type );
2095 for ( ; exp.More(); exp.Next() )
2096 cleanSubMesh( _father->GetSubMeshContaining( exp.Current() ));
2103 //=======================================================================
2104 //function : getCollection
2105 //purpose : return a shape containing all sub-shapes of the MainShape that can be
2106 // meshed at once along with _subShape
2107 //=======================================================================
2109 TopoDS_Shape SMESH_subMesh::getCollection(SMESH_Gen * /*theGen*/,
2110 SMESH_Algo* theAlgo,
2111 bool & theSubComputed,
2112 bool & theSubFailed,
2113 std::vector<SMESH_subMesh*>& theSubs)
2115 theSubComputed = SubMeshesComputed( & theSubFailed );
2117 TopoDS_Shape mainShape = _father->GetMeshDS()->ShapeToMesh();
2119 if ( mainShape.IsSame( _subShape ))
2122 const bool skipAuxHyps = false;
2123 list<const SMESHDS_Hypothesis*> usedHyps =
2124 theAlgo->GetUsedHypothesis( *_father, _subShape, skipAuxHyps ); // copy
2125 std::list < TopoDS_Shape > assiShapes = theAlgo->GetAssignedShapes();
2127 // put in a compound all shapes with the same hypothesis assigned
2128 // and a good ComputeState
2130 TopoDS_Compound aCompound;
2131 BRep_Builder aBuilder;
2132 aBuilder.MakeCompound( aCompound );
2136 SMESH_subMeshIteratorPtr smIt = _father->GetSubMesh( mainShape )->getDependsOnIterator(false);
2137 while ( smIt->more() )
2139 SMESH_subMesh* subMesh = smIt->next();
2140 const TopoDS_Shape& S = subMesh->_subShape;
2141 if ( S.ShapeType() != this->_subShape.ShapeType() )
2143 if ( subMesh == this )
2145 aBuilder.Add( aCompound, S );
2146 theSubs.push_back( subMesh );
2148 else if ( subMesh->GetComputeState() == READY_TO_COMPUTE )
2150 SMESH_Algo* anAlgo = subMesh->GetAlgo();
2151 if (( anAlgo->IsSameName( *theAlgo )) && // same algo
2152 ( anAlgo->GetUsedHypothesis( *_father, S, skipAuxHyps ) == usedHyps ) && // same hyps
2153 ( anAlgo->GetAssignedShapes() == assiShapes ) && // on same sub-shapes
2154 ( _algoShape == subMesh->_algoShape ))
2156 aBuilder.Add( aCompound, S );
2157 if ( !subMesh->SubMeshesComputed() )
2158 theSubComputed = false;
2159 theSubs.push_back( subMesh );
2167 //=======================================================================
2168 //function : getSimilarAttached
2169 //purpose : return a hypothesis attached to theShape.
2170 // If theHyp is provided, similar but not same hypotheses
2171 // is returned; else only applicable ones having theHypType
2173 //=======================================================================
2175 const SMESH_Hypothesis* SMESH_subMesh::getSimilarAttached(const TopoDS_Shape& theShape,
2176 const SMESH_Hypothesis * theHyp,
2177 const int theHypType)
2179 SMESH_HypoFilter hypoKind;
2180 hypoKind.Init( hypoKind.HasType( theHyp ? theHyp->GetType() : theHypType ));
2182 hypoKind.And ( hypoKind.HasDim( theHyp->GetDim() ));
2183 hypoKind.AndNot( hypoKind.Is( theHyp ));
2184 if ( theHyp->IsAuxiliary() )
2185 hypoKind.And( hypoKind.HasName( theHyp->GetName() ));
2187 hypoKind.AndNot( hypoKind.IsAuxiliary());
2190 hypoKind.And( hypoKind.IsApplicableTo( theShape ));
2193 return _father->GetHypothesis( theShape, hypoKind, false );
2196 //=======================================================================
2197 //function : CheckConcurrentHypothesis
2198 //purpose : check if there are several applicable hypothesis attached to
2200 //=======================================================================
2202 SMESH_Hypothesis::Hypothesis_Status
2203 SMESH_subMesh::CheckConcurrentHypothesis (const int theHypType)
2205 // is there local hypothesis on me?
2206 if ( getSimilarAttached( _subShape, 0, theHypType ) )
2207 return SMESH_Hypothesis::HYP_OK;
2210 TopoDS_Shape aPrevWithHyp;
2211 const SMESH_Hypothesis* aPrevHyp = 0;
2212 TopTools_ListIteratorOfListOfShape it( _father->GetAncestors( _subShape ));
2213 for (; it.More(); it.Next())
2215 const TopoDS_Shape& ancestor = it.Value();
2216 const SMESH_Hypothesis* hyp = getSimilarAttached( ancestor, 0, theHypType );
2219 if ( aPrevWithHyp.IsNull() || aPrevWithHyp.IsSame( ancestor ))
2221 aPrevWithHyp = ancestor;
2224 else if ( aPrevWithHyp.ShapeType() == ancestor.ShapeType() && aPrevHyp != hyp )
2225 return SMESH_Hypothesis::HYP_CONCURRENT;
2227 return SMESH_Hypothesis::HYP_OK;
2230 return SMESH_Hypothesis::HYP_OK;
2233 //================================================================================
2235 * \brief Constructor of OwnListenerData
2237 //================================================================================
2239 SMESH_subMesh::OwnListenerData::OwnListenerData( SMESH_subMesh* sm, EventListener* el):
2241 myMeshID( sm ? sm->GetFather()->GetId() : -1 ),
2242 mySubMeshID( sm ? sm->GetId() : -1 ),
2247 //================================================================================
2249 * \brief Sets an event listener and its data to a submesh
2250 * \param listener - the listener to store
2251 * \param data - the listener data to store
2252 * \param where - the submesh to store the listener and it's data
2254 * It remembers the submesh where it puts the listener in order to delete
2255 * them when HYP_OK algo_state is lost
2256 * After being set, event listener is notified on each event of where submesh.
2258 //================================================================================
2260 void SMESH_subMesh::SetEventListener(EventListener* listener,
2261 EventListenerData* data,
2262 SMESH_subMesh* where)
2264 if ( listener && where ) {
2265 where->setEventListener( listener, data );
2266 _ownListeners.push_back( OwnListenerData( where, listener ));
2270 //================================================================================
2272 * \brief Sets an event listener and its data to a submesh
2273 * \param listener - the listener to store
2274 * \param data - the listener data to store
2276 * After being set, event listener is notified on each event of a submesh.
2278 //================================================================================
2280 void SMESH_subMesh::setEventListener(EventListener* listener,
2281 EventListenerData* data)
2283 map< EventListener*, EventListenerData* >::iterator l_d =
2284 _eventListeners.find( listener );
2285 if ( l_d != _eventListeners.end() ) {
2286 EventListenerData* curData = l_d->second;
2288 if ( curData && curData != data && curData->IsDeletable() )
2293 for ( l_d = _eventListeners.begin(); l_d != _eventListeners.end(); ++l_d )
2294 if ( listener->GetName() == l_d->first->GetName() )
2296 EventListenerData* curData = l_d->second;
2298 if ( curData && curData != data && curData->IsDeletable() )
2300 if ( l_d->first != listener && l_d->first->IsDeletable() )
2302 _eventListeners.erase( l_d );
2305 _eventListeners.insert( make_pair( listener, data ));
2309 //================================================================================
2311 * \brief Return an event listener data
2312 * \param listener - the listener whose data is
2313 * \param myOwn - if \c true, returns a listener set by this sub-mesh,
2314 * else returns a listener listening to events of this sub-mesh
2315 * \retval EventListenerData* - found data, maybe NULL
2317 //================================================================================
2319 EventListenerData* SMESH_subMesh::GetEventListenerData(EventListener* listener,
2320 const bool myOwn) const
2324 list< OwnListenerData >::const_iterator d;
2325 for ( d = _ownListeners.begin(); d != _ownListeners.end(); ++d )
2327 if ( d->myListener == listener && _father->MeshExists( d->myMeshID ))
2328 return d->mySubMesh->GetEventListenerData( listener, !myOwn );
2333 map< EventListener*, EventListenerData* >::const_iterator l_d =
2334 _eventListeners.find( listener );
2335 if ( l_d != _eventListeners.end() )
2341 //================================================================================
2343 * \brief Return an event listener data
2344 * \param listenerName - the listener name
2345 * \param myOwn - if \c true, returns a listener set by this sub-mesh,
2346 * else returns a listener listening to events of this sub-mesh
2347 * \retval EventListenerData* - found data, maybe NULL
2349 //================================================================================
2351 EventListenerData* SMESH_subMesh::GetEventListenerData(const string& listenerName,
2352 const bool myOwn) const
2356 list< OwnListenerData >::const_iterator d;
2357 for ( d = _ownListeners.begin(); d != _ownListeners.end(); ++d )
2359 if ( _father->MeshExists( d->myMeshID ) && listenerName == d->myListener->GetName())
2360 return d->mySubMesh->GetEventListenerData( listenerName, !myOwn );
2365 map< EventListener*, EventListenerData* >::const_iterator l_d = _eventListeners.begin();
2366 for ( ; l_d != _eventListeners.end(); ++l_d )
2367 if ( listenerName == l_d->first->GetName() )
2373 //================================================================================
2375 * \brief Notify stored event listeners on the occurred event
2376 * \param event - algo_event or compute_event itself
2377 * \param eventType - algo_event or compute_event
2378 * \param hyp - hypothesis, if eventType is algo_event
2380 //================================================================================
2382 void SMESH_subMesh::notifyListenersOnEvent( const int event,
2383 const event_type eventType,
2384 SMESH_Hypothesis* hyp)
2386 list< pair< EventListener*, EventListenerData* > > eventListeners( _eventListeners.begin(),
2387 _eventListeners.end());
2388 list< pair< EventListener*, EventListenerData* > >::iterator l_d = eventListeners.begin();
2389 for ( ; l_d != eventListeners.end(); ++l_d )
2391 std::pair< EventListener*, EventListenerData* > li_da = *l_d;
2392 if ( !_eventListeners.count( li_da.first )) continue;
2394 if ( li_da.first->myBusySM.insert( this ).second )
2396 const bool isDeletable = li_da.first->IsDeletable();
2398 li_da.first->ProcessEvent( event, eventType, this, li_da.second, hyp );
2400 if ( !isDeletable || _eventListeners.count( li_da.first ))
2401 li_da.first->myBusySM.erase( this ); // a listener is hopefully not dead
2406 //================================================================================
2408 * \brief Unregister the listener and delete listener's data
2409 * \param listener - the event listener
2411 //================================================================================
2413 void SMESH_subMesh::DeleteEventListener(EventListener* listener)
2415 map< EventListener*, EventListenerData* >::iterator l_d =
2416 _eventListeners.find( listener );
2417 if ( l_d != _eventListeners.end() && l_d->first )
2419 if ( l_d->second && l_d->second->IsDeletable() )
2423 l_d->first->myBusySM.erase( this );
2424 if ( l_d->first->IsDeletable() )
2426 l_d->first->BeforeDelete( this, l_d->second );
2429 _eventListeners.erase( l_d );
2433 //================================================================================
2435 * \brief Delete event listeners depending on algo of this submesh
2437 //================================================================================
2439 void SMESH_subMesh::deleteOwnListeners()
2441 list< OwnListenerData >::iterator d;
2442 for ( d = _ownListeners.begin(); d != _ownListeners.end(); ++d )
2444 SMESH_Mesh* mesh = _father->FindMesh( d->myMeshID );
2445 if ( !mesh || !mesh->GetSubMeshContaining( d->mySubMeshID ))
2447 d->mySubMesh->DeleteEventListener( d->myListener );
2449 _ownListeners.clear();
2452 //=======================================================================
2453 //function : loadDependentMeshes
2454 //purpose : loads dependent meshes on SUBMESH_LOADED event
2455 //=======================================================================
2457 void SMESH_subMesh::loadDependentMeshes()
2459 list< OwnListenerData >::iterator d;
2460 for ( d = _ownListeners.begin(); d != _ownListeners.end(); ++d )
2461 if ( _father != d->mySubMesh->_father &&
2462 _father->FindMesh( d->myMeshID ))
2463 d->mySubMesh->_father->Load();
2465 // map< EventListener*, EventListenerData* >::iterator l_d = _eventListeners.begin();
2466 // for ( ; l_d != _eventListeners.end(); ++l_d )
2467 // if ( l_d->second )
2469 // const list<SMESH_subMesh*>& smList = l_d->second->mySubMeshes;
2470 // list<SMESH_subMesh*>::const_iterator sm = smList.begin();
2471 // for ( ; sm != smList.end(); ++sm )
2472 // if ( _father != (*sm)->_father )
2473 // (*sm)->_father->Load();
2477 //================================================================================
2479 * \brief Do something on a certain event
2480 * \param event - algo_event or compute_event itself
2481 * \param eventType - algo_event or compute_event
2482 * \param subMesh - the submesh where the event occurs
2483 * \param data - listener data stored in the subMesh
2484 * \param hyp - hypothesis, if eventType is algo_event
2486 * The base implementation translates CLEAN event to the subMesh
2487 * stored in listener data. Also it sends SUBMESH_COMPUTED event in case of
2488 * successful COMPUTE event.
2490 //================================================================================
2492 void SMESH_subMeshEventListener::ProcessEvent(const int event,
2493 const int eventType,
2494 SMESH_subMesh* subMesh,
2495 EventListenerData* data,
2496 const SMESH_Hypothesis* /*hyp*/)
2498 if ( data && !data->mySubMeshes.empty() &&
2499 eventType == SMESH_subMesh::COMPUTE_EVENT)
2501 ASSERT( data->mySubMeshes.front() != subMesh );
2502 list<SMESH_subMesh*>::iterator smIt = data->mySubMeshes.begin();
2503 list<SMESH_subMesh*>::iterator smEnd = data->mySubMeshes.end();
2505 case SMESH_subMesh::CLEAN:
2506 for ( ; smIt != smEnd; ++ smIt)
2507 (*smIt)->ComputeStateEngine( SMESH_subMesh::compute_event( event ));
2509 case SMESH_subMesh::COMPUTE:
2510 case SMESH_subMesh::COMPUTE_SUBMESH:
2511 if ( subMesh->GetComputeState() == SMESH_subMesh::COMPUTE_OK )
2512 for ( ; smIt != smEnd; ++ smIt)
2513 (*smIt)->ComputeStateEngine( SMESH_subMesh::SUBMESH_COMPUTED );
2522 //================================================================================
2524 * \brief Iterator over submeshes and optionally prepended or appended one
2526 //================================================================================
2528 struct _Iterator : public SMDS_Iterator<SMESH_subMesh*>
2530 _Iterator(SMDS_Iterator<SMESH_subMesh*>* subIt,
2531 SMESH_subMesh* prepend,
2532 SMESH_subMesh* append): myAppend(append), myIt(subIt)
2534 myCur = prepend ? prepend : myIt->more() ? myIt->next() : append;
2535 if ( myCur == append ) append = 0;
2537 /// Return true if and only if there are other object in this iterator
2542 /// Return the current object and step to the next one
2543 virtual SMESH_subMesh* next()
2545 SMESH_subMesh* res = myCur;
2546 if ( myIt->more() ) { myCur = myIt->next(); }
2547 else { myCur = myAppend; myAppend = 0; }
2554 SMESH_subMesh *myAppend, *myCur;
2555 SMDS_Iterator<SMESH_subMesh*> *myIt;
2559 //================================================================================
2561 * \brief Return iterator on the submeshes this one depends on
2562 * \param includeSelf - this submesh to be returned also
2563 * \param reverse - if true, complex shape submeshes go first
2565 //================================================================================
2567 SMESH_subMeshIteratorPtr SMESH_subMesh::getDependsOnIterator(const bool includeSelf,
2568 const bool reverse) const
2570 SMESH_subMesh *me = (SMESH_subMesh*) this;
2571 SMESH_subMesh *prepend=0, *append=0;
2572 if ( includeSelf ) {
2573 if ( reverse ) prepend = me;
2576 typedef map < int, SMESH_subMesh * > TMap;
2579 return SMESH_subMeshIteratorPtr
2580 ( new _Iterator( new SMDS_mapReverseIterator<TMap>( me->DependsOn() ), prepend, append ));
2583 return SMESH_subMeshIteratorPtr
2584 ( new _Iterator( new SMDS_mapIterator<TMap>( me->DependsOn() ), prepend, append ));
2588 //================================================================================
2590 * \brief Returns ancestor sub-meshes. Finds them if not yet found.
2592 //================================================================================
2594 const std::vector< SMESH_subMesh * > & SMESH_subMesh::GetAncestors() const
2596 if ( _ancestors.empty() &&
2597 !_subShape.IsSame( _father->GetShapeToMesh() ))
2599 const TopTools_ListOfShape& ancShapes = _father->GetAncestors( _subShape );
2601 SMESH_subMesh* me = const_cast< SMESH_subMesh* >( this );
2602 me->_ancestors.reserve( ancShapes.Extent() );
2604 // assure that all sub-meshes exist
2605 TopoDS_Shape mainShape = _father->GetShapeToMesh();
2606 if ( !mainShape.IsNull() )
2607 _father->GetSubMesh( mainShape )->DependsOn();
2609 TopTools_MapOfShape map;
2611 for ( TopTools_ListIteratorOfListOfShape it( ancShapes ); it.More(); it.Next() )
2612 if ( SMESH_subMesh* sm = _father->GetSubMeshContaining( it.Value() ))
2613 if ( map.Add( it.Value() ))
2614 me->_ancestors.push_back( sm );
2620 //================================================================================
2622 * \brief Clears the vector of ancestor sub-meshes
2624 //================================================================================
2626 void SMESH_subMesh::ClearAncestors()
2631 //================================================================================
2633 * \brief Find common submeshes (based on shared sub-shapes with other
2634 * \param theOther submesh to check
2635 * \param theSetOfCommon set of common submesh
2637 //================================================================================
2639 bool SMESH_subMesh::FindIntersection(const SMESH_subMesh* theOther,
2640 std::set<const SMESH_subMesh*>& theSetOfCommon ) const
2642 size_t oldNb = theSetOfCommon.size();
2644 // check main submeshes
2645 const map <int, SMESH_subMesh*>::const_iterator otherEnd = theOther->_mapDepend.end();
2646 if ( theOther->_mapDepend.find(this->GetId()) != otherEnd )
2647 theSetOfCommon.insert( this );
2648 if ( _mapDepend.find(theOther->GetId()) != _mapDepend.end() )
2649 theSetOfCommon.insert( theOther );
2651 // check common submeshes
2652 map <int, SMESH_subMesh*>::const_iterator mapIt = _mapDepend.begin();
2653 for( ; mapIt != _mapDepend.end(); mapIt++ )
2654 if ( theOther->_mapDepend.find((*mapIt).first) != otherEnd )
2655 theSetOfCommon.insert( (*mapIt).second );
2656 return oldNb < theSetOfCommon.size();