-// Copyright (C) 2014-2019 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
return;
}
- int aNbDup = 0;
std::list<GeomPointPtr>::iterator aPIt = thePoints.begin();
GeomPointPtr aPrevPnt = *aPIt;
for (; aPIt != thePoints.end(); ++aPIt) {
aNextIt = aPIt; ++aNextIt;
if (aNearestIt != aNextIt) {
// Keep given order of points to use it in case of equidistant candidates
- // .-<---<-.
- // / \
+ // .--<---<--.
+ // | |
// o o o c o->o->o->o->n o o
// | | |
// i i+1 nearest