1 package tim.prune.function.sew;
3 import java.util.Comparator;
6 * Class to sort the candidates for segment splitting
8 public class CandidateSorter implements Comparator<SplitPoint>
11 * Sort the objects by distance (greatest first)
13 public int compare(SplitPoint inFirst, SplitPoint inSecond)
15 if (inFirst == null) return 1;
16 if (inSecond == null) return -1;
17 // First, sort by distance
18 final double dist1 = inFirst.getDistanceToPrevPoint();
19 final double dist2 = inSecond.getDistanceToPrevPoint();
26 // If the distances are identical, then just sort by point index
27 return inFirst.getPointIndex() - inSecond.getPointIndex();