1 // SMESH SMESH : implementaion of SMESH idl descriptions
3 // Copyright (C) 2003 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.
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.opencascade.org/SALOME/ or email : webmaster.salome@opencascade.org
24 // File : SMESH_HypoFilter.cxx
28 #include "SMESH_HypoFilter.hxx"
30 #include "SMESH_Hypothesis.hxx"
31 #include "SMESH_subMesh.hxx"
36 //=======================================================================
37 //function : NamePredicate::Value
39 //=======================================================================
41 bool SMESH_HypoFilter::NamePredicate::IsOk (const SMESH_Hypothesis* aHyp,
42 const TopoDS_Shape& /*aShape*/ ) const
44 return ( _name == aHyp->GetName() );
47 //=======================================================================
48 //function : TypePredicate::Value
50 //=======================================================================
52 int SMESH_HypoFilter::TypePredicate::Value( const SMESH_Hypothesis* aHyp ) const
54 return aHyp->GetType();
57 //=======================================================================
58 //function : DimPredicate::Value
60 //=======================================================================
62 int SMESH_HypoFilter::DimPredicate::Value( const SMESH_Hypothesis* aHyp ) const
64 return aHyp->GetDim();
67 //=======================================================================
68 //function : ApplicablePredicate::IsOk
70 //=======================================================================
72 bool SMESH_HypoFilter::ApplicablePredicate::IsOk(const SMESH_Hypothesis* aHyp,
73 const TopoDS_Shape& /*aShape*/) const
75 return SMESH_subMesh::IsApplicableHypotesis( aHyp, (TopAbs_ShapeEnum)_shapeType );
78 //=======================================================================
79 //function : ApplicablePredicate::ApplicablePredicate
81 //=======================================================================
83 SMESH_HypoFilter::ApplicablePredicate::ApplicablePredicate( const TopoDS_Shape& theShape )
85 _shapeType = ( theShape.IsNull() ? TopAbs_SHAPE : theShape.ShapeType());
88 //=======================================================================
89 //function : InstancePredicate::IsOk
91 //=======================================================================
93 bool SMESH_HypoFilter::InstancePredicate::IsOk(const SMESH_Hypothesis* aHyp,
94 const TopoDS_Shape& /*aShape*/) const
99 //=======================================================================
100 //function : IsAssignedToPredicate::IsOk
102 //=======================================================================
104 bool SMESH_HypoFilter::IsAssignedToPredicate::IsOk(const SMESH_Hypothesis* aHyp,
105 const TopoDS_Shape& aShape) const
107 return ( !_mainShape.IsNull() && !aShape.IsNull() && _mainShape.IsSame( aShape ));
110 //=======================================================================
111 //function : SMESH_HypoFilter
113 //=======================================================================
115 SMESH_HypoFilter::SMESH_HypoFilter()
119 //=======================================================================
120 //function : SMESH_HypoFilter
122 //=======================================================================
124 SMESH_HypoFilter::SMESH_HypoFilter( SMESH_HypoPredicate* aPredicate, bool notNagate )
126 add( notNagate ? AND : AND_NOT, aPredicate );
129 //=======================================================================
132 //=======================================================================
134 SMESH_HypoFilter & SMESH_HypoFilter::And( SMESH_HypoPredicate* aPredicate )
136 add( AND, aPredicate );
140 //=======================================================================
143 //=======================================================================
145 SMESH_HypoFilter & SMESH_HypoFilter::AndNot( SMESH_HypoPredicate* aPredicate )
147 add( AND_NOT, aPredicate );
151 //=======================================================================
154 //=======================================================================
156 SMESH_HypoFilter & SMESH_HypoFilter::Or( SMESH_HypoPredicate* aPredicate )
158 add( OR, aPredicate );
162 //=======================================================================
164 //purpose : Return predicates
165 //=======================================================================
167 SMESH_HypoFilter & SMESH_HypoFilter::OrNot( SMESH_HypoPredicate* aPredicate )
169 add( OR_NOT, aPredicate );
173 //=======================================================================
176 //=======================================================================
178 SMESH_HypoPredicate* SMESH_HypoFilter::Is(const SMESH_Hypothesis* theHypo)
180 return new InstancePredicate( theHypo );
183 //=======================================================================
186 //=======================================================================
188 SMESH_HypoPredicate* SMESH_HypoFilter::IsAlgo()
190 return new TypePredicate( MORE, SMESHDS_Hypothesis::PARAM_ALGO );
193 //=======================================================================
194 //function : IsGlobal
196 //=======================================================================
198 SMESH_HypoPredicate* SMESH_HypoFilter::IsGlobal(const TopoDS_Shape& theMainShape)
200 return new IsAssignedToPredicate( theMainShape );
203 //=======================================================================
204 //function : IsAssignedTo
206 //=======================================================================
208 SMESH_HypoPredicate* SMESH_HypoFilter::IsAssignedTo(const TopoDS_Shape& theShape)
210 return new IsAssignedToPredicate( theShape );
213 //=======================================================================
216 //=======================================================================
218 SMESH_HypoPredicate* SMESH_HypoFilter::HasName(const string & theName)
220 return new NamePredicate( theName );
223 //=======================================================================
226 //=======================================================================
228 SMESH_HypoPredicate* SMESH_HypoFilter::HasDim(const int theDim)
230 return new DimPredicate( EQUAL, theDim );
233 //=======================================================================
234 //function : IsApplicableTo
236 //=======================================================================
238 SMESH_HypoPredicate* SMESH_HypoFilter::IsApplicableTo(const TopoDS_Shape& theShape)
240 return new ApplicablePredicate( theShape );
243 //=======================================================================
246 //=======================================================================
248 SMESH_HypoPredicate* SMESH_HypoFilter::HasType(const int theHypType)
250 return new TypePredicate( EQUAL, theHypType );
253 //=======================================================================
256 //=======================================================================
258 bool SMESH_HypoFilter::IsOk (const SMESH_Hypothesis* aHyp,
259 const TopoDS_Shape& aShape) const
261 if ( myPredicates.empty() )
264 bool ok = ( myPredicates.front()->_logical_op <= AND_NOT );
265 list<SMESH_HypoPredicate*>::const_iterator pred = myPredicates.begin();
266 for ( ; pred != myPredicates.end(); ++pred )
268 bool ok2 = (*pred)->IsOk( aHyp, aShape );
269 switch ( (*pred)->_logical_op ) {
270 case AND: ok = ok && ok2; break;
271 case AND_NOT: ok = ok && !ok2; break;
272 case OR: ok = ok || ok2; break;
273 case OR_NOT: ok = ok || !ok2; break;
280 //=======================================================================
283 //=======================================================================
285 SMESH_HypoFilter & SMESH_HypoFilter::Init ( SMESH_HypoPredicate* aPredicate, bool notNagate )
287 list<SMESH_HypoPredicate*>::const_iterator pred = myPredicates.begin();
288 for ( ; pred != myPredicates.end(); ++pred )
291 add( notNagate ? AND : AND_NOT, aPredicate );
296 //=======================================================================
299 //=======================================================================
301 SMESH_HypoFilter::~SMESH_HypoFilter()