2003-07-10 10:13:42 +00:00
|
|
|
// SMESH SMESH : implementaion of SMESH idl descriptions
|
|
|
|
//
|
|
|
|
// Copyright (C) 2003 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
|
2004-12-01 10:48:31 +00:00
|
|
|
// 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
|
|
|
|
//
|
2006-09-04 11:39:20 +00:00
|
|
|
// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
|
2003-07-10 10:13:42 +00:00
|
|
|
//
|
|
|
|
//
|
|
|
|
//
|
|
|
|
// File : SMESH_subMesh.cxx
|
|
|
|
// Author : Paul RASCLE, EDF
|
|
|
|
// Module : SMESH
|
|
|
|
// $Header$
|
2003-05-19 13:18:36 +00:00
|
|
|
|
|
|
|
using namespace std;
|
|
|
|
#include "SMESH_subMesh.hxx"
|
2006-12-06 15:53:25 +00:00
|
|
|
|
|
|
|
#include "SMESH_subMeshEventListener.hxx"
|
2003-05-19 13:18:36 +00:00
|
|
|
#include "SMESH_Gen.hxx"
|
|
|
|
#include "SMESH_Mesh.hxx"
|
|
|
|
#include "SMESH_Hypothesis.hxx"
|
|
|
|
#include "SMESH_Algo.hxx"
|
2005-02-04 10:39:49 +00:00
|
|
|
#include "SMESH_HypoFilter.hxx"
|
2004-12-17 11:07:35 +00:00
|
|
|
|
2003-05-19 13:18:36 +00:00
|
|
|
#include "utilities.h"
|
|
|
|
#include "OpUtil.hxx"
|
|
|
|
|
2004-12-17 11:07:35 +00:00
|
|
|
#include <BRep_Builder.hxx>
|
|
|
|
|
2003-05-19 13:18:36 +00:00
|
|
|
#include <TopExp.hxx>
|
2004-12-17 11:07:35 +00:00
|
|
|
#include <TopoDS_Compound.hxx>
|
|
|
|
#include <TopTools_MapOfShape.hxx>
|
2003-05-19 13:18:36 +00:00
|
|
|
#include <TopTools_ListOfShape.hxx>
|
|
|
|
#include <TopTools_ListIteratorOfListOfShape.hxx>
|
2004-12-17 11:07:35 +00:00
|
|
|
#include <TopTools_IndexedDataMapOfShapeListOfShape.hxx>
|
|
|
|
|
2004-12-01 10:48:31 +00:00
|
|
|
#ifdef _DEBUG_
|
|
|
|
#include <gp_Pnt.hxx>
|
|
|
|
#include <BRep_Tool.hxx>
|
|
|
|
#include <TopoDS.hxx>
|
2005-12-20 11:10:13 +00:00
|
|
|
#include <TopTools_IndexedMapOfShape.hxx>
|
2004-12-01 10:48:31 +00:00
|
|
|
#endif
|
|
|
|
|
2006-03-13 15:29:49 +00:00
|
|
|
#include <Standard_Failure.hxx>
|
|
|
|
#include <Standard_ErrorHandler.hxx>
|
|
|
|
|
2003-05-19 13:18:36 +00:00
|
|
|
//=============================================================================
|
|
|
|
/*!
|
|
|
|
* default constructor:
|
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
2003-09-04 09:21:41 +00:00
|
|
|
SMESH_subMesh::SMESH_subMesh(int Id, SMESH_Mesh * father, SMESHDS_Mesh * meshDS,
|
|
|
|
const TopoDS_Shape & aSubShape)
|
2003-05-19 13:18:36 +00:00
|
|
|
{
|
2003-09-04 09:21:41 +00:00
|
|
|
_subShape = aSubShape;
|
|
|
|
_meshDS = meshDS;
|
|
|
|
_subMeshDS = meshDS->MeshElements(_subShape); // may be null ...
|
|
|
|
_father = father;
|
|
|
|
_Id = Id;
|
|
|
|
_dependenceAnalysed = false;
|
|
|
|
|
|
|
|
if (_subShape.ShapeType() == TopAbs_VERTEX)
|
|
|
|
{
|
|
|
|
_algoState = HYP_OK;
|
|
|
|
_computeState = READY_TO_COMPUTE;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2006-03-13 15:29:49 +00:00
|
|
|
_algoState = NO_ALGO;
|
|
|
|
_computeState = NOT_READY;
|
2003-09-04 09:21:41 +00:00
|
|
|
}
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
/*!
|
2004-12-01 10:48:31 +00:00
|
|
|
*
|
2003-05-19 13:18:36 +00:00
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
|
|
|
SMESH_subMesh::~SMESH_subMesh()
|
|
|
|
{
|
2006-03-13 15:29:49 +00:00
|
|
|
MESSAGE("SMESH_subMesh::~SMESH_subMesh");
|
|
|
|
// ****
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
/*!
|
2004-12-01 10:48:31 +00:00
|
|
|
*
|
2003-05-19 13:18:36 +00:00
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
int SMESH_subMesh::GetId() const
|
2003-05-19 13:18:36 +00:00
|
|
|
{
|
2006-03-13 15:29:49 +00:00
|
|
|
//MESSAGE("SMESH_subMesh::GetId");
|
|
|
|
return _Id;
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
/*!
|
2004-12-01 10:48:31 +00:00
|
|
|
*
|
2003-05-19 13:18:36 +00:00
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
SMESHDS_SubMesh * SMESH_subMesh::GetSubMeshDS()
|
2003-05-19 13:18:36 +00:00
|
|
|
{
|
2006-03-13 15:29:49 +00:00
|
|
|
// submesh appears in DS only when a mesher set nodes and elements on it
|
|
|
|
if (_subMeshDS==NULL)
|
|
|
|
{
|
|
|
|
_subMeshDS = _meshDS->MeshElements(_subShape); // may be null ...
|
|
|
|
// if (_subMeshDS==NULL)
|
|
|
|
// {
|
|
|
|
// MESSAGE("problem... subMesh still empty");
|
|
|
|
// }
|
|
|
|
}
|
|
|
|
return _subMeshDS;
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
/*!
|
2004-12-01 10:48:31 +00:00
|
|
|
*
|
2003-05-19 13:18:36 +00:00
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
SMESHDS_SubMesh* SMESH_subMesh::CreateSubMeshDS()
|
|
|
|
{
|
|
|
|
if ( !GetSubMeshDS() )
|
|
|
|
_meshDS->NewSubMesh( _meshDS->ShapeToIndex( _subShape ) );
|
|
|
|
|
|
|
|
return GetSubMeshDS();
|
|
|
|
}
|
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
/*!
|
2004-12-01 10:48:31 +00:00
|
|
|
*
|
2004-06-18 08:55:35 +00:00
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
|
|
|
SMESH_subMesh *SMESH_subMesh::GetFirstToCompute()
|
2003-05-19 13:18:36 +00:00
|
|
|
{
|
2004-12-01 10:48:31 +00:00
|
|
|
const map < int, SMESH_subMesh * >&subMeshes = DependsOn();
|
|
|
|
SMESH_subMesh *firstToCompute = 0;
|
2003-09-04 09:21:41 +00:00
|
|
|
|
2004-12-01 10:48:31 +00:00
|
|
|
map < int, SMESH_subMesh * >::const_iterator itsub;
|
|
|
|
for (itsub = subMeshes.begin(); itsub != subMeshes.end(); itsub++)
|
|
|
|
{
|
|
|
|
SMESH_subMesh *sm = (*itsub).second;
|
|
|
|
bool readyToCompute = (sm->GetComputeState() == READY_TO_COMPUTE);
|
|
|
|
if (readyToCompute)
|
|
|
|
{
|
|
|
|
firstToCompute = sm;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (firstToCompute)
|
|
|
|
{
|
|
|
|
return firstToCompute; // a subMesh of this
|
|
|
|
}
|
|
|
|
if (_computeState == READY_TO_COMPUTE)
|
|
|
|
{
|
|
|
|
return this; // this
|
|
|
|
}
|
|
|
|
return 0; // nothing to compute
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
/*!
|
2004-12-01 10:48:31 +00:00
|
|
|
*
|
2003-05-19 13:18:36 +00:00
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
bool SMESH_subMesh::SubMeshesComputed()
|
2003-05-19 13:18:36 +00:00
|
|
|
{
|
2004-12-01 10:48:31 +00:00
|
|
|
//MESSAGE("SMESH_subMesh::SubMeshesComputed");
|
|
|
|
const map < int, SMESH_subMesh * >&subMeshes = DependsOn();
|
2003-09-04 09:21:41 +00:00
|
|
|
|
2006-05-06 08:51:48 +00:00
|
|
|
int myDim = SMESH_Gen::GetShapeDim( _subShape );
|
|
|
|
int dimToCheck = myDim - 1;
|
2004-12-01 10:48:31 +00:00
|
|
|
bool subMeshesComputed = true;
|
|
|
|
map < int, SMESH_subMesh * >::const_iterator itsub;
|
|
|
|
for (itsub = subMeshes.begin(); itsub != subMeshes.end(); itsub++)
|
|
|
|
{
|
|
|
|
SMESH_subMesh *sm = (*itsub).second;
|
2006-05-06 08:51:48 +00:00
|
|
|
const TopoDS_Shape & ss = sm->GetSubShape();
|
|
|
|
// MSV 07.04.2006: restrict checking to myDim-1 only. Ex., there is no sense
|
|
|
|
// in checking of existence of edges if the algo needs only faces. Moreover,
|
|
|
|
// degenerated edges may have no submesh, as after computing NETGEN_2D.
|
|
|
|
int dim = SMESH_Gen::GetShapeDim( ss );
|
|
|
|
if (dim < dimToCheck)
|
|
|
|
continue;
|
2005-12-20 11:10:13 +00:00
|
|
|
SMESHDS_SubMesh * ds = sm->GetSubMeshDS();
|
|
|
|
// PAL10974.
|
|
|
|
// There are some tricks with compute states, e.g. Penta_3D leaves
|
|
|
|
// one face with READY_TO_COMPUTE state in order to be able to
|
|
|
|
// recompute 3D when a locale triangle hypo changes (see PAL7428).
|
|
|
|
// So we check if mesh is really present
|
2006-05-06 08:51:48 +00:00
|
|
|
bool computeOk = (sm->GetComputeState() == COMPUTE_OK ||
|
|
|
|
(ds && ( ds->GetNodes()->more() || ds->GetElements()->more() )));
|
2004-12-01 10:48:31 +00:00
|
|
|
if (!computeOk)
|
|
|
|
{
|
2005-12-20 11:10:13 +00:00
|
|
|
int type = ss.ShapeType();
|
|
|
|
|
2004-12-01 10:48:31 +00:00
|
|
|
subMeshesComputed = false;
|
|
|
|
|
|
|
|
switch (type)
|
|
|
|
{
|
|
|
|
case TopAbs_COMPOUND:
|
|
|
|
{
|
|
|
|
MESSAGE("The not computed sub mesh is a COMPOUND");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case TopAbs_COMPSOLID:
|
|
|
|
{
|
|
|
|
MESSAGE("The not computed sub mesh is a COMPSOLID");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case TopAbs_SHELL:
|
|
|
|
{
|
|
|
|
MESSAGE("The not computed sub mesh is a SHEL");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case TopAbs_WIRE:
|
|
|
|
{
|
|
|
|
MESSAGE("The not computed sub mesh is a WIRE");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case TopAbs_SOLID:
|
|
|
|
{
|
|
|
|
MESSAGE("The not computed sub mesh is a SOLID");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case TopAbs_FACE:
|
|
|
|
{
|
|
|
|
MESSAGE("The not computed sub mesh is a FACE");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case TopAbs_EDGE:
|
|
|
|
{
|
|
|
|
MESSAGE("The not computed sub mesh is a EDGE");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
{
|
|
|
|
MESSAGE("The not computed sub mesh is of unknown type");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return subMeshesComputed;
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
/*!
|
2004-12-01 10:48:31 +00:00
|
|
|
*
|
2003-05-19 13:18:36 +00:00
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
|
|
|
bool SMESH_subMesh::SubMeshesReady()
|
|
|
|
{
|
2004-12-01 10:48:31 +00:00
|
|
|
MESSAGE("SMESH_subMesh::SubMeshesReady");
|
|
|
|
const map < int, SMESH_subMesh * >&subMeshes = DependsOn();
|
2003-09-04 09:21:41 +00:00
|
|
|
|
2004-12-01 10:48:31 +00:00
|
|
|
bool subMeshesReady = true;
|
|
|
|
map < int, SMESH_subMesh * >::const_iterator itsub;
|
|
|
|
for (itsub = subMeshes.begin(); itsub != subMeshes.end(); itsub++)
|
|
|
|
{
|
|
|
|
SMESH_subMesh *sm = (*itsub).second;
|
|
|
|
bool computeOk = ((sm->GetComputeState() == COMPUTE_OK)
|
|
|
|
|| (sm->GetComputeState() == READY_TO_COMPUTE));
|
|
|
|
if (!computeOk)
|
|
|
|
{
|
|
|
|
subMeshesReady = false;
|
|
|
|
SCRUTE(sm->GetId());
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return subMeshesReady;
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
/*!
|
2004-12-01 10:48:31 +00:00
|
|
|
* Construct dependence on first level subMeshes. complex shapes (compsolid,
|
2003-05-19 13:18:36 +00:00
|
|
|
* shell, wire) are not analysed the same way as simple shapes (solid, face,
|
2004-12-01 10:48:31 +00:00
|
|
|
* edge).
|
2003-05-19 13:18:36 +00:00
|
|
|
* For collection shapes (compsolid, shell, wire) prepare a list of submeshes
|
|
|
|
* with possible multiples occurences. Multiples occurences corresponds to
|
|
|
|
* internal frontiers within shapes of the collection and must not be keeped.
|
|
|
|
* See FinalizeDependence.
|
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
2003-09-04 09:21:41 +00:00
|
|
|
const map < int, SMESH_subMesh * >&SMESH_subMesh::DependsOn()
|
2003-05-19 13:18:36 +00:00
|
|
|
{
|
2004-12-01 10:48:31 +00:00
|
|
|
if (_dependenceAnalysed)
|
|
|
|
return _mapDepend;
|
2003-09-04 09:21:41 +00:00
|
|
|
|
2004-12-01 10:48:31 +00:00
|
|
|
//MESSAGE("SMESH_subMesh::DependsOn");
|
2003-09-04 09:21:41 +00:00
|
|
|
|
2004-12-01 10:48:31 +00:00
|
|
|
int type = _subShape.ShapeType();
|
|
|
|
//SCRUTE(type);
|
|
|
|
switch (type)
|
|
|
|
{
|
|
|
|
case TopAbs_COMPOUND:
|
|
|
|
{
|
|
|
|
//MESSAGE("compound");
|
|
|
|
for (TopExp_Explorer exp(_subShape, TopAbs_SOLID); exp.More();
|
|
|
|
exp.Next())
|
|
|
|
{
|
|
|
|
InsertDependence(exp.Current());
|
|
|
|
}
|
|
|
|
for (TopExp_Explorer exp(_subShape, TopAbs_SHELL, TopAbs_SOLID); exp.More();
|
|
|
|
exp.Next())
|
|
|
|
{
|
|
|
|
InsertDependence(exp.Current()); //only shell not in solid
|
|
|
|
}
|
|
|
|
for (TopExp_Explorer exp(_subShape, TopAbs_FACE, TopAbs_SHELL); exp.More();
|
|
|
|
exp.Next())
|
|
|
|
{
|
|
|
|
InsertDependence(exp.Current());
|
|
|
|
}
|
|
|
|
for (TopExp_Explorer exp(_subShape, TopAbs_EDGE, TopAbs_FACE); exp.More();
|
|
|
|
exp.Next())
|
|
|
|
{
|
|
|
|
InsertDependence(exp.Current());
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case TopAbs_COMPSOLID:
|
|
|
|
{
|
2003-09-04 09:21:41 +00:00
|
|
|
//MESSAGE("compsolid");
|
2004-12-01 10:48:31 +00:00
|
|
|
for (TopExp_Explorer exp(_subShape, TopAbs_SOLID); exp.More();
|
|
|
|
exp.Next())
|
|
|
|
{
|
|
|
|
InsertDependence(exp.Current());
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case TopAbs_SHELL:
|
|
|
|
{
|
|
|
|
//MESSAGE("shell");
|
|
|
|
for (TopExp_Explorer exp(_subShape, TopAbs_FACE); exp.More();
|
|
|
|
exp.Next())
|
|
|
|
{
|
|
|
|
InsertDependence(exp.Current());
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case TopAbs_WIRE:
|
|
|
|
{
|
|
|
|
//MESSAGE("wire");
|
|
|
|
for (TopExp_Explorer exp(_subShape, TopAbs_EDGE); exp.More();
|
|
|
|
exp.Next())
|
|
|
|
{
|
|
|
|
InsertDependence(exp.Current());
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case TopAbs_SOLID:
|
|
|
|
{
|
|
|
|
//MESSAGE("solid");
|
|
|
|
for (TopExp_Explorer exp(_subShape, TopAbs_FACE); exp.More();
|
|
|
|
exp.Next())
|
|
|
|
{
|
|
|
|
InsertDependence(exp.Current());
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case TopAbs_FACE:
|
|
|
|
{
|
|
|
|
//MESSAGE("face");
|
|
|
|
for (TopExp_Explorer exp(_subShape, TopAbs_EDGE); exp.More();
|
|
|
|
exp.Next())
|
|
|
|
{
|
|
|
|
InsertDependence(exp.Current());
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case TopAbs_EDGE:
|
|
|
|
{
|
|
|
|
//MESSAGE("edge");
|
|
|
|
for (TopExp_Explorer exp(_subShape, TopAbs_VERTEX); exp.More();
|
|
|
|
exp.Next())
|
|
|
|
{
|
2003-09-04 09:21:41 +00:00
|
|
|
InsertDependence(exp.Current());
|
2004-12-01 10:48:31 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case TopAbs_VERTEX:
|
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
_dependenceAnalysed = true;
|
|
|
|
return _mapDepend;
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
/*!
|
|
|
|
* For simple Shapes (solid, face, edge): add subMesh into dependence list.
|
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
|
|
|
void SMESH_subMesh::InsertDependence(const TopoDS_Shape aSubShape)
|
|
|
|
{
|
2004-12-01 10:48:31 +00:00
|
|
|
//MESSAGE("SMESH_subMesh::InsertDependence");
|
|
|
|
SMESH_subMesh *aSubMesh = _father->GetSubMesh(aSubShape);
|
|
|
|
int type = aSubShape.ShapeType();
|
|
|
|
int ordType = 9 - type; // 2 = Vertex, 8 = CompSolid
|
|
|
|
int cle = aSubMesh->GetId();
|
|
|
|
cle += 10000000 * ordType; // sort map by ordType then index
|
2006-03-13 15:29:49 +00:00
|
|
|
if ( _mapDepend.find( cle ) == _mapDepend.end())
|
2004-12-01 10:48:31 +00:00
|
|
|
{
|
|
|
|
_mapDepend[cle] = aSubMesh;
|
2006-03-13 15:29:49 +00:00
|
|
|
const map < int, SMESH_subMesh * > & subMap = aSubMesh->DependsOn();
|
|
|
|
_mapDepend.insert( subMap.begin(), subMap.end() );
|
2004-12-01 10:48:31 +00:00
|
|
|
}
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
2003-09-04 09:21:41 +00:00
|
|
|
|
2003-05-19 13:18:36 +00:00
|
|
|
//=============================================================================
|
|
|
|
/*!
|
2004-12-01 10:48:31 +00:00
|
|
|
*
|
2003-05-19 13:18:36 +00:00
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
2006-03-13 15:29:49 +00:00
|
|
|
const TopoDS_Shape & SMESH_subMesh::GetSubShape() const
|
2003-05-19 13:18:36 +00:00
|
|
|
{
|
2003-09-04 09:21:41 +00:00
|
|
|
//MESSAGE("SMESH_subMesh::GetSubShape");
|
|
|
|
return _subShape;
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
|
|
|
|
//=======================================================================
|
|
|
|
//function : CanAddHypothesis
|
|
|
|
//purpose : return true if theHypothesis can be attached to me:
|
|
|
|
// its dimention is checked
|
|
|
|
//=======================================================================
|
|
|
|
|
|
|
|
bool SMESH_subMesh::CanAddHypothesis(const SMESH_Hypothesis* theHypothesis) const
|
|
|
|
{
|
|
|
|
int aHypDim = theHypothesis->GetDim();
|
|
|
|
int aShapeDim = SMESH_Gen::GetShapeDim(_subShape);
|
|
|
|
if ( aHypDim <= aShapeDim )
|
|
|
|
return true;
|
|
|
|
// if ( aHypDim < aShapeDim )
|
|
|
|
// return ( _father->IsMainShape( _subShape ));
|
2004-12-01 10:48:31 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
//=======================================================================
|
|
|
|
//function : IsApplicableHypotesis
|
2006-10-04 13:21:59 +00:00
|
|
|
//purpose :
|
2004-06-18 08:55:35 +00:00
|
|
|
//=======================================================================
|
|
|
|
|
2005-02-04 10:39:49 +00:00
|
|
|
bool SMESH_subMesh::IsApplicableHypotesis(const SMESH_Hypothesis* theHypothesis,
|
|
|
|
const TopAbs_ShapeEnum theShapeType)
|
2004-06-18 08:55:35 +00:00
|
|
|
{
|
|
|
|
if ( theHypothesis->GetType() > SMESHDS_Hypothesis::PARAM_ALGO)
|
|
|
|
// algorithm
|
2005-02-04 10:39:49 +00:00
|
|
|
return ( theHypothesis->GetShapeType() & (1<< theShapeType));
|
2004-06-18 08:55:35 +00:00
|
|
|
|
|
|
|
// hypothesis
|
2005-02-04 10:39:49 +00:00
|
|
|
switch ( theShapeType ) {
|
2006-10-04 13:21:59 +00:00
|
|
|
case TopAbs_EDGE:
|
|
|
|
case TopAbs_FACE:
|
2006-03-13 15:29:49 +00:00
|
|
|
case TopAbs_SOLID:
|
|
|
|
return SMESH_Gen::GetShapeDim( theShapeType ) == theHypothesis->GetDim();
|
2006-10-04 13:21:59 +00:00
|
|
|
|
|
|
|
case TopAbs_SHELL:
|
|
|
|
// Special case for algorithms, building 2D mesh on a whole shell.
|
|
|
|
// Before this fix there was a problem after restoring from study,
|
|
|
|
// because in that case algorithm is assigned before hypothesis
|
|
|
|
// (on shell in problem case) and hypothesis is checked on faces
|
|
|
|
// (because it is 2D), where we have NO_ALGO state.
|
|
|
|
// Now 2D hypothesis is also applicable to shells.
|
|
|
|
return (theHypothesis->GetDim() == 2 || theHypothesis->GetDim() == 3);
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
// case TopAbs_WIRE:
|
|
|
|
// case TopAbs_COMPSOLID:
|
|
|
|
// case TopAbs_COMPOUND:
|
2006-03-13 15:29:49 +00:00
|
|
|
default:;
|
2004-06-18 08:55:35 +00:00
|
|
|
}
|
2006-03-13 15:29:49 +00:00
|
|
|
return false;
|
2004-06-18 08:55:35 +00:00
|
|
|
}
|
|
|
|
|
2003-05-19 13:18:36 +00:00
|
|
|
//=============================================================================
|
|
|
|
/*!
|
2004-12-01 10:48:31 +00:00
|
|
|
*
|
2003-05-19 13:18:36 +00:00
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
SMESH_Hypothesis::Hypothesis_Status
|
|
|
|
SMESH_subMesh::AlgoStateEngine(int event, SMESH_Hypothesis * anHyp)
|
2003-05-19 13:18:36 +00:00
|
|
|
{
|
2004-06-18 08:55:35 +00:00
|
|
|
// MESSAGE("SMESH_subMesh::AlgoStateEngine");
|
|
|
|
//SCRUTE(_algoState);
|
|
|
|
//SCRUTE(event);
|
|
|
|
|
|
|
|
// **** les retour des evenement shape sont significatifs
|
|
|
|
// (add ou remove fait ou non)
|
|
|
|
// le retour des evenement father n'indiquent pas que add ou remove fait
|
2005-02-04 10:39:49 +00:00
|
|
|
|
|
|
|
SMESH_Hypothesis::Hypothesis_Status aux_ret, ret = SMESH_Hypothesis::HYP_OK;
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
int dim = SMESH_Gen::GetShapeDim(_subShape);
|
|
|
|
|
|
|
|
if (dim < 1)
|
2004-12-01 10:48:31 +00:00
|
|
|
{
|
|
|
|
_algoState = HYP_OK;
|
|
|
|
if (event == ADD_HYP || event == ADD_ALGO)
|
|
|
|
return SMESH_Hypothesis::HYP_BAD_DIM; // do not allow to assign any hyp
|
|
|
|
else
|
|
|
|
return SMESH_Hypothesis::HYP_OK;
|
|
|
|
}
|
2004-06-18 08:55:35 +00:00
|
|
|
|
2006-12-06 15:53:25 +00:00
|
|
|
SMESH_Gen* gen =_father->GetGen();
|
|
|
|
SMESH_Algo* algo = 0;
|
2004-06-18 08:55:35 +00:00
|
|
|
int oldAlgoState = _algoState;
|
|
|
|
bool modifiedHyp = false; // if set to true, force event MODIF_ALGO_STATE
|
|
|
|
// in ComputeStateEngine
|
|
|
|
|
|
|
|
// ----------------------
|
|
|
|
// check mesh conformity
|
|
|
|
// ----------------------
|
|
|
|
if (event == ADD_ALGO)
|
|
|
|
{
|
|
|
|
if (IsApplicableHypotesis( anHyp ) &&
|
|
|
|
!_father->IsNotConformAllowed() &&
|
|
|
|
!IsConform( static_cast< SMESH_Algo* >( anHyp )))
|
|
|
|
return SMESH_Hypothesis::HYP_NOTCONFORM;
|
|
|
|
}
|
2004-12-01 10:48:31 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
// ----------------------------------
|
|
|
|
// add a hypothesis to DS if possible
|
|
|
|
// ----------------------------------
|
|
|
|
if (event == ADD_HYP || event == ADD_ALGO)
|
|
|
|
{
|
|
|
|
if ( ! CanAddHypothesis( anHyp ))
|
|
|
|
return SMESH_Hypothesis::HYP_BAD_DIM;
|
|
|
|
|
2006-03-13 15:29:49 +00:00
|
|
|
if ( /*!anHyp->IsAuxiliary() &&*/ GetSimilarAttached( _subShape, anHyp ) )
|
2004-06-18 08:55:35 +00:00
|
|
|
return SMESH_Hypothesis::HYP_ALREADY_EXIST;
|
|
|
|
|
|
|
|
if ( !_meshDS->AddHypothesis(_subShape, anHyp))
|
|
|
|
return SMESH_Hypothesis::HYP_ALREADY_EXIST;
|
2004-12-17 11:07:35 +00:00
|
|
|
|
|
|
|
// Serve Propagation of 1D hypothesis
|
|
|
|
if (event == ADD_HYP) {
|
|
|
|
bool isPropagationOk = true;
|
2006-03-13 15:29:49 +00:00
|
|
|
bool isPropagationHyp = ( strcmp( "Propagation", anHyp->GetName() ) == 0 );
|
2004-12-17 11:07:35 +00:00
|
|
|
|
2006-03-13 15:29:49 +00:00
|
|
|
if ( isPropagationHyp ) {
|
2005-02-04 10:39:49 +00:00
|
|
|
TopExp_Explorer exp (_subShape, TopAbs_EDGE);
|
|
|
|
TopTools_MapOfShape aMap;
|
|
|
|
for (; exp.More(); exp.Next()) {
|
|
|
|
if (aMap.Add(exp.Current())) {
|
|
|
|
if (!_father->BuildPropagationChain(exp.Current())) {
|
|
|
|
isPropagationOk = false;
|
2004-12-17 11:07:35 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2005-02-04 10:39:49 +00:00
|
|
|
}
|
|
|
|
else if (anHyp->GetDim() == 1) { // Only 1D hypothesis can be propagated
|
|
|
|
TopExp_Explorer exp (_subShape, TopAbs_EDGE);
|
|
|
|
TopTools_MapOfShape aMap;
|
|
|
|
for (; exp.More(); exp.Next()) {
|
|
|
|
if (aMap.Add(exp.Current())) {
|
|
|
|
TopoDS_Shape aMainEdge;
|
|
|
|
if (_father->IsPropagatedHypothesis(exp.Current(), aMainEdge)) {
|
|
|
|
isPropagationOk = _father->RebuildPropagationChains();
|
|
|
|
} else if (_father->IsPropagationHypothesis(exp.Current())) {
|
|
|
|
isPropagationOk = _father->BuildPropagationChain(exp.Current());
|
|
|
|
} else {
|
|
|
|
}
|
2004-12-17 11:07:35 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
}
|
|
|
|
|
2006-03-13 15:29:49 +00:00
|
|
|
if ( isPropagationOk ) {
|
|
|
|
if ( isPropagationHyp )
|
|
|
|
return ret; // nothing more to do for "Propagation" hypothesis
|
|
|
|
}
|
|
|
|
else if ( ret < SMESH_Hypothesis::HYP_CONCURENT) {
|
2004-12-17 11:07:35 +00:00
|
|
|
ret = SMESH_Hypothesis::HYP_CONCURENT;
|
|
|
|
}
|
|
|
|
} // Serve Propagation of 1D hypothesis
|
2004-06-18 08:55:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// --------------------------
|
|
|
|
// remove a hypothesis from DS
|
|
|
|
// --------------------------
|
|
|
|
if (event == REMOVE_HYP || event == REMOVE_ALGO)
|
|
|
|
{
|
|
|
|
if (!_meshDS->RemoveHypothesis(_subShape, anHyp))
|
|
|
|
return SMESH_Hypothesis::HYP_OK; // nothing changes
|
2004-12-17 11:07:35 +00:00
|
|
|
|
|
|
|
// Serve Propagation of 1D hypothesis
|
2005-02-04 10:39:49 +00:00
|
|
|
if (event == REMOVE_HYP)
|
|
|
|
{
|
2004-12-17 11:07:35 +00:00
|
|
|
bool isPropagationOk = true;
|
2005-02-04 10:39:49 +00:00
|
|
|
SMESH_HypoFilter propagFilter( SMESH_HypoFilter::HasName( "Propagation" ));
|
2006-03-13 15:29:49 +00:00
|
|
|
bool isPropagationHyp = propagFilter.IsOk( anHyp, _subShape );
|
|
|
|
|
|
|
|
if ( isPropagationHyp )
|
2005-02-04 10:39:49 +00:00
|
|
|
{
|
|
|
|
TopExp_Explorer exp (_subShape, TopAbs_EDGE);
|
|
|
|
TopTools_MapOfShape aMap;
|
|
|
|
for (; exp.More(); exp.Next()) {
|
|
|
|
if (aMap.Add(exp.Current()) &&
|
|
|
|
!_father->GetHypothesis( exp.Current(), propagFilter, true )) {
|
|
|
|
// no more Propagation on the current edge
|
|
|
|
if (!_father->RemovePropagationChain(exp.Current())) {
|
|
|
|
return SMESH_Hypothesis::HYP_UNKNOWN_FATAL;
|
2004-12-17 11:07:35 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2005-02-04 10:39:49 +00:00
|
|
|
// rebuild propagation chains, because removing one
|
|
|
|
// chain can resolve concurention, existing before
|
|
|
|
isPropagationOk = _father->RebuildPropagationChains();
|
|
|
|
}
|
|
|
|
else if (anHyp->GetDim() == 1) // Only 1D hypothesis can be propagated
|
|
|
|
{
|
|
|
|
isPropagationOk = _father->RebuildPropagationChains();
|
2004-12-17 11:07:35 +00:00
|
|
|
}
|
|
|
|
|
2006-03-13 15:29:49 +00:00
|
|
|
if ( isPropagationOk ) {
|
|
|
|
if ( isPropagationHyp )
|
|
|
|
return ret; // nothing more to do for "Propagation" hypothesis
|
|
|
|
}
|
|
|
|
else if ( ret < SMESH_Hypothesis::HYP_CONCURENT) {
|
2004-12-17 11:07:35 +00:00
|
|
|
ret = SMESH_Hypothesis::HYP_CONCURENT;
|
|
|
|
}
|
|
|
|
} // Serve Propagation of 1D hypothesis
|
2006-05-06 08:51:48 +00:00
|
|
|
else // event == REMOVE_ALGO
|
|
|
|
{
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = dynamic_cast<SMESH_Algo*> (anHyp);
|
2006-05-06 08:51:48 +00:00
|
|
|
if (!algo->NeedDescretBoundary())
|
|
|
|
{
|
|
|
|
// clean all mesh in the tree of the current submesh;
|
|
|
|
// we must perform it now because later
|
|
|
|
// we will have no information about the type of the removed algo
|
|
|
|
CleanDependants();
|
|
|
|
ComputeStateEngine( CLEAN );
|
|
|
|
CleanDependsOn();
|
|
|
|
}
|
|
|
|
}
|
2004-06-18 08:55:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// ------------------
|
|
|
|
// analyse algo state
|
|
|
|
// ------------------
|
|
|
|
if (!IsApplicableHypotesis( anHyp ))
|
|
|
|
return ret; // not applicable hypotheses do not change algo state
|
|
|
|
|
|
|
|
switch (_algoState)
|
|
|
|
{
|
|
|
|
|
|
|
|
// ----------------------------------------------------------------------
|
|
|
|
|
|
|
|
case NO_ALGO:
|
|
|
|
switch (event) {
|
|
|
|
case ADD_HYP:
|
|
|
|
break;
|
|
|
|
case ADD_ALGO: {
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2004-06-18 08:55:35 +00:00
|
|
|
ASSERT(algo);
|
2004-12-01 10:48:31 +00:00
|
|
|
if (algo->CheckHypothesis((*_father),_subShape, aux_ret))
|
2004-06-18 08:55:35 +00:00
|
|
|
SetAlgoState(HYP_OK);
|
2006-12-06 15:53:25 +00:00
|
|
|
else if ( algo->IsStatusFatal( aux_ret )) {
|
|
|
|
_meshDS->RemoveHypothesis(_subShape, anHyp);
|
|
|
|
ret = aux_ret;
|
|
|
|
}
|
2004-06-18 08:55:35 +00:00
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case REMOVE_HYP:
|
|
|
|
break;
|
|
|
|
case REMOVE_ALGO:
|
|
|
|
break;
|
|
|
|
case ADD_FATHER_HYP:
|
|
|
|
break;
|
|
|
|
case ADD_FATHER_ALGO: { // Algo just added in father
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2004-06-18 08:55:35 +00:00
|
|
|
ASSERT(algo);
|
|
|
|
if ( algo == anHyp ) {
|
|
|
|
if ( algo->CheckHypothesis((*_father),_subShape, aux_ret))
|
|
|
|
SetAlgoState(HYP_OK);
|
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case REMOVE_FATHER_HYP:
|
|
|
|
break;
|
|
|
|
case REMOVE_FATHER_ALGO: {
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2004-06-18 08:55:35 +00:00
|
|
|
if (algo)
|
|
|
|
{
|
|
|
|
if ( algo->CheckHypothesis((*_father),_subShape, aux_ret ))
|
|
|
|
SetAlgoState(HYP_OK);
|
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
ASSERT(0);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
// ----------------------------------------------------------------------
|
|
|
|
|
|
|
|
case MISSING_HYP:
|
|
|
|
switch (event)
|
|
|
|
{
|
|
|
|
case ADD_HYP: {
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2004-06-18 08:55:35 +00:00
|
|
|
ASSERT(algo);
|
|
|
|
if ( algo->CheckHypothesis((*_father),_subShape, ret ))
|
|
|
|
SetAlgoState(HYP_OK);
|
|
|
|
if (SMESH_Hypothesis::IsStatusFatal( ret ))
|
|
|
|
_meshDS->RemoveHypothesis(_subShape, anHyp);
|
2006-03-13 15:29:49 +00:00
|
|
|
else if (!_father->IsUsedHypothesis( anHyp, this ))
|
2004-06-18 08:55:35 +00:00
|
|
|
{
|
|
|
|
_meshDS->RemoveHypothesis(_subShape, anHyp);
|
|
|
|
ret = SMESH_Hypothesis::HYP_INCOMPATIBLE;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case ADD_ALGO: { //already existing algo : on father ?
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2004-06-18 08:55:35 +00:00
|
|
|
ASSERT(algo);
|
|
|
|
if ( algo->CheckHypothesis((*_father),_subShape, aux_ret ))// ignore hyp status
|
|
|
|
SetAlgoState(HYP_OK);
|
2006-12-06 15:53:25 +00:00
|
|
|
else if ( algo->IsStatusFatal( aux_ret )) {
|
|
|
|
_meshDS->RemoveHypothesis(_subShape, anHyp);
|
|
|
|
ret = aux_ret;
|
|
|
|
}
|
2004-06-18 08:55:35 +00:00
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case REMOVE_HYP:
|
|
|
|
break;
|
|
|
|
case REMOVE_ALGO: { // perhaps a father algo applies ?
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2004-06-18 08:55:35 +00:00
|
|
|
if (algo == NULL) // no more algo applying on subShape...
|
|
|
|
{
|
|
|
|
SetAlgoState(NO_ALGO);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if ( algo->CheckHypothesis((*_father),_subShape, aux_ret ))
|
|
|
|
SetAlgoState(HYP_OK);
|
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case ADD_FATHER_HYP: {
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2004-06-18 08:55:35 +00:00
|
|
|
ASSERT(algo);
|
|
|
|
if ( algo->CheckHypothesis((*_father),_subShape, aux_ret ))
|
|
|
|
SetAlgoState(HYP_OK);
|
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
|
|
|
break;
|
2006-12-06 15:53:25 +00:00
|
|
|
}
|
2004-06-18 08:55:35 +00:00
|
|
|
case ADD_FATHER_ALGO: { // new father algo
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2004-06-18 08:55:35 +00:00
|
|
|
ASSERT( algo );
|
|
|
|
if ( algo == anHyp ) {
|
|
|
|
if ( algo->CheckHypothesis((*_father),_subShape, aux_ret ))
|
|
|
|
SetAlgoState(HYP_OK);
|
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case REMOVE_FATHER_HYP: // nothing to do
|
|
|
|
break;
|
|
|
|
case REMOVE_FATHER_ALGO: {
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2004-06-18 08:55:35 +00:00
|
|
|
if (algo == NULL) // no more applying algo on father
|
|
|
|
{
|
|
|
|
SetAlgoState(NO_ALGO);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if ( algo->CheckHypothesis((*_father),_subShape , aux_ret ))
|
|
|
|
SetAlgoState(HYP_OK);
|
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
ASSERT(0);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
// ----------------------------------------------------------------------
|
2004-12-01 10:48:31 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
case HYP_OK:
|
|
|
|
switch (event)
|
|
|
|
{
|
|
|
|
case ADD_HYP: {
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2004-06-18 08:55:35 +00:00
|
|
|
ASSERT(algo);
|
|
|
|
if (!algo->CheckHypothesis((*_father),_subShape, ret ))
|
|
|
|
{
|
2004-12-01 10:48:31 +00:00
|
|
|
if ( !SMESH_Hypothesis::IsStatusFatal( ret ))
|
|
|
|
// ret should be fatal: anHyp was not added
|
|
|
|
ret = SMESH_Hypothesis::HYP_INCOMPATIBLE;
|
2004-06-18 08:55:35 +00:00
|
|
|
}
|
2006-03-13 15:29:49 +00:00
|
|
|
else if (!_father->IsUsedHypothesis( anHyp, this ))
|
2005-12-20 11:10:13 +00:00
|
|
|
ret = SMESH_Hypothesis::HYP_INCOMPATIBLE;
|
|
|
|
|
|
|
|
if (SMESH_Hypothesis::IsStatusFatal( ret ))
|
2004-06-18 08:55:35 +00:00
|
|
|
{
|
2005-12-20 11:10:13 +00:00
|
|
|
MESSAGE("do not add extra hypothesis");
|
2004-06-18 08:55:35 +00:00
|
|
|
_meshDS->RemoveHypothesis(_subShape, anHyp);
|
|
|
|
}
|
2004-12-01 10:48:31 +00:00
|
|
|
else
|
|
|
|
{
|
|
|
|
modifiedHyp = true;
|
|
|
|
}
|
2004-06-18 08:55:35 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
case ADD_ALGO: { //already existing algo : on father ?
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2005-12-20 11:10:13 +00:00
|
|
|
if ( algo->CheckHypothesis((*_father),_subShape, aux_ret )) {
|
|
|
|
// check if algo changes
|
|
|
|
SMESH_HypoFilter f;
|
|
|
|
f.Init( SMESH_HypoFilter::IsAlgo() );
|
|
|
|
f.And( SMESH_HypoFilter::IsApplicableTo( _subShape ));
|
|
|
|
f.AndNot( SMESH_HypoFilter::Is( algo ));
|
|
|
|
const SMESH_Hypothesis * prevAlgo = _father->GetHypothesis( _subShape, f, true );
|
2006-10-04 13:21:59 +00:00
|
|
|
if (prevAlgo &&
|
2005-12-20 11:10:13 +00:00
|
|
|
string(algo->GetName()) != string(prevAlgo->GetName()) )
|
|
|
|
modifiedHyp = true;
|
|
|
|
}
|
2004-06-18 08:55:35 +00:00
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case REMOVE_HYP: {
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2004-06-18 08:55:35 +00:00
|
|
|
ASSERT(algo);
|
|
|
|
if ( algo->CheckHypothesis((*_father),_subShape, aux_ret ))
|
|
|
|
SetAlgoState(HYP_OK);
|
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
|
|
|
modifiedHyp = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case REMOVE_ALGO: { // perhaps a father algo applies ?
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2004-06-18 08:55:35 +00:00
|
|
|
if (algo == NULL) // no more algo applying on subShape...
|
|
|
|
{
|
|
|
|
SetAlgoState(NO_ALGO);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2005-12-20 11:10:13 +00:00
|
|
|
if ( algo->CheckHypothesis((*_father),_subShape, aux_ret )) {
|
|
|
|
// check if algo remains
|
|
|
|
if ( anHyp != algo && strcmp( anHyp->GetName(), algo->GetName()) )
|
|
|
|
modifiedHyp = true;
|
|
|
|
}
|
2004-06-18 08:55:35 +00:00
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case ADD_FATHER_HYP: { // new father hypothesis ?
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2004-06-18 08:55:35 +00:00
|
|
|
ASSERT(algo);
|
|
|
|
if ( algo->CheckHypothesis((*_father),_subShape, aux_ret ))
|
|
|
|
{
|
2006-03-13 15:29:49 +00:00
|
|
|
if (_father->IsUsedHypothesis( anHyp, this )) // new Hyp
|
2004-06-18 08:55:35 +00:00
|
|
|
modifiedHyp = true;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
|
|
|
break;
|
|
|
|
}
|
2005-12-20 11:10:13 +00:00
|
|
|
case ADD_FATHER_ALGO: {
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2005-12-20 11:10:13 +00:00
|
|
|
if ( algo == anHyp ) { // a new algo on father
|
|
|
|
if ( algo->CheckHypothesis((*_father),_subShape, aux_ret )) {
|
|
|
|
// check if algo changes
|
|
|
|
SMESH_HypoFilter f;
|
|
|
|
f.Init( SMESH_HypoFilter::IsAlgo() );
|
|
|
|
f.And( SMESH_HypoFilter::IsApplicableTo( _subShape ));
|
|
|
|
f.AndNot( SMESH_HypoFilter::Is( algo ));
|
|
|
|
const SMESH_Hypothesis* prevAlgo = _father->GetHypothesis( _subShape, f, true );
|
2006-10-04 13:21:59 +00:00
|
|
|
if (prevAlgo &&
|
2005-12-20 11:10:13 +00:00
|
|
|
string(algo->GetName()) != string(prevAlgo->GetName()) )
|
|
|
|
modifiedHyp = true;
|
|
|
|
}
|
2004-06-18 08:55:35 +00:00
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case REMOVE_FATHER_HYP: {
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2004-06-18 08:55:35 +00:00
|
|
|
ASSERT(algo);
|
2005-12-20 11:10:13 +00:00
|
|
|
if ( algo->CheckHypothesis((*_father),_subShape, aux_ret )) {
|
|
|
|
// is there the same local hyp or maybe a new father algo applied?
|
|
|
|
if ( !GetSimilarAttached( _subShape, anHyp ) )
|
|
|
|
modifiedHyp = true;
|
|
|
|
}
|
2004-06-18 08:55:35 +00:00
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case REMOVE_FATHER_ALGO: {
|
2006-12-06 15:53:25 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2004-06-18 08:55:35 +00:00
|
|
|
if (algo == NULL) // no more applying algo on father
|
|
|
|
{
|
|
|
|
SetAlgoState(NO_ALGO);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2005-12-20 11:10:13 +00:00
|
|
|
if ( algo->CheckHypothesis((*_father),_subShape, aux_ret )) {
|
|
|
|
// check if algo changes
|
|
|
|
if ( string(algo->GetName()) != string( anHyp->GetName()) )
|
|
|
|
modifiedHyp = true;
|
|
|
|
}
|
2004-06-18 08:55:35 +00:00
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
ASSERT(0);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
2004-12-01 10:48:31 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
// ----------------------------------------------------------------------
|
2004-12-01 10:48:31 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
default:
|
|
|
|
ASSERT(0);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2006-12-06 15:53:25 +00:00
|
|
|
if ( _algoState != oldAlgoState )
|
|
|
|
{
|
|
|
|
if (_algoState == HYP_OK )
|
|
|
|
algo->SetEventListener( this );
|
|
|
|
if ( oldAlgoState == HYP_OK )
|
|
|
|
DeleteOwnListeners();
|
|
|
|
}
|
|
|
|
NotifyListenersOnEvent( event, ALGO_EVENT, anHyp );
|
|
|
|
|
|
|
|
if (_algoState != oldAlgoState || modifiedHyp)
|
2004-12-17 11:07:35 +00:00
|
|
|
ComputeStateEngine(MODIF_ALGO_STATE);
|
2004-06-18 08:55:35 +00:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2003-09-04 09:21:41 +00:00
|
|
|
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
//=======================================================================
|
|
|
|
//function : IsConform
|
|
|
|
//purpose : check if a conform mesh will be produced by the Algo
|
|
|
|
//=======================================================================
|
2003-09-04 09:21:41 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
bool SMESH_subMesh::IsConform(const SMESH_Algo* theAlgo)
|
|
|
|
{
|
2004-12-01 10:48:31 +00:00
|
|
|
// MESSAGE( "SMESH_subMesh::IsConform" );
|
2004-06-18 08:55:35 +00:00
|
|
|
|
|
|
|
if ( !theAlgo ) return false;
|
|
|
|
|
|
|
|
// check only algo that doesn't NeedDescretBoundary(): because mesh made
|
|
|
|
// on a sub-shape will be ignored by theAlgo
|
|
|
|
if ( theAlgo->NeedDescretBoundary() )
|
|
|
|
return true;
|
|
|
|
|
|
|
|
SMESH_Gen* gen =_father->GetGen();
|
2004-12-01 10:48:31 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
// only local algo is to be checked
|
2005-02-04 10:39:49 +00:00
|
|
|
if ( gen->IsGlobalHypothesis( theAlgo, *_father ))
|
2004-06-18 08:55:35 +00:00
|
|
|
return true;
|
|
|
|
|
|
|
|
// check algo attached to adjacent shapes
|
|
|
|
|
|
|
|
// loop on one level down sub-meshes
|
|
|
|
TopoDS_Iterator itsub( _subShape );
|
|
|
|
for (; itsub.More(); itsub.Next())
|
|
|
|
{
|
|
|
|
// loop on adjacent subShapes
|
|
|
|
TopTools_ListIteratorOfListOfShape it( _father->GetAncestors( itsub.Value() ));
|
|
|
|
for (; it.More(); it.Next())
|
|
|
|
{
|
|
|
|
const TopoDS_Shape& adjacent = it.Value();
|
|
|
|
if ( _subShape.IsSame( adjacent )) continue;
|
|
|
|
if ( adjacent.ShapeType() != _subShape.ShapeType())
|
|
|
|
break;
|
|
|
|
|
|
|
|
// check algo attached to smAdjacent
|
|
|
|
SMESH_Algo * algo = gen->GetAlgo((*_father), adjacent);
|
|
|
|
if (algo &&
|
|
|
|
//algo != theAlgo &&
|
|
|
|
!algo->NeedDescretBoundary() /*&&
|
2005-02-04 10:39:49 +00:00
|
|
|
!gen->IsGlobalHypothesis( algo, *_father )*/)
|
2004-06-18 08:55:35 +00:00
|
|
|
return false; // NOT CONFORM MESH WILL BE PRODUCED
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
/*!
|
2004-12-01 10:48:31 +00:00
|
|
|
*
|
2003-05-19 13:18:36 +00:00
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
|
|
|
void SMESH_subMesh::SetAlgoState(int state)
|
|
|
|
{
|
2006-03-13 15:29:49 +00:00
|
|
|
_algoState = state;
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
/*!
|
2004-12-01 10:48:31 +00:00
|
|
|
*
|
2003-05-19 13:18:36 +00:00
|
|
|
*/
|
|
|
|
//=============================================================================
|
2004-12-01 10:48:31 +00:00
|
|
|
SMESH_Hypothesis::Hypothesis_Status
|
|
|
|
SMESH_subMesh::SubMeshesAlgoStateEngine(int event,
|
|
|
|
SMESH_Hypothesis * anHyp)
|
2003-05-19 13:18:36 +00:00
|
|
|
{
|
2004-12-01 10:48:31 +00:00
|
|
|
//MESSAGE("SMESH_subMesh::SubMeshesAlgoStateEngine");
|
2004-06-18 08:55:35 +00:00
|
|
|
SMESH_Hypothesis::Hypothesis_Status ret = SMESH_Hypothesis::HYP_OK;
|
2004-12-01 10:48:31 +00:00
|
|
|
//EAP: a wire (dim==1) should notify edges (dim==1)
|
|
|
|
//EAP: int dim = SMESH_Gen::GetShapeDim(_subShape);
|
2006-03-13 15:29:49 +00:00
|
|
|
if (_subShape.ShapeType() < TopAbs_EDGE ) // wire,face etc
|
2004-12-01 10:48:31 +00:00
|
|
|
{
|
|
|
|
const map < int, SMESH_subMesh * >&subMeshes = DependsOn();
|
2003-09-04 09:21:41 +00:00
|
|
|
|
2004-12-01 10:48:31 +00:00
|
|
|
map < int, SMESH_subMesh * >::const_iterator itsub;
|
|
|
|
for (itsub = subMeshes.begin(); itsub != subMeshes.end(); itsub++)
|
|
|
|
{
|
|
|
|
SMESH_subMesh *sm = (*itsub).second;
|
|
|
|
SMESH_Hypothesis::Hypothesis_Status ret2 =
|
|
|
|
sm->AlgoStateEngine(event, anHyp);
|
|
|
|
if ( ret2 > ret )
|
|
|
|
ret = ret2;
|
|
|
|
}
|
|
|
|
}
|
2004-06-18 08:55:35 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
/*!
|
2004-12-01 10:48:31 +00:00
|
|
|
*
|
2004-06-18 08:55:35 +00:00
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
|
|
|
void SMESH_subMesh::CleanDependsOn()
|
|
|
|
{
|
2006-03-13 15:29:49 +00:00
|
|
|
//MESSAGE("SMESH_subMesh::CleanDependsOn");
|
2004-06-18 08:55:35 +00:00
|
|
|
|
2006-03-13 15:29:49 +00:00
|
|
|
const map < int, SMESH_subMesh * >&dependson = DependsOn();
|
|
|
|
map < int, SMESH_subMesh * >::const_iterator its;
|
|
|
|
for (its = dependson.begin(); its != dependson.end(); its++)
|
|
|
|
{
|
|
|
|
SMESH_subMesh *sm = (*its).second;
|
|
|
|
sm->ComputeStateEngine(CLEAN);
|
|
|
|
}
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
/*!
|
2004-12-01 10:48:31 +00:00
|
|
|
*
|
2003-05-19 13:18:36 +00:00
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
|
|
|
void SMESH_subMesh::DumpAlgoState(bool isMain)
|
|
|
|
{
|
2003-09-04 09:21:41 +00:00
|
|
|
int dim = SMESH_Gen::GetShapeDim(_subShape);
|
2003-05-19 13:18:36 +00:00
|
|
|
// if (dim < 1) return;
|
2003-09-04 09:21:41 +00:00
|
|
|
if (isMain)
|
2003-05-19 13:18:36 +00:00
|
|
|
{
|
2003-09-04 09:21:41 +00:00
|
|
|
const map < int, SMESH_subMesh * >&subMeshes = DependsOn();
|
|
|
|
|
|
|
|
map < int, SMESH_subMesh * >::const_iterator itsub;
|
|
|
|
for (itsub = subMeshes.begin(); itsub != subMeshes.end(); itsub++)
|
|
|
|
{
|
|
|
|
SMESH_subMesh *sm = (*itsub).second;
|
|
|
|
sm->DumpAlgoState(false);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
int type = _subShape.ShapeType();
|
|
|
|
MESSAGE("dim = " << dim << " type of shape " << type);
|
|
|
|
switch (_algoState)
|
|
|
|
{
|
|
|
|
case NO_ALGO:
|
|
|
|
MESSAGE(" AlgoState = NO_ALGO");
|
|
|
|
break;
|
|
|
|
case MISSING_HYP:
|
|
|
|
MESSAGE(" AlgoState = MISSING_HYP");
|
|
|
|
break;
|
|
|
|
case HYP_OK:
|
|
|
|
MESSAGE(" AlgoState = HYP_OK");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
switch (_computeState)
|
|
|
|
{
|
|
|
|
case NOT_READY:
|
|
|
|
MESSAGE(" ComputeState = NOT_READY");
|
|
|
|
break;
|
|
|
|
case READY_TO_COMPUTE:
|
|
|
|
MESSAGE(" ComputeState = READY_TO_COMPUTE");
|
|
|
|
break;
|
|
|
|
case COMPUTE_OK:
|
|
|
|
MESSAGE(" ComputeState = COMPUTE_OK");
|
|
|
|
break;
|
|
|
|
case FAILED_TO_COMPUTE:
|
|
|
|
MESSAGE(" ComputeState = FAILED_TO_COMPUTE");
|
|
|
|
break;
|
|
|
|
}
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
|
|
|
|
2006-03-13 15:29:49 +00:00
|
|
|
//================================================================================
|
2003-05-19 13:18:36 +00:00
|
|
|
/*!
|
2006-03-13 15:29:49 +00:00
|
|
|
* \brief Remove nodes and elements bound to submesh
|
|
|
|
* \param subMesh - submesh containing nodes and elements
|
2003-05-19 13:18:36 +00:00
|
|
|
*/
|
2006-03-13 15:29:49 +00:00
|
|
|
//================================================================================
|
2003-05-19 13:18:36 +00:00
|
|
|
|
2006-03-13 15:29:49 +00:00
|
|
|
static void cleanSubMesh( SMESH_subMesh * subMesh )
|
2005-12-20 11:10:13 +00:00
|
|
|
{
|
2006-03-13 15:29:49 +00:00
|
|
|
if (subMesh) {
|
|
|
|
if (SMESHDS_SubMesh * subMeshDS = subMesh->GetSubMeshDS()) {
|
|
|
|
SMESHDS_Mesh * meshDS = subMesh->GetFather()->GetMeshDS();
|
|
|
|
SMDS_ElemIteratorPtr ite = subMeshDS->GetElements();
|
|
|
|
while (ite->more()) {
|
|
|
|
const SMDS_MeshElement * elt = ite->next();
|
|
|
|
//MESSAGE( " RM elt: "<<elt->GetID()<<" ( "<<elt->NbNodes()<<" )" );
|
|
|
|
//meshDS->RemoveElement(elt);
|
|
|
|
meshDS->RemoveFreeElement(elt, subMeshDS);
|
|
|
|
}
|
2005-12-20 11:10:13 +00:00
|
|
|
|
2006-03-13 15:29:49 +00:00
|
|
|
SMDS_NodeIteratorPtr itn = subMeshDS->GetNodes();
|
|
|
|
while (itn->more()) {
|
|
|
|
const SMDS_MeshNode * node = itn->next();
|
|
|
|
//MESSAGE( " RM node: "<<node->GetID());
|
|
|
|
//meshDS->RemoveNode(node);
|
|
|
|
meshDS->RemoveFreeNode(node, subMeshDS);
|
|
|
|
}
|
2005-12-20 11:10:13 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
/*!
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
bool SMESH_subMesh::ComputeStateEngine(int event)
|
2003-05-19 13:18:36 +00:00
|
|
|
{
|
2004-06-18 08:55:35 +00:00
|
|
|
//MESSAGE("SMESH_subMesh::ComputeStateEngine");
|
|
|
|
//SCRUTE(_computeState);
|
|
|
|
//SCRUTE(event);
|
|
|
|
|
|
|
|
int dim = SMESH_Gen::GetShapeDim(_subShape);
|
|
|
|
|
|
|
|
if (dim < 1)
|
|
|
|
{
|
2004-12-01 10:48:31 +00:00
|
|
|
if ( IsMeshComputed() )
|
2004-06-18 08:55:35 +00:00
|
|
|
_computeState = COMPUTE_OK;
|
|
|
|
else
|
|
|
|
_computeState = READY_TO_COMPUTE;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
SMESH_Gen *gen = _father->GetGen();
|
|
|
|
SMESH_Algo *algo = 0;
|
2004-12-01 10:48:31 +00:00
|
|
|
bool ret = true;
|
2004-06-18 08:55:35 +00:00
|
|
|
SMESH_Hypothesis::Hypothesis_Status hyp_status;
|
2006-12-06 15:53:25 +00:00
|
|
|
algo_state oldAlgoState = (algo_state) GetAlgoState();
|
2004-06-18 08:55:35 +00:00
|
|
|
|
|
|
|
switch (_computeState)
|
|
|
|
{
|
|
|
|
|
|
|
|
// ----------------------------------------------------------------------
|
|
|
|
|
|
|
|
case NOT_READY:
|
|
|
|
switch (event)
|
|
|
|
{
|
2006-05-06 08:51:48 +00:00
|
|
|
case MODIF_HYP:
|
2004-06-18 08:55:35 +00:00
|
|
|
case MODIF_ALGO_STATE:
|
2006-05-06 08:51:48 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
|
|
|
if (algo && !algo->NeedDescretBoundary())
|
|
|
|
CleanDependsOn(); // clean sub-meshes with event CLEAN
|
2006-12-06 15:53:25 +00:00
|
|
|
if (algo)
|
2004-06-18 08:55:35 +00:00
|
|
|
{
|
2006-12-06 15:53:25 +00:00
|
|
|
ret = algo->CheckHypothesis((*_father), _subShape, hyp_status);
|
|
|
|
if (ret)
|
|
|
|
_computeState = READY_TO_COMPUTE;
|
2004-06-18 08:55:35 +00:00
|
|
|
}
|
2006-12-06 15:53:25 +00:00
|
|
|
if ( _computeState == READY_TO_COMPUTE )
|
|
|
|
SetAlgoState(HYP_OK);
|
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
2004-06-18 08:55:35 +00:00
|
|
|
break;
|
2006-03-13 15:29:49 +00:00
|
|
|
case COMPUTE: // nothing to do
|
2004-06-18 08:55:35 +00:00
|
|
|
break;
|
|
|
|
case CLEAN:
|
|
|
|
CleanDependants();
|
2006-03-13 15:29:49 +00:00
|
|
|
RemoveSubMeshElementsAndNodes();
|
2004-06-18 08:55:35 +00:00
|
|
|
break;
|
|
|
|
case SUBMESH_COMPUTED: // nothing to do
|
|
|
|
break;
|
|
|
|
case SUBMESH_RESTORED:
|
2004-12-01 10:48:31 +00:00
|
|
|
ComputeSubMeshStateEngine( CHECK_COMPUTE_STATE );
|
|
|
|
break;
|
|
|
|
case MESH_ENTITY_REMOVED:
|
|
|
|
break;
|
|
|
|
case CHECK_COMPUTE_STATE:
|
|
|
|
if ( IsMeshComputed() )
|
|
|
|
_computeState = COMPUTE_OK;
|
2004-06-18 08:55:35 +00:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
ASSERT(0);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
// ----------------------------------------------------------------------
|
|
|
|
|
|
|
|
case READY_TO_COMPUTE:
|
|
|
|
switch (event)
|
|
|
|
{
|
2006-05-06 08:51:48 +00:00
|
|
|
case MODIF_HYP:
|
2004-06-18 08:55:35 +00:00
|
|
|
case MODIF_ALGO_STATE:
|
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
2006-05-06 08:51:48 +00:00
|
|
|
if (algo && !algo->NeedDescretBoundary())
|
|
|
|
CleanDependsOn(); // clean sub-meshes with event CLEAN
|
|
|
|
_computeState = NOT_READY;
|
2004-06-18 08:55:35 +00:00
|
|
|
if (algo)
|
|
|
|
{
|
|
|
|
ret = algo->CheckHypothesis((*_father), _subShape, hyp_status);
|
2006-12-06 15:53:25 +00:00
|
|
|
if (ret) {
|
|
|
|
SetAlgoState(HYP_OK); // it might be KO if BAD_PARAM_VALUE
|
2004-06-18 08:55:35 +00:00
|
|
|
_computeState = READY_TO_COMPUTE;
|
2006-12-06 15:53:25 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
2004-06-18 08:55:35 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
case COMPUTE:
|
|
|
|
{
|
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
|
|
|
ASSERT(algo);
|
|
|
|
ret = algo->CheckHypothesis((*_father), _subShape, hyp_status);
|
|
|
|
if (!ret)
|
|
|
|
{
|
|
|
|
MESSAGE("***** verify compute state *****");
|
|
|
|
_computeState = NOT_READY;
|
2006-12-06 15:53:25 +00:00
|
|
|
SetAlgoState(MISSING_HYP);
|
2004-06-18 08:55:35 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
// check submeshes needed
|
|
|
|
if (algo->NeedDescretBoundary())
|
|
|
|
ret = SubMeshesComputed();
|
|
|
|
if (!ret)
|
|
|
|
{
|
|
|
|
MESSAGE("Some SubMeshes not computed");
|
|
|
|
_computeState = FAILED_TO_COMPUTE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// compute
|
2005-12-20 13:57:13 +00:00
|
|
|
CleanDependants();
|
2006-03-13 15:29:49 +00:00
|
|
|
RemoveSubMeshElementsAndNodes();
|
2006-05-06 08:51:48 +00:00
|
|
|
{
|
|
|
|
try {
|
2006-09-04 11:39:20 +00:00
|
|
|
#if (OCC_VERSION_MAJOR << 16 | OCC_VERSION_MINOR << 8 | OCC_VERSION_MAINTENANCE) > 0x060100
|
|
|
|
OCC_CATCH_SIGNALS;
|
|
|
|
#endif
|
2006-05-06 08:51:48 +00:00
|
|
|
if (!algo->NeedDescretBoundary() && !algo->OnlyUnaryInput())
|
|
|
|
ret = ApplyToCollection( algo, GetCollection( gen, algo ) );
|
|
|
|
else
|
|
|
|
ret = algo->Compute((*_father), _subShape);
|
|
|
|
}
|
|
|
|
catch (Standard_Failure) {
|
|
|
|
MESSAGE( "Exception in algo->Compute() ");
|
|
|
|
ret = false;
|
|
|
|
}
|
|
|
|
}
|
2004-06-18 08:55:35 +00:00
|
|
|
if (!ret)
|
|
|
|
{
|
|
|
|
MESSAGE("problem in algo execution: failed to compute");
|
2006-12-06 15:53:25 +00:00
|
|
|
// release ALGO from responsibilty of partially built mesh
|
|
|
|
RemoveSubMeshElementsAndNodes();
|
2004-06-18 08:55:35 +00:00
|
|
|
_computeState = FAILED_TO_COMPUTE;
|
|
|
|
if (!algo->NeedDescretBoundary())
|
|
|
|
UpdateSubMeshState( FAILED_TO_COMPUTE );
|
2004-12-01 10:48:31 +00:00
|
|
|
|
|
|
|
#ifdef _DEBUG_
|
|
|
|
// Show vertices location of a failed shape
|
2006-05-06 08:51:48 +00:00
|
|
|
cout << algo->GetName() << " failed on shape with the following vertices:" << endl;
|
2005-12-20 11:10:13 +00:00
|
|
|
TopTools_IndexedMapOfShape vMap;
|
|
|
|
TopExp::MapShapes( _subShape, TopAbs_VERTEX, vMap );
|
|
|
|
for ( int iv = 1; iv <= vMap.Extent(); ++iv ) {
|
|
|
|
gp_Pnt P( BRep_Tool::Pnt( TopoDS::Vertex( vMap( iv ) )));
|
2004-12-01 10:48:31 +00:00
|
|
|
cout << P.X() << " " << P.Y() << " " << P.Z() << " " << endl;
|
|
|
|
}
|
|
|
|
#endif
|
2004-06-18 08:55:35 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
_computeState = COMPUTE_OK;
|
|
|
|
UpdateDependantsState( SUBMESH_COMPUTED ); // send event SUBMESH_COMPUTED
|
|
|
|
if (!algo->NeedDescretBoundary())
|
|
|
|
UpdateSubMeshState( COMPUTE_OK );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case CLEAN:
|
2006-03-13 15:29:49 +00:00
|
|
|
CleanDependants();
|
2004-06-18 08:55:35 +00:00
|
|
|
RemoveSubMeshElementsAndNodes();
|
|
|
|
_computeState = NOT_READY;
|
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
|
|
|
if (algo)
|
|
|
|
{
|
|
|
|
ret = algo->CheckHypothesis((*_father), _subShape, hyp_status);
|
|
|
|
if (ret)
|
|
|
|
_computeState = READY_TO_COMPUTE;
|
2006-12-06 15:53:25 +00:00
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
2004-06-18 08:55:35 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
case SUBMESH_COMPUTED: // nothing to do
|
|
|
|
break;
|
|
|
|
case SUBMESH_RESTORED:
|
|
|
|
// check if a mesh is already computed that may
|
|
|
|
// happen after retrieval from a file
|
2004-12-01 10:48:31 +00:00
|
|
|
ComputeStateEngine( CHECK_COMPUTE_STATE );
|
|
|
|
ComputeSubMeshStateEngine( CHECK_COMPUTE_STATE );
|
|
|
|
break;
|
|
|
|
case MESH_ENTITY_REMOVED:
|
|
|
|
break;
|
|
|
|
case CHECK_COMPUTE_STATE:
|
|
|
|
if ( IsMeshComputed() )
|
2004-06-18 08:55:35 +00:00
|
|
|
_computeState = COMPUTE_OK;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
ASSERT(0);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
// ----------------------------------------------------------------------
|
|
|
|
|
|
|
|
case COMPUTE_OK:
|
|
|
|
switch (event)
|
|
|
|
{
|
|
|
|
case MODIF_HYP:
|
|
|
|
case MODIF_ALGO_STATE:
|
2006-03-13 15:29:49 +00:00
|
|
|
ComputeStateEngine( CLEAN );
|
2004-06-18 08:55:35 +00:00
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
|
|
|
if (algo && !algo->NeedDescretBoundary())
|
2006-03-13 15:29:49 +00:00
|
|
|
CleanDependsOn(); // clean sub-meshes with event CLEAN
|
2004-06-18 08:55:35 +00:00
|
|
|
break;
|
2006-03-13 15:29:49 +00:00
|
|
|
case COMPUTE: // nothing to do
|
2004-06-18 08:55:35 +00:00
|
|
|
break;
|
|
|
|
case CLEAN:
|
2006-03-13 15:29:49 +00:00
|
|
|
CleanDependants(); // clean sub-meshes, dependant on this one, with event CLEAN
|
2004-06-18 08:55:35 +00:00
|
|
|
RemoveSubMeshElementsAndNodes();
|
|
|
|
_computeState = NOT_READY;
|
|
|
|
algo = gen->GetAlgo((*_father), _subShape);
|
|
|
|
if (algo)
|
|
|
|
{
|
|
|
|
ret = algo->CheckHypothesis((*_father), _subShape, hyp_status);
|
|
|
|
if (ret)
|
|
|
|
_computeState = READY_TO_COMPUTE;
|
2006-12-06 15:53:25 +00:00
|
|
|
else
|
|
|
|
SetAlgoState(MISSING_HYP);
|
2004-06-18 08:55:35 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
case SUBMESH_COMPUTED: // nothing to do
|
|
|
|
break;
|
|
|
|
case SUBMESH_RESTORED:
|
2004-12-01 10:48:31 +00:00
|
|
|
ComputeStateEngine( CHECK_COMPUTE_STATE );
|
|
|
|
ComputeSubMeshStateEngine( CHECK_COMPUTE_STATE );
|
|
|
|
break;
|
|
|
|
case MESH_ENTITY_REMOVED:
|
|
|
|
UpdateDependantsState( CHECK_COMPUTE_STATE );
|
|
|
|
ComputeStateEngine( CHECK_COMPUTE_STATE );
|
|
|
|
ComputeSubMeshStateEngine( CHECK_COMPUTE_STATE );
|
|
|
|
break;
|
|
|
|
case CHECK_COMPUTE_STATE:
|
|
|
|
if ( !IsMeshComputed() )
|
|
|
|
if (_algoState == HYP_OK)
|
|
|
|
_computeState = READY_TO_COMPUTE;
|
|
|
|
else
|
|
|
|
_computeState = NOT_READY;
|
2004-06-18 08:55:35 +00:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
ASSERT(0);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
// ----------------------------------------------------------------------
|
|
|
|
|
|
|
|
case FAILED_TO_COMPUTE:
|
|
|
|
switch (event)
|
|
|
|
{
|
|
|
|
case MODIF_HYP:
|
|
|
|
if (_algoState == HYP_OK)
|
|
|
|
_computeState = READY_TO_COMPUTE;
|
|
|
|
else
|
|
|
|
_computeState = NOT_READY;
|
|
|
|
break;
|
|
|
|
case MODIF_ALGO_STATE:
|
|
|
|
if (_algoState == HYP_OK)
|
|
|
|
_computeState = READY_TO_COMPUTE;
|
|
|
|
else
|
|
|
|
_computeState = NOT_READY;
|
|
|
|
break;
|
2004-12-01 10:48:31 +00:00
|
|
|
case COMPUTE: // nothing to do
|
2004-06-18 08:55:35 +00:00
|
|
|
break;
|
|
|
|
case CLEAN:
|
2006-03-13 15:29:49 +00:00
|
|
|
CleanDependants(); // submeshes dependent on me should be cleaned as well
|
2004-06-18 08:55:35 +00:00
|
|
|
RemoveSubMeshElementsAndNodes();
|
|
|
|
if (_algoState == HYP_OK)
|
|
|
|
_computeState = READY_TO_COMPUTE;
|
|
|
|
else
|
|
|
|
_computeState = NOT_READY;
|
|
|
|
break;
|
|
|
|
case SUBMESH_COMPUTED: // allow retry compute
|
|
|
|
if (_algoState == HYP_OK)
|
|
|
|
_computeState = READY_TO_COMPUTE;
|
|
|
|
else
|
|
|
|
_computeState = NOT_READY;
|
|
|
|
break;
|
|
|
|
case SUBMESH_RESTORED:
|
2004-12-01 10:48:31 +00:00
|
|
|
ComputeSubMeshStateEngine( CHECK_COMPUTE_STATE );
|
|
|
|
break;
|
|
|
|
case MESH_ENTITY_REMOVED:
|
|
|
|
break;
|
|
|
|
case CHECK_COMPUTE_STATE:
|
|
|
|
if ( IsMeshComputed() )
|
|
|
|
_computeState = COMPUTE_OK;
|
|
|
|
else
|
|
|
|
if (_algoState == HYP_OK)
|
|
|
|
_computeState = READY_TO_COMPUTE;
|
|
|
|
else
|
|
|
|
_computeState = NOT_READY;
|
2004-06-18 08:55:35 +00:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
ASSERT(0);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
// ----------------------------------------------------------------------
|
|
|
|
default:
|
|
|
|
ASSERT(0);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2006-12-07 08:29:52 +00:00
|
|
|
if ( _algoState != oldAlgoState || event == MODIF_HYP )
|
2006-12-06 15:53:25 +00:00
|
|
|
{
|
|
|
|
if ( oldAlgoState == HYP_OK )
|
|
|
|
DeleteOwnListeners();
|
2006-12-07 08:29:52 +00:00
|
|
|
if (_algoState == HYP_OK && algo )
|
|
|
|
algo->SetEventListener( this );
|
2006-12-06 15:53:25 +00:00
|
|
|
}
|
|
|
|
NotifyListenersOnEvent( event, COMPUTE_EVENT );
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
//SCRUTE(_computeState);
|
|
|
|
return ret;
|
|
|
|
}
|
2003-09-04 09:21:41 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
//=======================================================================
|
|
|
|
//function : ApplyToCollection
|
|
|
|
//purpose : Apply theAlgo to all subshapes in theCollection
|
|
|
|
//=======================================================================
|
2003-05-19 13:18:36 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
bool SMESH_subMesh::ApplyToCollection (SMESH_Algo* theAlgo,
|
|
|
|
const TopoDS_Shape& theCollection)
|
|
|
|
{
|
|
|
|
MESSAGE("SMESH_subMesh::ApplyToCollection");
|
|
|
|
ASSERT ( !theAlgo->NeedDescretBoundary() );
|
|
|
|
|
|
|
|
bool ret = false;
|
|
|
|
|
|
|
|
|
|
|
|
ret = theAlgo->Compute( *_father, theCollection );
|
|
|
|
|
|
|
|
// set _computeState of subshapes
|
|
|
|
TopExp_Explorer anExplorer( theCollection, _subShape.ShapeType() );
|
|
|
|
for ( ; anExplorer.More(); anExplorer.Next() )
|
|
|
|
{
|
|
|
|
const TopoDS_Shape& aSubShape = anExplorer.Current();
|
|
|
|
SMESH_subMesh* subMesh = _father->GetSubMeshContaining( aSubShape );
|
|
|
|
if ( subMesh )
|
|
|
|
{
|
|
|
|
if (ret)
|
|
|
|
{
|
|
|
|
subMesh->_computeState = COMPUTE_OK;
|
|
|
|
subMesh->UpdateDependantsState( SUBMESH_COMPUTED );
|
|
|
|
subMesh->UpdateSubMeshState( COMPUTE_OK );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
subMesh->_computeState = FAILED_TO_COMPUTE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
2003-09-04 09:21:41 +00:00
|
|
|
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
//=======================================================================
|
|
|
|
//function : UpdateSubMeshState
|
2004-12-01 10:48:31 +00:00
|
|
|
//purpose :
|
2004-06-18 08:55:35 +00:00
|
|
|
//=======================================================================
|
2003-09-04 09:21:41 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
void SMESH_subMesh::UpdateSubMeshState(const compute_state theState)
|
|
|
|
{
|
|
|
|
const map<int, SMESH_subMesh*>& smMap = DependsOn();
|
|
|
|
map<int, SMESH_subMesh*>::const_iterator itsub;
|
|
|
|
for (itsub = smMap.begin(); itsub != smMap.end(); itsub++)
|
|
|
|
{
|
|
|
|
SMESH_subMesh* sm = (*itsub).second;
|
|
|
|
sm->_computeState = theState;
|
|
|
|
}
|
|
|
|
}
|
2003-05-19 13:18:36 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
//=======================================================================
|
|
|
|
//function : ComputeSubMeshStateEngine
|
2004-12-01 10:48:31 +00:00
|
|
|
//purpose :
|
2004-06-18 08:55:35 +00:00
|
|
|
//=======================================================================
|
2003-05-19 13:18:36 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
void SMESH_subMesh::ComputeSubMeshStateEngine(int event)
|
|
|
|
{
|
|
|
|
const map<int, SMESH_subMesh*>& smMap = DependsOn();
|
|
|
|
map<int, SMESH_subMesh*>::const_iterator itsub;
|
|
|
|
for (itsub = smMap.begin(); itsub != smMap.end(); itsub++)
|
|
|
|
{
|
|
|
|
SMESH_subMesh* sm = (*itsub).second;
|
|
|
|
sm->ComputeStateEngine(event);
|
|
|
|
}
|
|
|
|
}
|
2003-09-04 09:21:41 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
//=======================================================================
|
|
|
|
//function : UpdateDependantsState
|
2004-12-01 10:48:31 +00:00
|
|
|
//purpose :
|
2004-06-18 08:55:35 +00:00
|
|
|
//=======================================================================
|
2003-05-19 13:18:36 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
void SMESH_subMesh::UpdateDependantsState(const compute_event theEvent)
|
|
|
|
{
|
|
|
|
//MESSAGE("SMESH_subMesh::UpdateDependantsState");
|
|
|
|
TopTools_ListIteratorOfListOfShape it( _father->GetAncestors( _subShape ));
|
|
|
|
for (; it.More(); it.Next())
|
|
|
|
{
|
|
|
|
const TopoDS_Shape& ancestor = it.Value();
|
|
|
|
SMESH_subMesh *aSubMesh =
|
|
|
|
_father->GetSubMeshContaining(ancestor);
|
|
|
|
if (aSubMesh)
|
|
|
|
aSubMesh->ComputeStateEngine( theEvent );
|
|
|
|
}
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
/*!
|
2004-12-01 10:48:31 +00:00
|
|
|
*
|
2003-05-19 13:18:36 +00:00
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
void SMESH_subMesh::CleanDependants()
|
2003-05-19 13:18:36 +00:00
|
|
|
{
|
2006-03-13 15:29:49 +00:00
|
|
|
int dimToClean = SMESH_Gen::GetShapeDim( _subShape ) + 1;
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
TopTools_ListIteratorOfListOfShape it( _father->GetAncestors( _subShape ));
|
|
|
|
for (; it.More(); it.Next())
|
|
|
|
{
|
|
|
|
const TopoDS_Shape& ancestor = it.Value();
|
2006-03-13 15:29:49 +00:00
|
|
|
if ( SMESH_Gen::GetShapeDim( ancestor ) == dimToClean ) {
|
|
|
|
// PAL8021. do not go upper than SOLID, else ComputeStateEngine(CLEAN)
|
|
|
|
// will erase mesh on other shapes in a compound
|
|
|
|
if ( ancestor.ShapeType() >= TopAbs_SOLID ) {
|
|
|
|
SMESH_subMesh *aSubMesh = _father->GetSubMeshContaining(ancestor);
|
|
|
|
if (aSubMesh)
|
|
|
|
aSubMesh->ComputeStateEngine(CLEAN);
|
|
|
|
}
|
2004-06-18 08:55:35 +00:00
|
|
|
}
|
|
|
|
}
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
2003-09-04 09:21:41 +00:00
|
|
|
|
2003-05-19 13:18:36 +00:00
|
|
|
//=============================================================================
|
|
|
|
/*!
|
2004-12-01 10:48:31 +00:00
|
|
|
*
|
2003-05-19 13:18:36 +00:00
|
|
|
*/
|
|
|
|
//=============================================================================
|
|
|
|
|
|
|
|
void SMESH_subMesh::RemoveSubMeshElementsAndNodes()
|
|
|
|
{
|
2005-01-21 14:03:54 +00:00
|
|
|
//SCRUTE(_subShape.ShapeType());
|
2004-06-18 08:55:35 +00:00
|
|
|
|
2006-03-13 15:29:49 +00:00
|
|
|
cleanSubMesh( this );
|
2004-06-18 08:55:35 +00:00
|
|
|
|
|
|
|
// algo may bind a submesh not to _subShape, eg 3D algo
|
|
|
|
// sets nodes on SHELL while _subShape may be SOLID
|
|
|
|
|
|
|
|
int dim = SMESH_Gen::GetShapeDim( _subShape );
|
|
|
|
int type = _subShape.ShapeType() + 1;
|
2006-03-13 15:29:49 +00:00
|
|
|
for ( ; type <= TopAbs_EDGE; type++) {
|
2004-06-18 08:55:35 +00:00
|
|
|
if ( dim == SMESH_Gen::GetShapeDim( (TopAbs_ShapeEnum) type ))
|
|
|
|
{
|
|
|
|
TopExp_Explorer exp( _subShape, (TopAbs_ShapeEnum) type );
|
|
|
|
for ( ; exp.More(); exp.Next() )
|
2006-03-13 15:29:49 +00:00
|
|
|
cleanSubMesh( _father->GetSubMeshContaining( exp.Current() ));
|
2004-06-18 08:55:35 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
break;
|
2006-03-13 15:29:49 +00:00
|
|
|
}
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
//=======================================================================
|
|
|
|
//function : IsMeshComputed
|
|
|
|
//purpose : check if _subMeshDS contains mesh elements
|
|
|
|
//=======================================================================
|
2003-05-19 13:18:36 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
bool SMESH_subMesh::IsMeshComputed() const
|
2003-05-19 13:18:36 +00:00
|
|
|
{
|
2004-06-18 08:55:35 +00:00
|
|
|
// algo may bind a submesh not to _subShape, eg 3D algo
|
|
|
|
// sets nodes on SHELL while _subShape may be SOLID
|
|
|
|
|
|
|
|
int dim = SMESH_Gen::GetShapeDim( _subShape );
|
|
|
|
int type = _subShape.ShapeType();
|
|
|
|
for ( ; type <= TopAbs_VERTEX; type++) {
|
|
|
|
if ( dim == SMESH_Gen::GetShapeDim( (TopAbs_ShapeEnum) type ))
|
|
|
|
{
|
|
|
|
TopExp_Explorer exp( _subShape, (TopAbs_ShapeEnum) type );
|
|
|
|
for ( ; exp.More(); exp.Next() )
|
|
|
|
{
|
2006-12-06 15:53:25 +00:00
|
|
|
SMESHDS_SubMesh * smDS = _meshDS->MeshElements( exp.Current() );
|
|
|
|
if ( smDS && ( smDS->NbElements() || smDS->NbNodes()))
|
2004-06-18 08:55:35 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
2003-09-04 09:21:41 +00:00
|
|
|
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
//=======================================================================
|
|
|
|
//function : GetCollection
|
|
|
|
//purpose : return a shape containing all sub-shapes of the MainShape that can be
|
|
|
|
// meshed at once along with _subShape
|
|
|
|
//=======================================================================
|
2003-09-04 09:21:41 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
TopoDS_Shape SMESH_subMesh::GetCollection(SMESH_Gen * theGen, SMESH_Algo* theAlgo)
|
|
|
|
{
|
|
|
|
MESSAGE("SMESH_subMesh::GetCollection");
|
|
|
|
ASSERT (!theAlgo->NeedDescretBoundary());
|
2004-12-01 10:48:31 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
TopoDS_Shape mainShape = _father->GetMeshDS()->ShapeToMesh();
|
|
|
|
|
|
|
|
if ( mainShape.IsSame( _subShape ))
|
|
|
|
return _subShape;
|
|
|
|
|
2006-03-13 15:29:49 +00:00
|
|
|
const bool ignoreAuxiliaryHyps = false;
|
2004-06-18 08:55:35 +00:00
|
|
|
list<const SMESHDS_Hypothesis*> aUsedHyp =
|
2006-03-13 15:29:49 +00:00
|
|
|
theAlgo->GetUsedHypothesis( *_father, _subShape, ignoreAuxiliaryHyps ); // copy
|
2004-12-01 10:48:31 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
// put in a compound all shapes with the same hypothesis assigned
|
|
|
|
// and a good ComputState
|
|
|
|
|
|
|
|
TopoDS_Compound aCompound;
|
|
|
|
BRep_Builder aBuilder;
|
|
|
|
aBuilder.MakeCompound( aCompound );
|
|
|
|
|
|
|
|
TopExp_Explorer anExplorer( mainShape, _subShape.ShapeType() );
|
|
|
|
for ( ; anExplorer.More(); anExplorer.Next() )
|
|
|
|
{
|
|
|
|
const TopoDS_Shape& S = anExplorer.Current();
|
|
|
|
SMESH_subMesh* subMesh = _father->GetSubMesh( S );
|
|
|
|
SMESH_Algo* anAlgo = theGen->GetAlgo( *_father, S );
|
|
|
|
|
|
|
|
if (subMesh->GetComputeState() == READY_TO_COMPUTE &&
|
|
|
|
anAlgo == theAlgo &&
|
2006-03-13 15:29:49 +00:00
|
|
|
anAlgo->GetUsedHypothesis( *_father, S, ignoreAuxiliaryHyps ) == aUsedHyp)
|
2004-06-18 08:55:35 +00:00
|
|
|
{
|
|
|
|
aBuilder.Add( aCompound, S );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return aCompound;
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
//=======================================================================
|
2004-12-01 10:48:31 +00:00
|
|
|
//function : GetSimilarAttached
|
2006-03-13 15:29:49 +00:00
|
|
|
//purpose : return a hypothesis attached to theShape.
|
2004-06-18 08:55:35 +00:00
|
|
|
// If theHyp is provided, similar but not same hypotheses
|
2006-03-13 15:29:49 +00:00
|
|
|
// is returned; else only applicable ones having theHypType
|
|
|
|
// is returned
|
2004-06-18 08:55:35 +00:00
|
|
|
//=======================================================================
|
|
|
|
|
2004-12-01 10:48:31 +00:00
|
|
|
const SMESH_Hypothesis* SMESH_subMesh::GetSimilarAttached(const TopoDS_Shape& theShape,
|
|
|
|
const SMESH_Hypothesis * theHyp,
|
|
|
|
const int theHypType)
|
2003-05-19 13:18:36 +00:00
|
|
|
{
|
2006-03-13 15:29:49 +00:00
|
|
|
SMESH_HypoFilter hypoKind;
|
|
|
|
hypoKind.Init( hypoKind.HasType( theHyp ? theHyp->GetType() : theHypType ));
|
2005-02-04 10:39:49 +00:00
|
|
|
if ( theHyp ) {
|
2006-03-13 15:29:49 +00:00
|
|
|
hypoKind.And ( hypoKind.HasDim( theHyp->GetDim() ));
|
|
|
|
hypoKind.AndNot( hypoKind.Is( theHyp ));
|
|
|
|
if ( theHyp->IsAuxiliary() )
|
|
|
|
hypoKind.And( hypoKind.HasName( theHyp->GetName() ));
|
|
|
|
else
|
|
|
|
hypoKind.AndNot( hypoKind.IsAuxiliary());
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
hypoKind.And( hypoKind.IsApplicableTo( theShape ));
|
2004-06-18 08:55:35 +00:00
|
|
|
}
|
|
|
|
|
2006-03-13 15:29:49 +00:00
|
|
|
return _father->GetHypothesis( theShape, hypoKind, false );
|
2004-06-18 08:55:35 +00:00
|
|
|
}
|
2003-09-04 09:21:41 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
//=======================================================================
|
|
|
|
//function : CheckConcurentHypothesis
|
2004-12-01 10:48:31 +00:00
|
|
|
//purpose : check if there are several applicable hypothesis attached to
|
|
|
|
// ansestors
|
2004-06-18 08:55:35 +00:00
|
|
|
//=======================================================================
|
2003-09-04 09:21:41 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
SMESH_Hypothesis::Hypothesis_Status
|
|
|
|
SMESH_subMesh::CheckConcurentHypothesis (const int theHypType)
|
|
|
|
{
|
|
|
|
MESSAGE ("SMESH_subMesh::CheckConcurentHypothesis");
|
|
|
|
|
|
|
|
// is there local hypothesis on me?
|
2004-12-01 10:48:31 +00:00
|
|
|
if ( GetSimilarAttached( _subShape, 0, theHypType ) )
|
2004-06-18 08:55:35 +00:00
|
|
|
return SMESH_Hypothesis::HYP_OK;
|
|
|
|
|
2004-12-01 10:48:31 +00:00
|
|
|
|
2004-06-18 08:55:35 +00:00
|
|
|
TopoDS_Shape aPrevWithHyp;
|
2004-12-01 10:48:31 +00:00
|
|
|
const SMESH_Hypothesis* aPrevHyp = 0;
|
2004-06-18 08:55:35 +00:00
|
|
|
TopTools_ListIteratorOfListOfShape it( _father->GetAncestors( _subShape ));
|
|
|
|
for (; it.More(); it.Next())
|
|
|
|
{
|
|
|
|
const TopoDS_Shape& ancestor = it.Value();
|
2004-12-01 10:48:31 +00:00
|
|
|
const SMESH_Hypothesis* hyp = GetSimilarAttached( ancestor, 0, theHypType );
|
|
|
|
if ( hyp )
|
2004-06-18 08:55:35 +00:00
|
|
|
{
|
|
|
|
if ( aPrevWithHyp.IsNull() || aPrevWithHyp.IsSame( ancestor ))
|
2004-12-01 10:48:31 +00:00
|
|
|
{
|
2004-06-18 08:55:35 +00:00
|
|
|
aPrevWithHyp = ancestor;
|
2004-12-01 10:48:31 +00:00
|
|
|
aPrevHyp = hyp;
|
|
|
|
}
|
|
|
|
else if ( aPrevWithHyp.ShapeType() == ancestor.ShapeType() && aPrevHyp != hyp )
|
2004-06-18 08:55:35 +00:00
|
|
|
return SMESH_Hypothesis::HYP_CONCURENT;
|
|
|
|
else
|
|
|
|
return SMESH_Hypothesis::HYP_OK;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return SMESH_Hypothesis::HYP_OK;
|
2003-05-19 13:18:36 +00:00
|
|
|
}
|
2006-12-06 15:53:25 +00:00
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \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
|
|
|
|
* \param deleteListener - if true then the listener will be deleted as
|
|
|
|
* it is removed from where submesh
|
|
|
|
*
|
|
|
|
* It remembers the submesh where it puts the listener in order to delete
|
|
|
|
* them when HYP_OK algo_state is lost
|
|
|
|
* After being set, event listener is notified on each event of where submesh.
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
void SMESH_subMesh::SetEventListener(EventListener* listener,
|
|
|
|
EventListenerData* data,
|
|
|
|
SMESH_subMesh* where)
|
|
|
|
{
|
|
|
|
if ( listener && where ) {
|
|
|
|
where->SetEventListener( listener, data );
|
|
|
|
myOwnListeners.push_back( make_pair( where, listener ));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \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.
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
void SMESH_subMesh::SetEventListener(EventListener* listener, EventListenerData* data)
|
|
|
|
{
|
|
|
|
myEventListeners.insert( make_pair( listener, data ));
|
|
|
|
}
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \brief Return an event listener data
|
|
|
|
* \param listener - the listener whose data is
|
|
|
|
* \retval EventListenerData* - found data, maybe NULL
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
EventListenerData* SMESH_subMesh::GetEventListenerData(EventListener* listener) const
|
|
|
|
{
|
|
|
|
map< EventListener*, EventListenerData* >::const_iterator l_d =
|
|
|
|
myEventListeners.find( listener );
|
|
|
|
if ( l_d != myEventListeners.end() )
|
|
|
|
return l_d->second;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \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 subMesh - the submesh where the event occures
|
|
|
|
* \param data - listener data stored in the subMesh
|
|
|
|
* \param hyp - hypothesis, if eventType is algo_event
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
void SMESH_subMesh::NotifyListenersOnEvent( const int event,
|
|
|
|
const event_type eventType,
|
|
|
|
SMESH_Hypothesis* hyp)
|
|
|
|
{
|
|
|
|
map< EventListener*, EventListenerData* >::iterator l_d = myEventListeners.begin();
|
|
|
|
for ( ; l_d != myEventListeners.end(); ++l_d )
|
|
|
|
l_d->first->ProcessEvent( event, eventType, this, l_d->second, hyp );
|
|
|
|
}
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \brief Unregister the listener and delete listener's data
|
|
|
|
* \param listener - the event listener
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
void SMESH_subMesh::DeleteEventListener(EventListener* listener)
|
|
|
|
{
|
|
|
|
map< EventListener*, EventListenerData* >::iterator l_d =
|
|
|
|
myEventListeners.find( listener );
|
|
|
|
if ( l_d != myEventListeners.end() ) {
|
2006-12-07 08:29:52 +00:00
|
|
|
if ( l_d->first->IsDeletable() ) delete l_d->first;
|
|
|
|
if ( l_d->second->IsDeletable() ) delete l_d->second;
|
2006-12-06 15:53:25 +00:00
|
|
|
myEventListeners.erase( l_d );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \brief Delete event listeners depending on algo of this submesh
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
void SMESH_subMesh::DeleteOwnListeners()
|
|
|
|
{
|
|
|
|
list< pair< SMESH_subMesh*, EventListener* > >::iterator sm_l;
|
|
|
|
for ( sm_l = myOwnListeners.begin(); sm_l != myOwnListeners.end(); ++sm_l)
|
|
|
|
sm_l->first->DeleteEventListener( sm_l->second );
|
|
|
|
myOwnListeners.clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \brief Do something on a certain event
|
|
|
|
* \param event - algo_event or compute_event itself
|
|
|
|
* \param eventType - algo_event or compute_event
|
|
|
|
* \param subMesh - the submesh where the event occures
|
|
|
|
* \param data - listener data stored in the subMesh
|
|
|
|
* \param hyp - hypothesis, if eventType is algo_event
|
|
|
|
*
|
|
|
|
* The base implementation translates CLEAN event to the subMesh
|
|
|
|
* stored in listener data
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
void SMESH_subMeshEventListener::ProcessEvent(const int event,
|
|
|
|
const int eventType,
|
|
|
|
SMESH_subMesh* subMesh,
|
|
|
|
EventListenerData* data,
|
|
|
|
SMESH_Hypothesis* /*hyp*/)
|
|
|
|
{
|
|
|
|
if ( event == SMESH_subMesh::CLEAN && eventType == SMESH_subMesh::COMPUTE_EVENT )
|
|
|
|
if ( data && !data->mySubMeshes.empty() ) {
|
|
|
|
ASSERT( data->mySubMeshes.front() != subMesh );
|
|
|
|
data->mySubMeshes.front()->ComputeStateEngine( event );
|
|
|
|
}
|
|
|
|
}
|