1 // Copyright (C) 2014-2017 CEA/DEN, EDF R&D
3 // This library is free software; you can redistribute it and/or
4 // modify it under the terms of the GNU Lesser General Public
5 // License as published by the Free Software Foundation; either
6 // version 2.1 of the License, or (at your option) any later version.
8 // This library is distributed in the hope that it will be useful,
9 // but WITHOUT ANY WARRANTY; without even the implied warranty of
10 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 // Lesser General Public License for more details.
13 // You should have received a copy of the GNU Lesser General Public
14 // License along with this library; if not, write to the Free Software
15 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 // See http://www.salome-platform.org/ or
18 // email : webmaster.salome@opencascade.com<mailto:webmaster.salome@opencascade.com>
21 #include <Selector_FilterByNeighbors.h>
23 #include <Selector_NameGenerator.h>
26 #include <TopoDS_Builder.hxx>
27 #include <TopoDS_Compound.hxx>
28 #include <TopTools_MapOfShape.hxx>
29 #include <TopExp_Explorer.hxx>
30 #include <TDataStd_Integer.hxx>
31 #include <TDataStd_IntegerArray.hxx>
32 #include <TDF_ChildIterator.hxx>
34 // array of the neighbor levels
35 static const Standard_GUID kLEVELS_ARRAY("ee4c4b45-e859-4e86-aa4f-6eac68e0ca1f");
37 Selector_FilterByNeighbors::Selector_FilterByNeighbors() : Selector_AlgoWithSubs()
40 /// Searches neighbor of theLevel of neighborhood to theValue in theContex
41 static void findNeighbors(const TopoDS_Shape theContext, const TopoDS_Shape theValue,
42 const int theLevel, TopTools_MapOfShape& theResult)
44 TopAbs_ShapeEnum aConnectorType = TopAbs_VERTEX; // type of the connector sub-shapes
45 if (theValue.ShapeType() == TopAbs_FACE)
46 aConnectorType = TopAbs_EDGE;
47 TopTools_MapOfShape aNBConnectors; // connector shapes that already belong to neighbors
48 for(TopExp_Explorer aValExp(theValue, aConnectorType); aValExp.More(); aValExp.Next()) {
49 aNBConnectors.Add(aValExp.Current());
52 TopTools_MapOfShape alreadyProcessed;
53 alreadyProcessed.Add(theValue);
55 for(int aLevel = 1; aLevel <= theLevel; aLevel++) {
56 TopoDS_ListOfShape aGoodCandidates;
57 TopExp_Explorer aCandidate(theContext, theValue.ShapeType());
58 for(; aCandidate.More(); aCandidate.Next()) {
59 if (alreadyProcessed.Contains(aCandidate.Current()))
61 TopExp_Explorer aCandConnector(aCandidate.Current(), aConnectorType);
62 for(; aCandConnector.More(); aCandConnector.Next()) {
63 if (aNBConnectors.Contains(aCandConnector.Current())) // candidate is neighbor
66 if (aCandConnector.More()) {
67 if (aLevel == theLevel) { // add a NB into result: it is connected to other neighbors
68 theResult.Add(aCandidate.Current());
69 } else { // add to the NB of the current level
70 aGoodCandidates.Append(aCandidate.Current());
74 if (aLevel != theLevel) { // good candidates are added to neighbor of this level by connectors
75 for(TopoDS_ListOfShape::Iterator aGood(aGoodCandidates); aGood.More(); aGood.Next()) {
76 TopExp_Explorer aGoodConnector(aGood.Value(), aConnectorType);
77 for(; aGoodConnector.More(); aGoodConnector.Next()) {
78 aNBConnectors.Add(aGoodConnector.Current());
80 alreadyProcessed.Add(aGood.Value());
86 /// Searches the neighbor shape by neighbors defined in theNB in theContext shape
87 static const TopoDS_Shape findNeighbor(const TopoDS_Shape theContext,
88 const std::list<std::pair<TopoDS_Shape, int> >& theNB, const bool theGeometrical)
90 // searching for neighbors with minimum level
92 std::list<std::pair<TopoDS_Shape, int> >::const_iterator aNBIter = theNB.cbegin();
93 for(; aNBIter != theNB.cend(); aNBIter++) {
94 if (aMinLevel == 0 || aNBIter->second < aMinLevel) {
95 aMinLevel = aNBIter->second;
98 // collect all neighbors which are neighbors of sub-shapes with minimum level
100 TopoDS_ListOfShape aMatches;
101 for(aNBIter = theNB.cbegin(); aNBIter != theNB.cend(); aNBIter++) {
102 if (aNBIter->second == aMinLevel) {
103 TopTools_MapOfShape aThisNBs;
104 findNeighbors(theContext, aNBIter->first, aMinLevel, aThisNBs);
105 // aMatches must contain common part of all NBs lists
106 for(TopTools_MapOfShape::Iterator aThisNB(aThisNBs); aThisNB.More(); aThisNB.Next()) {
108 aMatches.Append(aThisNB.Value());
110 // remove all in aMatches which are not in this NBs
111 for(TopoDS_ListOfShape::Iterator aMatch(aMatches); aMatch.More(); ) {
112 if (aThisNBs.Contains(aMatch.Value())) {
115 aMatches.Remove(aMatch);
123 if (aMatches.IsEmpty())
124 return TopoDS_Shape(); // not found any candidate
125 if (aMatches.Extent() == 1)
126 return aMatches.First(); // already found good candidate
127 TopoDS_Compound aResultCompound; // in case of geometrical name and many candidates
128 // iterate all matches to find by other (higher level) neighbors the best candidate
129 TopoDS_Shape aGoodCandidate;
130 TopTools_MapOfShape aGoodCandidates; // already added good candidates to the map
131 for(TopoDS_ListOfShape::Iterator aCandidate(aMatches); aCandidate.More(); aCandidate.Next()) {
132 bool aValidCadidate = true;
133 for(int aLevel = aMinLevel + 1; true; aLevel++) {
134 bool aFooundHigherLevel = false;
135 TopoDS_ListOfShape aLevelNBs;
136 for(aNBIter = theNB.cbegin(); aNBIter != theNB.cend(); aNBIter++) {
137 if (aNBIter->second == aLevel)
138 aLevelNBs.Append(aNBIter->first);
139 else if (aNBIter->second >= aLevel)
140 aFooundHigherLevel = true;
142 if (!aFooundHigherLevel && aLevelNBs.IsEmpty()) { // iterated all, so, good candidate
143 if (aGoodCandidate.IsNull()) {
144 aGoodCandidate = aCandidate.Value();
145 } else { // another good candidate
146 if (theGeometrical && Selector_Algo::sameGeometry(aGoodCandidate, aCandidate.Value())) {
147 if (!aGoodCandidates.Add(aCandidate.Value()))
149 static TopoDS_Builder aBuilder;
150 if (aResultCompound.IsNull()) {
151 aBuilder.MakeCompound(aResultCompound);
152 aBuilder.Add(aResultCompound, aGoodCandidate);
154 aBuilder.Add(aResultCompound, aCandidate.Value());
156 return TopoDS_Shape();
159 if (!aLevelNBs.IsEmpty()) {
160 TopTools_MapOfShape aNBsOfCandidate;
161 findNeighbors(theContext, aCandidate.Value(), aLevel, aNBsOfCandidate);
162 // check all stored neighbors are in the map of real neighbors
163 for(TopoDS_ListOfShape::Iterator aLevIter(aLevelNBs); aLevIter.More(); aLevIter.Next()) {
164 if (!aNBsOfCandidate.Contains(aLevIter.Value())) {
165 aValidCadidate = false;
170 if (!aValidCadidate) // candidate is not valid, break the checking
174 if (!aResultCompound.IsNull())
175 return aResultCompound;
176 return aGoodCandidate;
179 bool Selector_FilterByNeighbors::select(const TopoDS_Shape theContext, const TopoDS_Shape theValue)
181 myShapeType = theValue.ShapeType();
182 // searching by neighbors
183 std::list<std::pair<TopoDS_Shape, int> > aNBs; /// neighbor sub-shape -> level of neighborhood
184 for(int aLevel = 1; true; aLevel++) {
185 TopTools_MapOfShape aNewNB;
186 findNeighbors(theContext, theValue, aLevel, aNewNB);
187 if (aNewNB.Extent() == 0) { // there are no neighbors of the given level, stop iteration
190 // iterate by the order in theContext to keep same naming names
191 TopExp_Explorer anOrder(theContext, theValue.ShapeType());
192 for (; anOrder.More(); anOrder.Next()) {
193 if (aNewNB.Contains(anOrder.Current())) {
194 TopoDS_Shape aNewNBShape = anOrder.Current();
195 // check which can be named correctly, without "by neighbors" type
196 Selector_Algo* aSubAlgo = Selector_Algo::select(theContext, aNewNBShape,
197 newSubLabel(), baseDocument(), geometricalNaming(), false, false);
199 // add to list of good NBs
200 aNBs.push_back(std::pair<TopoDS_Shape, int>(aNewNBShape, aLevel));
202 delete aSubAlgo; // don't keep this sub-algo until all subs and whole validity are checked
205 TopoDS_Shape aResult = findNeighbor(theContext, aNBs, geometricalNaming());
206 if (!aResult.IsNull() && aResult.IsSame(theValue)) {
207 std::list<std::pair<TopoDS_Shape, int> >::iterator aNBIter = aNBs.begin();
208 for(; aNBIter != aNBs.end(); aNBIter++) {
209 Selector_Algo* aSubAlgo = Selector_Algo::select(theContext, aNBIter->first,
210 newSubLabel(), baseDocument(), geometricalNaming(), false, false);
211 if (append(aSubAlgo)) {
212 myNBLevel.push_back(aNBIter->second);
223 void Selector_FilterByNeighbors::store()
225 storeType(Selector_Algo::SELTYPE_FILTER_BY_NEIGHBOR);
226 TDataStd_Integer::Set(label(), shapeTypeID(), (int)myShapeType);
227 // store numbers of levels corresponded to the neighbors in sub-selectors
228 Handle(TDataStd_IntegerArray) anArray =
229 TDataStd_IntegerArray::Set(label(), kLEVELS_ARRAY, 0, int(myNBLevel.size()) - 1);
230 std::list<int>::iterator aLevel = myNBLevel.begin();
231 for(int anIndex = 0; aLevel != myNBLevel.end(); aLevel++, anIndex++) {
232 anArray->SetValue(anIndex, *aLevel);
234 // store all sub-selectors
235 std::list<Selector_Algo*>::const_iterator aSubSel = list().cbegin();
236 for(; aSubSel != list().cend(); aSubSel++) {
241 bool Selector_FilterByNeighbors::restore()
243 Handle(TDataStd_Integer) aShapeTypeAttr;
244 if (!label().FindAttribute(shapeTypeID(), aShapeTypeAttr))
246 myShapeType = TopAbs_ShapeEnum(aShapeTypeAttr->Get());
247 // restore levels indices
248 Handle(TDataStd_IntegerArray) anArray;
249 if (!label().FindAttribute(kLEVELS_ARRAY, anArray))
251 for(int anIndex = 0; anIndex <= anArray->Upper(); anIndex++) {
252 myNBLevel.push_back(anArray->Value(anIndex));
254 // restore sub-selectors
255 bool aSubResult = true;
256 for(TDF_ChildIterator aSub(label(), false); aSub.More(); aSub.Next()) {
257 Selector_Algo* aSubSel = restoreByLab(aSub.Value(), baseDocument());
258 if (!append(aSubSel, false)) {
259 break; // some empty label left in the end
265 TDF_Label Selector_FilterByNeighbors::restoreByName(std::string theName,
266 const TopAbs_ShapeEnum theShapeType, Selector_NameGenerator* theNameGenerator)
268 myShapeType = theShapeType;
270 for (size_t aStart = 0; aStart != std::string::npos;
271 aStart = theName.find('(', aStart + 1)) {
272 size_t anEndPos = theName.find(')', aStart + 1);
273 if (anEndPos != std::string::npos) {
274 std::string aSubStr = theName.substr(aStart + 1, anEndPos - aStart - 1);
275 TDF_Label aSubContext;
276 Selector_Algo* aSubSel =
277 Selector_Algo::restoreByName(
278 newSubLabel(), baseDocument(), aSubStr, myShapeType, theNameGenerator, aSubContext);
279 if (!append(aSubSel))
282 if (aSubContext.IsNull()) {
287 if (!aContext.IsNull() && !aContext.IsEqual(aSubContext)) {
288 if (!theNameGenerator->isLater(aContext, aSubContext))
289 aContext = aSubContext;
291 aContext = aSubContext;
293 if (!aContext.IsNull()) // for filters by neighbor the latest context shape is vital
294 aContext = theNameGenerator->newestContext(aContext);
296 // searching for the level index
298 for (anEndPos++; anEndPos != std::string::npos &&
299 theName[anEndPos] != '(' && theName[anEndPos] != 0;
301 aLevel += theName[anEndPos];
304 myNBLevel.push_back(1); // by default it is 1
306 int aNum = atoi(aLevel.c_str());
308 myNBLevel.push_back(aNum);
310 return TDF_Label(); // invalid number
313 return TDF_Label(); // invalid parentheses
318 bool Selector_FilterByNeighbors::solve(const TopoDS_Shape& theContext)
320 TopoDS_Shape aResult;
322 std::list<std::pair<TopoDS_Shape, int> > aNBs; /// neighbor sub-shape -> level of neighborhood
323 std::list<int>::iterator aLevel = myNBLevel.begin();
324 std::list<Selector_Algo*>::const_iterator aSubSel = list().cbegin();
325 for(; aSubSel != list().cend(); aSubSel++, aLevel++) {
326 if (!(*aSubSel)->solve(theContext)) {
329 aNBs.push_back(std::pair<TopoDS_Shape, int>((*aSubSel)->value(), *aLevel));
331 aResult = findNeighbor(theContext, aNBs, geometricalNaming());
332 if (!aResult.IsNull()) {
333 Selector_Algo::store(aResult);
339 std::string Selector_FilterByNeighbors::name(Selector_NameGenerator* theNameGenerator)
341 // (nb1)level_if_more_than_1(nb2)level_if_more_than_1(nb3)level_if_more_than_1
343 std::list<int>::iterator aLevel = myNBLevel.begin();
344 std::list<Selector_Algo*>::const_iterator aSubSel = list().cbegin();
345 for(; aSubSel != list().cend(); aSubSel++, aLevel++) {
346 aResult += "(" + (*aSubSel)->name(theNameGenerator) + ")";
348 std::ostringstream aLevelStr;
350 aResult += aLevelStr.str();