-// Copyright (C) 2014-2020 CEA/DEN, EDF R&D
+// Copyright (C) 2014-2023 CEA, EDF
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
gp_Vec aVecPos;
// If number of angle less then number of symbols then each symbol can be placed
// directly inside of the angle
- if (aAngles.size() >= aPos[1] && !aVectors.empty()) {
+ if ((int)aAngles.size() >= aPos[1] && !aVectors.empty()) {
int aId = aPos[0];
aVecPos = *(std::next(aVectors.begin(), aId));
double aAng;
std::list<double>::const_iterator aItAng;
- double aAngPos;
bool aHasPlace = false;
- //int aIntId = 0; // a position inside a one sector
while (aPosCount < aPos[1]) {
for (aItAng = aAngles.cbegin(), aItVec = aVectors.cbegin();
aItAng != aAngles.cend(); ++aItAng, ++aItVec) {
if ((!aHasPlace) && (aPosCount >= (aPos[0] + 1))) {
aHasPlace = true;
- aAngPos = (*aItAng);
aVecPos = (*aItVec);
- //aIntId = aPos[0] - (aPosCount - Nb);
}
}
if (aPosCount < aPos[1]) {
aToDel.push_back(aIt->first);
else {
// Reindex objects positions in order to avoid spaces
- PositionsMap::iterator aIt;
+ PositionsMap::iterator aPMIt;
int i = 0;
- for (aIt = aPosMap.begin(); aIt != aPosMap.end(); aIt++, i++)
- aIt->second = i;
+ for (aPMIt = aPosMap.begin(); aPMIt != aPosMap.end(); aPMIt++, i++)
+ aPMIt->second = i;
}
}
}