Fixed all line endings of the repository

[simantics/platform.git] / bundles / org.simantics.debug.graphical / src / org / simantics / debug / graphical / layout / LayoutAlgorithm.java

diff --git a/bundles/org.simantics.debug.graphical/src/org/simantics/debug/graphical/layout/LayoutAlgorithm.java b/bundles/org.simantics.debug.graphical/src/org/simantics/debug/graphical/layout/LayoutAlgorithm.java
index 1fe13a433b667cbb4c06a39af69abb7a8036ced8..fd1b4ff98a7743eceb24790322b70e58c419d51e 100644 (file)
--- a/bundles/org.simantics.debug.graphical/src/org/simantics/debug/graphical/layout/LayoutAlgorithm.java
+++ b/bundles/org.simantics.debug.graphical/src/org/simantics/debug/graphical/layout/LayoutAlgorithm.java
@@ -1,107 +1,107 @@
-package org.simantics.debug.graphical.layout;\r
-\r
-public class LayoutAlgorithm {\r
-\r
-    final double OPTIMAL_DISTANCE = 150.0;   \r
-    final double C = 0.1;\r
-    final double K = C / OPTIMAL_DISTANCE;\r
-    final double G = K;\r
-    final double Q = C * OPTIMAL_DISTANCE * OPTIMAL_DISTANCE;\r
-    final double TOLERANCE = 1e-3;\r
-    final int MAX_ITERATIONS = 10000;\r
-    final double MAX_MOVE2 = 40000.0;\r
-    \r
-    int size;\r
-    double[] posX;\r
-    double[] posY;\r
-    double[] forceX;\r
-    double[] forceY;\r
-    \r
-    int[][] neighbors;\r
-    \r
-    public LayoutAlgorithm(int[][] neighbors) {\r
-        this.size = neighbors.length;\r
-        this.neighbors = neighbors;\r
-        this.posX = new double[size];\r
-        this.posY = new double[size];\r
-        this.forceX = new double[size];\r
-        this.forceY = new double[size];\r
-    }\r
-    \r
-    public double[] getPosX() {\r
-        return posX;\r
-    }\r
-    \r
-    public double[] getPosY() {\r
-        return posY;\r
-    }\r
-    \r
-    private void computeForces() {\r
-        for(int i=0;i<size;++i) {\r
-            double x = posX[i];\r
-            double y = posY[i];\r
-            double fx = -G * x;\r
-            double fy = -G * y;\r
-            \r
-            for(int j=0;j<size;++j)\r
-                if(j != i) {\r
-                    double dx = posX[j] - x;\r
-                    double dy = posY[j] - y;\r
-                    double l2 = dx*dx + dy*dy;\r
-                    /*double l = Math.sqrt(l2);\r
-                    double l3 = l*l2;*/\r
-                    fx -= Q * dx / l2;\r
-                    fy -= Q * dy / l2;\r
-                }\r
-            \r
-            for(int j : neighbors[i]) {\r
-                double dx = posX[j] - x;\r
-                double dy = posY[j] - y;       \r
-                double l2 = dx*dx + dy*dy;\r
-                double l = Math.sqrt(l2);\r
-                fx += K * l * dx;\r
-                fy += K * l * dy;\r
-            }\r
-            \r
-            forceX[i] = fx;\r
-            forceY[i] = fy;\r
-        }\r
-    }\r
-    \r
-    private boolean converged() {\r
-        for(int i=0;i<size;++i) {\r
-            double fx = forceX[i];\r
-            double fy = forceY[i];\r
-            double f2 = fx*fx + fy*fy;\r
-            if(f2 > TOLERANCE)\r
-                return false;\r
-        }\r
-        return true;\r
-    }\r
-    \r
-    private void moveAll() {\r
-        for(int i=0;i<size;++i) {\r
-            double fx = forceX[i];\r
-            double fy = forceY[i];\r
-            double f2 = fx*fx + fy*fy;\r
-            if(f2 > MAX_MOVE2) {\r
-                double s = Math.sqrt(MAX_MOVE2 / f2);\r
-                fx *= s;\r
-                fy *= s;\r
-            }\r
-            posX[i] += fx;\r
-            posY[i] += fy;\r
-        }\r
-        computeForces();\r
-    }\r
-    \r
-    public void optimize() {\r
-        computeForces();\r
-        \r
-        for(int iter=0;iter<MAX_ITERATIONS;++iter) {\r
-            if(converged())\r
-                break;\r
-            moveAll();\r
-        }\r
-    }\r
-}\r
+package org.simantics.debug.graphical.layout;
+
+public class LayoutAlgorithm {
+
+    final double OPTIMAL_DISTANCE = 150.0;   
+    final double C = 0.1;
+    final double K = C / OPTIMAL_DISTANCE;
+    final double G = K;
+    final double Q = C * OPTIMAL_DISTANCE * OPTIMAL_DISTANCE;
+    final double TOLERANCE = 1e-3;
+    final int MAX_ITERATIONS = 10000;
+    final double MAX_MOVE2 = 40000.0;
+    
+    int size;
+    double[] posX;
+    double[] posY;
+    double[] forceX;
+    double[] forceY;
+    
+    int[][] neighbors;
+    
+    public LayoutAlgorithm(int[][] neighbors) {
+        this.size = neighbors.length;
+        this.neighbors = neighbors;
+        this.posX = new double[size];
+        this.posY = new double[size];
+        this.forceX = new double[size];
+        this.forceY = new double[size];
+    }
+    
+    public double[] getPosX() {
+        return posX;
+    }
+    
+    public double[] getPosY() {
+        return posY;
+    }
+    
+    private void computeForces() {
+        for(int i=0;i<size;++i) {
+            double x = posX[i];
+            double y = posY[i];
+            double fx = -G * x;
+            double fy = -G * y;
+            
+            for(int j=0;j<size;++j)
+                if(j != i) {
+                    double dx = posX[j] - x;
+                    double dy = posY[j] - y;
+                    double l2 = dx*dx + dy*dy;
+                    /*double l = Math.sqrt(l2);
+                    double l3 = l*l2;*/
+                    fx -= Q * dx / l2;
+                    fy -= Q * dy / l2;
+                }
+            
+            for(int j : neighbors[i]) {
+                double dx = posX[j] - x;
+                double dy = posY[j] - y;       
+                double l2 = dx*dx + dy*dy;
+                double l = Math.sqrt(l2);
+                fx += K * l * dx;
+                fy += K * l * dy;
+            }
+            
+            forceX[i] = fx;
+            forceY[i] = fy;
+        }
+    }
+    
+    private boolean converged() {
+        for(int i=0;i<size;++i) {
+            double fx = forceX[i];
+            double fy = forceY[i];
+            double f2 = fx*fx + fy*fy;
+            if(f2 > TOLERANCE)
+                return false;
+        }
+        return true;
+    }
+    
+    private void moveAll() {
+        for(int i=0;i<size;++i) {
+            double fx = forceX[i];
+            double fy = forceY[i];
+            double f2 = fx*fx + fy*fy;
+            if(f2 > MAX_MOVE2) {
+                double s = Math.sqrt(MAX_MOVE2 / f2);
+                fx *= s;
+                fy *= s;
+            }
+            posX[i] += fx;
+            posY[i] += fy;
+        }
+        computeForces();
+    }
+    
+    public void optimize() {
+        computeForces();
+        
+        for(int iter=0;iter<MAX_ITERATIONS;++iter) {
+            if(converged())
+                break;
+            moveAll();
+        }
+    }
+}