1 // Copyright (C) 2007-2015 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 : implementaion of SMESH idl descriptions
24 // File : SMESH_HypoFilter.hxx
27 #ifndef SMESH_HypoFilter_HeaderFile
28 #define SMESH_HypoFilter_HeaderFile
30 #include "SMESH_SMESH.hxx"
32 // ===========================
33 // Filter of SMESH_Hypothesis
34 // ===========================
38 #include <TopoDS_Shape.hxx>
39 #include <TopTools_MapOfShape.hxx>
41 class SMESH_HypoFilter;
42 class SMESH_Hypothesis;
45 class SMESH_EXPORT SMESH_HypoPredicate {
47 virtual bool IsOk(const SMESH_Hypothesis* aHyp,
48 const TopoDS_Shape& aShape) const = 0;
49 // check aHyp or/and aShape it is assigned to
50 virtual ~SMESH_HypoPredicate() {}
53 friend class SMESH_HypoFilter;
56 class SMESH_EXPORT SMESH_HypoFilter: public SMESH_HypoPredicate
59 // Create and add predicates.
60 // Added predicates will be destroyed by filter when it dies
62 explicit SMESH_HypoFilter( SMESH_HypoPredicate* aPredicate, bool notNegate = true );
63 // notNegate==false means !aPredicate->IsOk()
64 SMESH_HypoFilter & Init ( SMESH_HypoPredicate* aPredicate, bool notNegate = true );
65 SMESH_HypoFilter & And ( SMESH_HypoPredicate* aPredicate );
66 SMESH_HypoFilter & AndNot( SMESH_HypoPredicate* aPredicate );
67 SMESH_HypoFilter & Or ( SMESH_HypoPredicate* aPredicate );
68 SMESH_HypoFilter & OrNot ( SMESH_HypoPredicate* aPredicate );
71 static SMESH_HypoPredicate* IsAlgo();
72 static SMESH_HypoPredicate* IsAuxiliary();
73 static SMESH_HypoPredicate* IsApplicableTo(const TopoDS_Shape& theShape);
74 static SMESH_HypoPredicate* IsAssignedTo(const TopoDS_Shape& theShape);
75 static SMESH_HypoPredicate* Is(const SMESH_Hypothesis* theHypo);
76 static SMESH_HypoPredicate* IsGlobal(const TopoDS_Shape& theMainShape);
77 static SMESH_HypoPredicate* IsMoreLocalThan(const TopoDS_Shape& theShape,
78 const SMESH_Mesh& theMesh);
79 static SMESH_HypoPredicate* HasName(const std::string & theName);
80 static SMESH_HypoPredicate* HasDim(const int theDim);
81 static SMESH_HypoPredicate* HasType(const int theHypType);
83 bool IsEmpty() const { return myNbPredicates == 0; }
86 * \brief check aHyp or/and aShape it is assigned to
88 bool IsOk (const SMESH_Hypothesis* aHyp,
89 const TopoDS_Shape& aShape) const;
91 * \brief return true if contains no predicates
93 bool IsAny() const { return myNbPredicates > 0; }
101 //std::list<SMESH_HypoPredicate*> myPredicates;
102 SMESH_HypoPredicate* myPredicates[100];
107 enum Logical { AND, AND_NOT, OR, OR_NOT };
108 enum Comparison { EQUAL, NOT_EQUAL, MORE, LESS };
110 SMESH_HypoFilter(const SMESH_HypoFilter& other){}
112 void add( Logical bool_op, SMESH_HypoPredicate* pred )
115 pred->_logical_op = bool_op;
116 myPredicates[ myNbPredicates++ ] = pred;
120 // predicates implementation
122 template <typename TValue>
123 struct templPredicate: public SMESH_HypoPredicate {
126 virtual TValue Value(const SMESH_Hypothesis* aHyp) const = 0;
127 virtual bool IsOk(const SMESH_Hypothesis* aHyp, const TopoDS_Shape& ) const
129 if ( _comp == EQUAL ) return _val == Value( aHyp );
130 else if ( _comp == NOT_EQUAL ) return _val != Value( aHyp );
131 else if ( _comp == MORE ) return _val < Value( aHyp );
132 else return _val > Value( aHyp );
136 struct NamePredicate : public SMESH_HypoPredicate {
138 NamePredicate( std::string name ): _name(name){}
139 bool IsOk(const SMESH_Hypothesis* aHyp,
140 const TopoDS_Shape& aShape) const;
143 struct TypePredicate : public templPredicate< int > {
144 TypePredicate( Comparison comp, int hypType )
145 { _comp = comp; _val = hypType; }
146 int Value( const SMESH_Hypothesis* aHyp ) const;
149 struct DimPredicate : public templPredicate< int > {
150 DimPredicate( Comparison comp, int dim )
151 { _comp = comp; _val = dim; }
152 int Value( const SMESH_Hypothesis* aHyp ) const;
155 struct ApplicablePredicate : public SMESH_HypoPredicate {
157 ApplicablePredicate( const TopoDS_Shape& theShape );
158 bool IsOk(const SMESH_Hypothesis* aHyp,
159 const TopoDS_Shape& aShape) const;
162 struct InstancePredicate : public SMESH_HypoPredicate {
163 const SMESH_Hypothesis* _hypo;
164 InstancePredicate( const SMESH_Hypothesis* hypo ):_hypo(hypo){}
165 bool IsOk(const SMESH_Hypothesis* aHyp,
166 const TopoDS_Shape& aShape) const;
169 struct IsAssignedToPredicate : public SMESH_HypoPredicate {
170 TopoDS_Shape _mainShape;
171 IsAssignedToPredicate( const TopoDS_Shape& mainShape ):_mainShape(mainShape){}
172 bool IsOk(const SMESH_Hypothesis* aHyp,
173 const TopoDS_Shape& aShape) const;
176 struct IsMoreLocalThanPredicate : public SMESH_HypoPredicate {
178 const SMESH_Mesh& _mesh;
179 TopTools_MapOfShape _preferableShapes;
180 IsMoreLocalThanPredicate( const TopoDS_Shape& shape,
181 const SMESH_Mesh& mesh )
182 :_shape(shape),_mesh(mesh) { findPreferable(); }
183 bool IsOk(const SMESH_Hypothesis* aHyp,
184 const TopoDS_Shape& aShape) const;
185 void findPreferable();
188 struct IsAuxiliaryPredicate : public SMESH_HypoPredicate {
189 bool IsOk(const SMESH_Hypothesis* aHyp,
190 const TopoDS_Shape& aShape) const;