import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
+import java.util.Comparator;
import java.util.Iterator;
+import java.util.Map;
+import java.util.TreeMap;
import org.simantics.diagram.connection.rendering.arrows.ILineEndStyle;
import org.simantics.diagram.connection.rendering.arrows.PlainLineEndStyle;
double minX, double minY,
double maxX, double maxY,
ILineEndStyle style) {
- return addBigTerminal(minX, minY, maxX, maxY, style, null);
+ return addBigTerminal(minX, minY, maxX, maxY, style, null);
}
public RouteTerminal addBigTerminal(
double minX, double minY,
for(RouteTerminal terminal : terminals)
if((terminal.getAllowedDirections()&0x10) != 0) {
try {
- RouteLine line = terminal.getLine();
- if(line == null)
- continue;
+ RouteLine line = terminal.getLine();
+ if(line == null)
+ continue;
RoutePoint b = line.getBegin();
double distSq = Line2D.ptSegDistSq(terminal.x, terminal.y, b.x, b.y, x, y);
if(distSq <= toleranceSq) {
if((mask & PICK_POINTS) != 0) {
Object point = pickPoint(x, y, tolerance, mask);
if(point != null)
- return point;
+ return point;
}
/*if((mask & PICK_DIRECT_LINES) != 0) {
RouteTerminal terminal = pickDirectLine(x, y, tolerance);
*
* Update 14.2.2014: With Sulca, there is a constant issue when line.terminal == null but point is RouteTerminal.
*/
- if (point instanceof RouteLink) {
- RouteLine l = ((RouteLink)point).getOther(line);
- l.points.remove(point);
- if(!l.isTransient())
- nLines.add(l);
- }
+ if (point instanceof RouteLink) {
+ RouteLine l = ((RouteLink)point).getOther(line);
+ l.points.remove(point);
+ if(!l.isTransient())
+ nLines.add(l);
+ }
}
if(nLines.isEmpty())
*
* Update 16.10.2014: With Sulca, there is a constant issue when line.terminal == null but point is RouteTerminal.
*/
- if (point instanceof RouteLink) {
- RouteLink link = (RouteLink)point;
- link.replace(l, merged);
- }
+ if (point instanceof RouteLink) {
+ RouteLink link = (RouteLink)point;
+ link.replace(l, merged);
+ }
}
}
THashSet<RouteLine> removedLines = new THashSet<RouteLine>();
path.moveTo(x, y);
}
+ private static final Comparator<RoutePoint> RG_COMP = (o1, o2) -> {
+ if (o1.getX() < o2.getX())
+ return -1;
+ else if (o1.getX() > o2.getX())
+ return 1;
+ if (o1.getY() < o2.getY())
+ return -1;
+ else if (o1.getY() > o2.getY())
+ return 1;
+ return 0;
+ };
+
private static void addPathEnd(Path2D path, RoutePoint cur, RouteLine line) {
double x = cur.x, y = cur.y;
if(cur instanceof RouteTerminal) {
}
// Analyze graph
- THashMap<RoutePoint, RouteLine> begins =
- new THashMap<RoutePoint, RouteLine>();
+ Map<RoutePoint, RouteLine> begins =
+// new THashMap<RoutePoint, RouteLine>(); //The ordering of the coordinates in the path should be deterministic between scenegraphs
+ new TreeMap<RoutePoint, RouteLine>(RG_COMP);
for(RouteLine line : lines) {
add(begins, line);
}
}
}
- private void drawContinuousPath(Path2D path, THashMap<RoutePoint, RouteLine> begins,
+ private void drawContinuousPath(Path2D path, Map<RoutePoint, RouteLine> begins,
RoutePoint cur, RouteLine curLine) {
if(curLine == null)
return;
}
}
- private static void add(THashMap<RoutePoint, RouteLine> begins,
+ private static void add(Map<RoutePoint, RouteLine> begins,
RouteLine line) {
if(line.points.size() > 1) {
{
}
public void reclaimTransientMemory() {
- removeTransientRouteLines();
- needsUpdate = true;
+ removeTransientRouteLines();
+ needsUpdate = true;
}
}