public int[] getContainedPositions(BoundingBox boundingBox) {
List<Integer> result = new ArrayList<>();
List<P> positions = getPositions();
for (int i = 0; i < positions.size(); i++) {
P position = positions.get(i);
if (position.hasCoordinates() && boundingBox.contains(position)) result.add(i);
}
return toArray(result);
}
public int[] getPositionsWithinDistanceToPredecessor(double distance) {
List<Integer> result = new ArrayList<>();
List<P> positions = getPositions();
if (positions.size() <= 2) return new int[0];
P previous = positions.get(0);
for (int i = 1; i < positions.size() - 1; i++) {
P next = positions.get(i);
if (!next.hasCoordinates() || next.calculateDistance(previous) <= distance) result.add(i);
else previous = next;
}
return toArray(result);
}
/**
* Removes duplicate adjacent {@link #getPositions() positions} from this route, leaving only
* distinct neighbours
*/
public void removeDuplicates() {
List<P> positions = getPositions();
P previous = null;
int index = 0;
while (index < positions.size()) {
P next = positions.get(index);
if (previous != null && (!next.hasCoordinates() || next.calculateDistance(previous) <= 0.0)) {
positions.remove(index);
} else index++;
previous = next;
}
}
