Changeset 1169 in josm for trunk/src/org/openstreetmap/josm/actions/OrthogonalizeAction.java

Timestamp:

2008-12-23T15:07:05+01:00 (17 years ago)

Author:

stoecker

Message:

removed usage of tab stops

File:

• trunk/src/org/openstreetmap/josm/actions/OrthogonalizeAction.java (modified) (12 diffs)

trunk/src/org/openstreetmap/josm/actions/OrthogonalizeAction.java

@@ -28 +28 @@
 
 /**
- * Align edges of a way so all angles are right angles. 
- * 
+ * Align edges of a way so all angles are right angles.
+ *
  * 1. Find orientation of all edges
  * 2. Compute main orientation, weighted by length of edge, normalized to angles between 0 and pi/2
@@ -38 +38 @@
 public final class OrthogonalizeAction extends JosmAction {
 
-        public OrthogonalizeAction() {
-        super(tr("Orthogonalize shape"), 
-            "ortho", 
+    public OrthogonalizeAction() {
+        super(tr("Orthogonalize shape"),
+            "ortho",
             tr("Move nodes so all angles are 90 or 270deg"),
-            Shortcut.registerShortcut("tools:orthogonalize", tr("Tool: {0}", tr("Orthogonalize")), 
-            KeyEvent.VK_Q, 
+            Shortcut.registerShortcut("tools:orthogonalize", tr("Tool: {0}", tr("Orthogonalize")),
+            KeyEvent.VK_Q,
             Shortcut.GROUP_EDIT), true);
-        }
+    }
 
     public void actionPerformed(ActionEvent e) {
@@ -60 +60 @@
                     JOptionPane.showMessageDialog(Main.parent, tr("Only two nodes allowed"));
                     return;
-                } 
+                }
                 dirnodes.add((Node) osm);
                 continue;
@@ -68 +68 @@
                 JOptionPane.showMessageDialog(Main.parent, tr("Selection must consist only of ways."));
                 return;
-            } 
+            }
 
             // Check if every way is made of at least four segments and closed
@@ -78 +78 @@
 
             // Check if every edge in the way is a definite edge of at least 45 degrees of direction change
-            // Otherwise, two segments could be turned into same direction and intersection would fail. 
+            // Otherwise, two segments could be turned into same direction and intersection would fail.
             // Or changes of shape would be too serious.
             for (int i1=0; i1 < way.nodes.size()-1; i1++) {
@@ -116 +116 @@
         boolean use_dirnodes = false;
 
-        if (dirnodes.size() == 2) { 
-            // When selection contains two nodes, use the nodes to compute a direction 
+        if (dirnodes.size() == 2) {
+            // When selection contains two nodes, use the nodes to compute a direction
             // to align all ways to
             align_to_heading = normalize_angle(dirnodes.get(0).eastNorth.heading(dirnodes.get(1).eastNorth));
@@ -124 +124 @@
 
         for (OsmPrimitive osm : sel) {
-            if(!(osm instanceof Way)) 
+            if(!(osm instanceof Way))
                 continue;
 
@@ -164 +164 @@
 
                 if (angle_diff_max > Math.PI/3) {
-                    // rearrange headings: everything < 0 gets PI/2-rotated 
+                    // rearrange headings: everything < 0 gets PI/2-rotated
                     for (int i=0; i < sides; i++) {
-                        if (headings[i] < 0) 
+                        if (headings[i] < 0)
                             headings[i] += Math.PI/2;
                     }
@@ -183 +183 @@
                     sum_weights += weights[i];
                 }
-                align_to_heading = normalize_angle(sum_weighted_headings/sum_weights); 
+                align_to_heading = normalize_angle(sum_weighted_headings/sum_weights);
             }
 
 
             for (int i=0; i < sides; i++) {
-                // Compute handy indices of three nodes to be used in one loop iteration. 
-                // We use segments (i1,i2) and (i2,i3), align them and compute the new 
+                // Compute handy indices of three nodes to be used in one loop iteration.
+                // We use segments (i1,i2) and (i2,i3), align them and compute the new
                 // position of the i2-node as the intersection of the realigned (i1,i2), (i2,i3) segments
                 // Not the most efficient algorithm, but we don't handle millions of nodes...
@@ -212 +212 @@
 
                 // compute intersection of segments
-                double u=det(B.east() - A.east(), B.north() - A.north(), 
+                double u=det(B.east() - A.east(), B.north() - A.north(),
                         C.east() - D.east(), C.north() - D.north());
 
                 // Check for parallel segments and do nothing if they are
-                // In practice this will probably only happen when a way has 
+                // In practice this will probably only happen when a way has
                 // been duplicated
 
@@ -225 +225 @@
                 // if the segment is scaled to length 1
 
-                double q = det(B.north() - C.north(), B.east() - C.east(), 
+                double q = det(B.north() - C.north(), B.east() - C.east(),
                         D.north() - C.north(), D.east() - C.east()) / u;
                 EastNorth intersection = new EastNorth(
@@ -239 +239 @@
                     cmds.add(new MoveCommand(n, dx, dy));
                 }
-            }  
+            }
         }