Ticket #2145: distributeaction.patch

src/org/openstreetmap/josm/actions/DistributeAction.java

@@ +1 @@
+// License: GPL. Copyright 2009 by Immanuel Scholz and others
+package org.openstreetmap.josm.actions;
+
+import static org.openstreetmap.josm.tools.I18n.tr;
+
+import java.awt.event.ActionEvent;
+import java.awt.event.KeyEvent;
+import java.util.Collection;
+import java.util.LinkedList;
+
+import javax.swing.JOptionPane;
+
+import org.openstreetmap.josm.Main;
+import org.openstreetmap.josm.command.Command;
+import org.openstreetmap.josm.command.MoveCommand;
+import org.openstreetmap.josm.command.SequenceCommand;
+import org.openstreetmap.josm.data.osm.Node;
+import org.openstreetmap.josm.data.osm.OsmPrimitive;
+import org.openstreetmap.josm.data.osm.Way;
+import org.openstreetmap.josm.tools.Shortcut;
+
+/**
+ * Distributes the selected nodes to equal distances along a line.
+ *
+ * @author Teemu Koskinen
+ */
+public final class DistributeAction extends JosmAction {
+
+    public DistributeAction() {
+        super(tr("Distribute Nodes"), "distribute", tr("Distribute the selected nodes to equal distances along a line."),
+        Shortcut.registerShortcut("tools:distribute", tr("Tool: {0}", tr("Distribute Nodes")), KeyEvent.VK_B, Shortcut.GROUP_EDIT), true);
+    }
+
+    /**
+     * The general algorithm here is to find the two selected nodes
+     * that are furthest apart, and then to distribute all other selected
+     * nodes along the straight line between these nodes.
+     */
+    public void actionPerformed(ActionEvent e) {
+        Collection<OsmPrimitive> sel = Main.ds.getSelected();
+        Collection<Node> nodes = new LinkedList<Node>();
+        Collection<Node> itnodes = new LinkedList<Node>();
+        for (OsmPrimitive osm : sel)
+            if (osm instanceof Node) {
+                nodes.add((Node)osm);
+                itnodes.add((Node)osm);
+            }
+        // special case if no single nodes are selected and exactly one way is:
+        // then use the way's nodes
+        if ((nodes.size() == 0) && (sel.size() == 1))
+            for (OsmPrimitive osm : sel)
+                if (osm instanceof Way) {
+                    nodes.addAll(((Way)osm).nodes);
+                    itnodes.addAll(((Way)osm).nodes);
+                }
+
+        if (nodes.size() < 3) {
+            JOptionPane.showMessageDialog(Main.parent, tr("Please select at least three nodes."));
+            return;
+        }
+
+        // Find from the selected nodes two that are the furthest apart.
+        // Let's call them A and B.
+        double distance = 0;
+
+        Node nodea = null;
+        Node nodeb = null;
+
+        for (Node n : nodes) {
+            itnodes.remove(n);
+            for (Node m : itnodes) {
+                double dist = Math.sqrt(n.eastNorth.distance(m.eastNorth));
+                if (dist > distance) {
+                    nodea = n;
+                    nodeb = m;
+                    distance = dist;
+                }
+            }
+        }
+
+        // Remove the nodes A and B from the list of nodes to move
+        nodes.remove(nodea);
+        nodes.remove(nodeb);
+
+        // Find out co-ords of A and B
+        double ax = nodea.eastNorth.east();
+        double ay = nodea.eastNorth.north();
+        double bx = nodeb.eastNorth.east();
+        double by = nodeb.eastNorth.north();
+
+        // A list of commands to do
+        Collection<Command> cmds = new LinkedList<Command>();
+
+        // Amount of nodes between A and B plus 1
+        int num = nodes.size()+1;
+
+        // Current number of node
+        int pos = 0;
+        while (nodes.size() > 0) {
+            pos++;
+            Node s = null;
+
+            // Find the node that is furthest from B (i.e. closest to A)
+            distance = 0.0;
+            for (Node n : nodes) {
+                double dist = Math.sqrt(nodeb.eastNorth.distance(n.eastNorth));
+                if (dist > distance) {
+                    s = n;
+                    distance = dist;
+                }
+            }
+
+            // First move the node to A's position, then move it towards B
+            double dx = ax - s.eastNorth.east() + (bx-ax)*pos/num;
+            double dy = ay - s.eastNorth.north() + (by-ay)*pos/num;
+
+            cmds.add(new MoveCommand(s, dx, dy));
+
+            //remove moved node from the list
+            nodes.remove(s);
+        }
+
+        // Do it!
+        Main.main.undoRedo.add(new SequenceCommand(tr("Distribute Nodes"), cmds));
+        Main.map.repaint();
+    }
+}

src/org/openstreetmap/josm/gui/MainMenu.java

@@ -26 +26 @@
 import org.openstreetmap.josm.actions.CopyAction;
 import org.openstreetmap.josm.actions.CreateCircleAction;
 import org.openstreetmap.josm.actions.DeleteAction;
+import org.openstreetmap.josm.actions.DistributeAction;
 import org.openstreetmap.josm.actions.DownloadAction;
 import org.openstreetmap.josm.actions.DuplicateAction;
 import org.openstreetmap.josm.actions.ExitAction;
@@ -108 +109 @@
     public final JosmAction reverseWay = new ReverseWayAction();
     public final JosmAction alignInCircle = new AlignInCircleAction();
     public final JosmAction alignInLine = new AlignInLineAction();
+    public final JosmAction distribute = new DistributeAction();
     public final JosmAction ortho = new OrthogonalizeAction();
     public final AddNodeAction addnode = new AddNodeAction();
     public final JosmAction createCircle = new CreateCircleAction();
@@ -231 +233 @@
         toolsMenu.addSeparator();
         add(toolsMenu, alignInCircle);
         add(toolsMenu, alignInLine);
+        add(toolsMenu, distribute);
         add(toolsMenu, ortho);
         toolsMenu.addSeparator();
         add(toolsMenu, addnode);