-// Copyright (C) 2014-2019 CEA/DEN, EDF R&D
+// Copyright (C) 2014-2020 CEA/DEN, EDF R&D
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
}
aFathers[anAttr->contextObject()] = anObj;
if (aFatherGroup.find(anObj) == aFatherGroup.end()) {
- int aSize = aFatherGroup.size();
+ int aSize = (int)aFatherGroup.size();
aFatherGroup[anObj] = aSize; // the first is zero
}
}
}
- if (aFatherGroup.size() < aList->size() && aFatherGroup.size() != 1) // already good
+ if (aFatherGroup.size() < (size_t)aList->size() && aFatherGroup.size() != 1) // already good
break;
- if (aFatherGroup.size() == aList->size()) // no sence to iterate further
+ if (aFatherGroup.size() == (size_t)aList->size()) // no sence to iterate further
break;
if (aFatherGroup.size() == 1 && aList->size() > 1 && aCurrentDepth == aMinDepth)
aSplitAnyway = true; // split anyway, better that just move
std::set<int> aRemoved;
bool aStay = false; // to indicate that the good attribute found stays in the list
- int anIndex = 1; // index of the name assigned to group-feature and result
// added in the order: 3 2 1 orig=0, so, keep the results to give names later
std::list<FeaturePtr> aResults;
for(int aNext = aList->size() - 1; aNext >= 0; aNext--) {
aRemoved.insert(aNext);
FeaturePtr aNew;
- if (aSplitAnyway || aFGroup > aResults.size()) {
+ if (aSplitAnyway || aFGroup > (int)aResults.size()) {
aNew = aDoc->addFeature(ID(), false);
aResults.push_front(aNew); // to keep the order
} else { // appending in already created new result