}
// iterate by the order in theContext to keep same naming names
TopExp_Explorer anOrder(theContext, theValue.ShapeType());
+ TopTools_MapOfShape alreadyProcessed;
for (; anOrder.More(); anOrder.Next()) {
- if (aNewNB.Contains(anOrder.Current())) {
+ if (alreadyProcessed.Add(anOrder.Current()) && aNewNB.Contains(anOrder.Current())) {
TopoDS_Shape aNewNBShape = anOrder.Current();
// check which can be named correctly, without "by neighbors" type
Selector_Algo* aSubAlgo = Selector_Algo::select(theContext, aNewNBShape,
- newSubLabel(), baseDocument(), geometricalNaming(), false, false);
+ newSubLabel(), baseDocument(), geometricalNaming(), false, useIntersections());
if (aSubAlgo) {
// add to list of good NBs
aNBs.push_back(std::pair<TopoDS_Shape, int>(aNewNBShape, aLevel));
std::list<std::pair<TopoDS_Shape, int> >::iterator aNBIter = aNBs.begin();
for(; aNBIter != aNBs.end(); aNBIter++) {
Selector_Algo* aSubAlgo = Selector_Algo::select(theContext, aNBIter->first,
- newSubLabel(), baseDocument(), geometricalNaming(), false, false);
+ newSubLabel(), baseDocument(), geometricalNaming(), false, useIntersections());
if (append(aSubAlgo)) {
myNBLevel.push_back(aNBIter->second);
} else {
TDataStd_IntegerArray::Set(label(), kLEVELS_ARRAY, 0, int(myNBLevel.size()) - 1);
std::list<int>::iterator aLevel = myNBLevel.begin();
for(int anIndex = 0; aLevel != myNBLevel.end(); aLevel++, anIndex++) {
- anArray->SetValue(anIndex, *aLevel);
+ anArray->SetValue(anIndex, Abs(*aLevel));
}
// store all sub-selectors
std::list<Selector_Algo*>::const_iterator aSubSel = list().cbegin();
for(TDF_ChildIterator aSub(label(), false); aSub.More(); aSub.Next()) {
Selector_Algo* aSubSel = restoreByLab(aSub.Value(), baseDocument());
if (!append(aSubSel, false)) {
- break; // some empty label left in the end
+ if (!aSub.Value().HasAttribute())
+ break; // some empty label left in the end
+ // some selector fails, try to use rest selectors, myNBLevel becomes negative: unused
+ if (myNBLevel.size() > list().size()) {
+ std::list<int>::iterator aListIter = myNBLevel.begin();
+ for(int a = 0; a < list().size(); a++)
+ aListIter++;
+ *aListIter = -*aListIter;
+ list().push_back(NULL);
+ }
}
}
- return true;
+ return myNBLevel.size() == list().size() && !myNBLevel.empty();
}
TDF_Label Selector_FilterByNeighbors::restoreByName(std::string theName,
std::list<int>::iterator aLevel = myNBLevel.begin();
std::list<Selector_Algo*>::const_iterator aSubSel = list().cbegin();
for(; aSubSel != list().cend(); aSubSel++, aLevel++) {
- if (!(*aSubSel)->solve(theContext)) {
- return false;
+ if (*aLevel < 0)
+ continue; // skip because sub-selector is not good
+ if ((*aSubSel)->solve(theContext)) {
+ aNBs.push_back(std::pair<TopoDS_Shape, int>((*aSubSel)->value(), *aLevel));
}
- aNBs.push_back(std::pair<TopoDS_Shape, int>((*aSubSel)->value(), *aLevel));
}
- aResult = findNeighbor(theContext, aNBs, geometricalNaming());
- if (!aResult.IsNull()) {
- Selector_Algo::store(aResult);
- return true;
+ if (!aNBs.empty()) {
+ aResult = findNeighbor(theContext, aNBs, geometricalNaming());
+ if (!aResult.IsNull()) {
+ Selector_Algo::store(aResult);
+ return true;
+ }
}
return false;
}
std::list<int>::iterator aLevel = myNBLevel.begin();
std::list<Selector_Algo*>::const_iterator aSubSel = list().cbegin();
for(; aSubSel != list().cend(); aSubSel++, aLevel++) {
+ if (!*aSubSel)
+ continue;
aResult += "(" + (*aSubSel)->name(theNameGenerator) + ")";
if (*aLevel > 1) {
std::ostringstream aLevelStr;