-/*******************************************************************************\r
- * Copyright (c) 2007, 2010 Association for Decentralized Information Management\r
- * in Industry THTH ry.\r
- * All rights reserved. This program and the accompanying materials\r
- * are made available under the terms of the Eclipse Public License v1.0\r
- * which accompanies this distribution, and is available at\r
- * http://www.eclipse.org/legal/epl-v10.html\r
- *\r
- * Contributors:\r
- * VTT Technical Research Centre of Finland - initial API and implementation\r
- *******************************************************************************/\r
-package org.simantics.g2d.routing;\r
-\r
-public class Connection {\r
- /**\r
- * An array containing route points (also the start and end point)\r
- */\r
- public double[] routePath; \r
- /**\r
- * Combination of the flags defined in Constants:\r
- */\r
- public int startDirections;\r
- /**\r
- * Combination of the flags defined in Constants:\r
- */\r
- public int endDirections;\r
- \r
- public Connection(double[] routePoints, int startDirections, int endDirections) {\r
- this.routePath = routePoints;\r
- this.startDirections = startDirections;\r
- this.endDirections = endDirections;\r
- }\r
- \r
- public double minLength() {\r
- double length = 0.0;\r
- for(int i=2;i<routePath.length;i+=2) \r
- length += Math.abs(routePath[i]-routePath[i-2]) \r
- + Math.abs(routePath[i+1]-routePath[i-1]);\r
- return length;\r
- }\r
-}\r
+/*******************************************************************************
+ * Copyright (c) 2007, 2010 Association for Decentralized Information Management
+ * in Industry THTH ry.
+ * All rights reserved. This program and the accompanying materials
+ * are made available under the terms of the Eclipse Public License v1.0
+ * which accompanies this distribution, and is available at
+ * http://www.eclipse.org/legal/epl-v10.html
+ *
+ * Contributors:
+ * VTT Technical Research Centre of Finland - initial API and implementation
+ *******************************************************************************/
+package org.simantics.g2d.routing;
+
+public class Connection {
+ /**
+ * An array containing route points (also the start and end point)
+ */
+ public double[] routePath;
+ /**
+ * Combination of the flags defined in Constants:
+ */
+ public int startDirections;
+ /**
+ * Combination of the flags defined in Constants:
+ */
+ public int endDirections;
+
+ public Connection(double[] routePoints, int startDirections, int endDirections) {
+ this.routePath = routePoints;
+ this.startDirections = startDirections;
+ this.endDirections = endDirections;
+ }
+
+ public double minLength() {
+ double length = 0.0;
+ for(int i=2;i<routePath.length;i+=2)
+ length += Math.abs(routePath[i]-routePath[i-2])
+ + Math.abs(routePath[i+1]-routePath[i-1]);
+ return length;
+ }
+}