[6380] | 1 | // License: GPL. For details, see LICENSE file.
|
---|
[626] | 2 | package org.openstreetmap.josm.actions;
|
---|
| 3 |
|
---|
[4558] | 4 | import static org.openstreetmap.josm.gui.help.HelpUtil.ht;
|
---|
[626] | 5 | import static org.openstreetmap.josm.tools.I18n.tr;
|
---|
| 6 |
|
---|
| 7 | import java.awt.event.ActionEvent;
|
---|
| 8 | import java.awt.event.KeyEvent;
|
---|
[4558] | 9 | import java.util.ArrayList;
|
---|
[626] | 10 | import java.util.Collection;
|
---|
[6893] | 11 | import java.util.HashMap;
|
---|
| 12 | import java.util.HashSet;
|
---|
[4558] | 13 | import java.util.List;
|
---|
[7850] | 14 | import java.util.Map;
|
---|
| 15 | import java.util.Set;
|
---|
[626] | 16 |
|
---|
| 17 | import javax.swing.JOptionPane;
|
---|
| 18 |
|
---|
| 19 | import org.openstreetmap.josm.Main;
|
---|
| 20 | import org.openstreetmap.josm.command.Command;
|
---|
| 21 | import org.openstreetmap.josm.command.MoveCommand;
|
---|
| 22 | import org.openstreetmap.josm.command.SequenceCommand;
|
---|
[6961] | 23 | import org.openstreetmap.josm.data.coor.EastNorth;
|
---|
[10382] | 24 | import org.openstreetmap.josm.data.osm.DataSet;
|
---|
[626] | 25 | import org.openstreetmap.josm.data.osm.Node;
|
---|
| 26 | import org.openstreetmap.josm.data.osm.OsmPrimitive;
|
---|
[600] | 27 | import org.openstreetmap.josm.data.osm.Way;
|
---|
[6130] | 28 | import org.openstreetmap.josm.gui.Notification;
|
---|
[1084] | 29 | import org.openstreetmap.josm.tools.Shortcut;
|
---|
[626] | 30 |
|
---|
| 31 | /**
|
---|
[7850] | 32 | * Aligns all selected nodes into a straight line (useful for roads that should be straight, but have side roads and
|
---|
[626] | 33 | * therefore need multiple nodes)
|
---|
[1023] | 34 | *
|
---|
[7850] | 35 | * <pre>
|
---|
| 36 | * Case 1: 1 or 2 ways selected and no nodes selected: align nodes of ways taking care of intersection.
|
---|
| 37 | * Case 2: Single node selected and no ways selected: align this node relative to all referrer ways (2 at most).
|
---|
| 38 | * Case 3: Single node and ways selected: align this node relative to selected ways.
|
---|
| 39 | * Case 4.1: Only nodes selected, part of a non-closed way: align these nodes on the line passing through the
|
---|
| 40 | * extremity nodes (most distant in the way sequence). See https://josm.openstreetmap.de/ticket/9605#comment:3
|
---|
[8459] | 41 | * Case 4.2: Only nodes selected, part of a closed way: align these nodes on the line passing through the most distant nodes.
|
---|
| 42 | * Case 4.3: Only nodes selected, part of multiple ways: align these nodes on the line passing through the most distant nodes.
|
---|
[7850] | 43 | * </pre>
|
---|
[6961] | 44 | *
|
---|
[626] | 45 | * @author Matthew Newton
|
---|
| 46 | */
|
---|
| 47 | public final class AlignInLineAction extends JosmAction {
|
---|
| 48 |
|
---|
[6316] | 49 | /**
|
---|
| 50 | * Constructs a new {@code AlignInLineAction}.
|
---|
| 51 | */
|
---|
[1169] | 52 | public AlignInLineAction() {
|
---|
[1212] | 53 | super(tr("Align Nodes in Line"), "alignline", tr("Move the selected nodes in to a line."),
|
---|
[4982] | 54 | Shortcut.registerShortcut("tools:alignline", tr("Tool: {0}", tr("Align Nodes in Line")), KeyEvent.VK_L, Shortcut.DIRECT), true);
|
---|
[2323] | 55 | putValue("help", ht("/Action/AlignInLine"));
|
---|
[1169] | 56 | }
|
---|
[626] | 57 |
|
---|
[6894] | 58 | /**
|
---|
[10347] | 59 | * InvalidSelection exception has to be raised when action can't be performed
|
---|
[6961] | 60 | */
|
---|
[10347] | 61 | static class InvalidSelection extends Exception {
|
---|
[6961] | 62 |
|
---|
| 63 | /**
|
---|
| 64 | * Create an InvalidSelection exception with default message
|
---|
| 65 | */
|
---|
[8836] | 66 | InvalidSelection() {
|
---|
[6961] | 67 | super(tr("Please select at least three nodes."));
|
---|
| 68 | }
|
---|
| 69 |
|
---|
| 70 | /**
|
---|
| 71 | * Create an InvalidSelection exception with specific message
|
---|
[10347] | 72 | * @param msg Message that will be displayed to the user
|
---|
[6961] | 73 | */
|
---|
[8836] | 74 | InvalidSelection(String msg) {
|
---|
[6961] | 75 | super(msg);
|
---|
| 76 | }
|
---|
| 77 | }
|
---|
| 78 |
|
---|
| 79 | /**
|
---|
[7850] | 80 | * Return 2 nodes making up the line along which provided nodes must be aligned.
|
---|
| 81 | *
|
---|
| 82 | * @param nodes Nodes to be aligned.
|
---|
| 83 | * @return A array of two nodes.
|
---|
[9087] | 84 | * @throws IllegalArgumentException if nodes is empty
|
---|
[6894] | 85 | */
|
---|
[8870] | 86 | private static Node[] nodePairFurthestApart(List<Node> nodes) {
|
---|
[7850] | 87 | // Detect if selected nodes are on the same way.
|
---|
| 88 |
|
---|
| 89 | // Get ways passing though all selected nodes.
|
---|
| 90 | Set<Way> waysRef = null;
|
---|
[8510] | 91 | for (Node n: nodes) {
|
---|
[6894] | 92 | Collection<Way> ref = OsmPrimitive.getFilteredList(n.getReferrers(), Way.class);
|
---|
[8510] | 93 | if (waysRef == null)
|
---|
[7005] | 94 | waysRef = new HashSet<>(ref);
|
---|
[6894] | 95 | else
|
---|
| 96 | waysRef.retainAll(ref);
|
---|
| 97 | }
|
---|
[7850] | 98 |
|
---|
[9087] | 99 | if (waysRef == null) {
|
---|
| 100 | throw new IllegalArgumentException();
|
---|
| 101 | }
|
---|
| 102 |
|
---|
[7850] | 103 | // Nodes belongs to multiple ways, return most distant nodes.
|
---|
| 104 | if (waysRef.size() != 1)
|
---|
| 105 | return nodeFurthestAppart(nodes);
|
---|
| 106 |
|
---|
| 107 | // All nodes are part of the same way. See #9605.
|
---|
| 108 | Way way = waysRef.iterator().next();
|
---|
| 109 |
|
---|
| 110 | if (way.isClosed()) {
|
---|
| 111 | // Align these nodes on the line passing through the most distant nodes.
|
---|
| 112 | return nodeFurthestAppart(nodes);
|
---|
| 113 | }
|
---|
| 114 |
|
---|
[8459] | 115 | Node nodea = null;
|
---|
| 116 | Node nodeb = null;
|
---|
| 117 |
|
---|
[7850] | 118 | // The way is open, align nodes on the line passing through the extremity nodes (most distant in the way
|
---|
| 119 | // sequence). See #9605#comment:3.
|
---|
| 120 | Set<Node> remainNodes = new HashSet<>(nodes);
|
---|
| 121 | for (Node n : way.getNodes()) {
|
---|
| 122 | if (!remainNodes.contains(n))
|
---|
| 123 | continue;
|
---|
| 124 | if (nodea == null)
|
---|
| 125 | nodea = n;
|
---|
| 126 | if (remainNodes.size() == 1) {
|
---|
| 127 | nodeb = remainNodes.iterator().next();
|
---|
| 128 | break;
|
---|
[1169] | 129 | }
|
---|
[7850] | 130 | remainNodes.remove(n);
|
---|
| 131 | }
|
---|
| 132 |
|
---|
[8443] | 133 | return new Node[] {nodea, nodeb};
|
---|
[7850] | 134 | }
|
---|
| 135 |
|
---|
| 136 | /**
|
---|
| 137 | * Return the two nodes the most distant from the provided list.
|
---|
| 138 | *
|
---|
| 139 | * @param nodes List of nodes to analyze.
|
---|
| 140 | * @return An array containing the two most distant nodes.
|
---|
| 141 | */
|
---|
[8870] | 142 | private static Node[] nodeFurthestAppart(List<Node> nodes) {
|
---|
[7850] | 143 | Node node1 = null, node2 = null;
|
---|
| 144 | double minSqDistance = 0;
|
---|
| 145 | int nb;
|
---|
| 146 |
|
---|
| 147 | nb = nodes.size();
|
---|
| 148 | for (int i = 0; i < nb - 1; i++) {
|
---|
| 149 | Node n = nodes.get(i);
|
---|
| 150 | for (int j = i + 1; j < nb; j++) {
|
---|
| 151 | Node m = nodes.get(j);
|
---|
| 152 | double sqDist = n.getEastNorth().distanceSq(m.getEastNorth());
|
---|
| 153 | if (sqDist > minSqDistance) {
|
---|
| 154 | node1 = n;
|
---|
| 155 | node2 = m;
|
---|
| 156 | minSqDistance = sqDist;
|
---|
[6894] | 157 | }
|
---|
| 158 | }
|
---|
[1169] | 159 | }
|
---|
[7850] | 160 |
|
---|
[8443] | 161 | return new Node[] {node1, node2};
|
---|
[4558] | 162 | }
|
---|
[626] | 163 |
|
---|
[4558] | 164 | /**
|
---|
| 165 | * Operation depends on the selected objects:
|
---|
| 166 | */
|
---|
[6084] | 167 | @Override
|
---|
[4558] | 168 | public void actionPerformed(ActionEvent e) {
|
---|
| 169 | if (!isEnabled())
|
---|
| 170 | return;
|
---|
| 171 |
|
---|
[10382] | 172 | DataSet ds = getLayerManager().getEditDataSet();
|
---|
| 173 | List<Node> selectedNodes = new ArrayList<>(ds.getSelectedNodes());
|
---|
| 174 | List<Way> selectedWays = new ArrayList<>(ds.getSelectedWays());
|
---|
[4558] | 175 |
|
---|
[6961] | 176 | try {
|
---|
[10308] | 177 | Command cmd;
|
---|
[8342] | 178 | // Decide what to align based on selection:
|
---|
[4558] | 179 |
|
---|
[8510] | 180 | if (selectedNodes.isEmpty() && !selectedWays.isEmpty()) {
|
---|
[8342] | 181 | // Only ways selected -> For each way align their nodes taking care of intersection
|
---|
[6961] | 182 | cmd = alignMultiWay(selectedWays);
|
---|
[8510] | 183 | } else if (selectedNodes.size() == 1) {
|
---|
[8342] | 184 | // Only 1 node selected -> align this node relative to referers way
|
---|
[6961] | 185 | Node selectedNode = selectedNodes.get(0);
|
---|
[10308] | 186 | List<Way> involvedWays;
|
---|
[8510] | 187 | if (selectedWays.isEmpty())
|
---|
[8342] | 188 | // No selected way, all way containing this node are used
|
---|
[6961] | 189 | involvedWays = OsmPrimitive.getFilteredList(selectedNode.getReferrers(), Way.class);
|
---|
| 190 | else
|
---|
[8342] | 191 | // Selected way, use only these ways
|
---|
[6961] | 192 | involvedWays = selectedWays;
|
---|
| 193 | List<Line> lines = getInvolvedLines(selectedNode, involvedWays);
|
---|
[8510] | 194 | if (lines.size() > 2 || lines.isEmpty())
|
---|
[6961] | 195 | throw new InvalidSelection();
|
---|
| 196 | cmd = alignSingleNode(selectedNodes.get(0), lines);
|
---|
[8510] | 197 | } else if (selectedNodes.size() >= 3) {
|
---|
[8342] | 198 | // More than 3 nodes and way(s) selected -> align selected nodes. Don't care of way(s).
|
---|
[6961] | 199 | cmd = alignOnlyNodes(selectedNodes);
|
---|
[8342] | 200 | } else {
|
---|
| 201 | // All others cases are invalid
|
---|
[6961] | 202 | throw new InvalidSelection();
|
---|
| 203 | }
|
---|
[4558] | 204 |
|
---|
[6961] | 205 | // Do it!
|
---|
| 206 | Main.main.undoRedo.add(cmd);
|
---|
| 207 |
|
---|
| 208 | } catch (InvalidSelection except) {
|
---|
[10463] | 209 | Main.debug(except);
|
---|
[6961] | 210 | new Notification(except.getMessage())
|
---|
| 211 | .setIcon(JOptionPane.INFORMATION_MESSAGE)
|
---|
| 212 | .show();
|
---|
[4558] | 213 | }
|
---|
[6961] | 214 | }
|
---|
[4558] | 215 |
|
---|
[6961] | 216 | /**
|
---|
[7850] | 217 | * Align nodes in case 3 or more nodes are selected.
|
---|
[6961] | 218 | *
|
---|
[7850] | 219 | * @param nodes Nodes to be aligned.
|
---|
| 220 | * @return Command that perform action.
|
---|
| 221 | * @throws InvalidSelection If the nodes have same coordinates.
|
---|
[6961] | 222 | */
|
---|
[8870] | 223 | private static Command alignOnlyNodes(List<Node> nodes) throws InvalidSelection {
|
---|
[7850] | 224 | // Choose nodes used as anchor points for projection.
|
---|
| 225 | Node[] anchors = nodePairFurthestApart(nodes);
|
---|
[7005] | 226 | Collection<Command> cmds = new ArrayList<>(nodes.size());
|
---|
[6961] | 227 | Line line = new Line(anchors[0], anchors[1]);
|
---|
[8513] | 228 | for (Node node: nodes) {
|
---|
[8510] | 229 | if (node != anchors[0] && node != anchors[1])
|
---|
[6961] | 230 | cmds.add(line.projectionCommand(node));
|
---|
[8513] | 231 | }
|
---|
[6961] | 232 | return new SequenceCommand(tr("Align Nodes in Line"), cmds);
|
---|
[4558] | 233 | }
|
---|
| 234 |
|
---|
[6893] | 235 | /**
|
---|
| 236 | * Align way in case of multiple way #6819
|
---|
| 237 | * @param ways Collection of way to align
|
---|
[6961] | 238 | * @return Command that perform action
|
---|
[8459] | 239 | * @throws InvalidSelection if a polygon is selected, or if a node is used by 3 or more ways
|
---|
[6893] | 240 | */
|
---|
[8870] | 241 | private static Command alignMultiWay(Collection<Way> ways) throws InvalidSelection {
|
---|
[6893] | 242 | // Collect all nodes and compute line equation
|
---|
[7850] | 243 | Set<Node> nodes = new HashSet<>();
|
---|
| 244 | Map<Way, Line> lines = new HashMap<>();
|
---|
[8460] | 245 | for (Way w: ways) {
|
---|
| 246 | if (w.isClosed())
|
---|
[6961] | 247 | throw new InvalidSelection(tr("Can not align a polygon. Abort."));
|
---|
[6893] | 248 | nodes.addAll(w.getNodes());
|
---|
| 249 | lines.put(w, new Line(w));
|
---|
| 250 | }
|
---|
[7005] | 251 | Collection<Command> cmds = new ArrayList<>(nodes.size());
|
---|
| 252 | List<Way> referers = new ArrayList<>(ways.size());
|
---|
[8460] | 253 | for (Node n: nodes) {
|
---|
[6893] | 254 | referers.clear();
|
---|
[8513] | 255 | for (OsmPrimitive o: n.getReferrers()) {
|
---|
[8460] | 256 | if (ways.contains(o))
|
---|
[6893] | 257 | referers.add((Way) o);
|
---|
[8513] | 258 | }
|
---|
[8460] | 259 | if (referers.size() == 1) {
|
---|
[6893] | 260 | Way way = referers.get(0);
|
---|
[8460] | 261 | if (way.isFirstLastNode(n)) continue;
|
---|
[6893] | 262 | cmds.add(lines.get(way).projectionCommand(n));
|
---|
[8460] | 263 | } else if (referers.size() == 2) {
|
---|
[6893] | 264 | Command cmd = lines.get(referers.get(0)).intersectionCommand(n, lines.get(referers.get(1)));
|
---|
| 265 | cmds.add(cmd);
|
---|
[8342] | 266 | } else
|
---|
[6961] | 267 | throw new InvalidSelection(tr("Intersection of three or more ways can not be solved. Abort."));
|
---|
[6893] | 268 | }
|
---|
[6961] | 269 | return new SequenceCommand(tr("Align Nodes in Line"), cmds);
|
---|
[6893] | 270 | }
|
---|
| 271 |
|
---|
| 272 | /**
|
---|
[6961] | 273 | * Get lines useful to do alignment of a single node
|
---|
| 274 | * @param node Node to be aligned
|
---|
| 275 | * @param refWays Ways where useful lines will be searched
|
---|
| 276 | * @return List of useful lines
|
---|
[8459] | 277 | * @throws InvalidSelection if a node got more than 4 neighbours (self-crossing way)
|
---|
[6893] | 278 | */
|
---|
[8870] | 279 | private static List<Line> getInvolvedLines(Node node, List<Way> refWays) throws InvalidSelection {
|
---|
[7850] | 280 | List<Line> lines = new ArrayList<>();
|
---|
| 281 | List<Node> neighbors = new ArrayList<>();
|
---|
[8510] | 282 | for (Way way: refWays) {
|
---|
[6961] | 283 | List<Node> nodes = way.getNodes();
|
---|
| 284 | neighbors.clear();
|
---|
[8513] | 285 | for (int i = 1; i < nodes.size()-1; i++) {
|
---|
[8510] | 286 | if (nodes.get(i) == node) {
|
---|
[6961] | 287 | neighbors.add(nodes.get(i-1));
|
---|
| 288 | neighbors.add(nodes.get(i+1));
|
---|
| 289 | }
|
---|
[8513] | 290 | }
|
---|
[8510] | 291 | if (neighbors.isEmpty())
|
---|
[6961] | 292 | continue;
|
---|
[8510] | 293 | else if (neighbors.size() == 2)
|
---|
[6961] | 294 | // Non self crossing
|
---|
| 295 | lines.add(new Line(neighbors.get(0), neighbors.get(1)));
|
---|
[8510] | 296 | else if (neighbors.size() == 4) {
|
---|
[6961] | 297 | // Self crossing, have to make 2 lines with 4 neighbors
|
---|
| 298 | // see #9081 comment 6
|
---|
| 299 | EastNorth c = node.getEastNorth();
|
---|
| 300 | double[] angle = new double[4];
|
---|
[8510] | 301 | for (int i = 0; i < 4; i++) {
|
---|
[6961] | 302 | EastNorth p = neighbors.get(i).getEastNorth();
|
---|
| 303 | angle[i] = Math.atan2(p.north() - c.north(), p.east() - c.east());
|
---|
| 304 | }
|
---|
| 305 | double[] deltaAngle = new double[3];
|
---|
[8510] | 306 | for (int i = 0; i < 3; i++) {
|
---|
[6961] | 307 | deltaAngle[i] = angle[i+1] - angle[0];
|
---|
[8510] | 308 | if (deltaAngle[i] < 0)
|
---|
[6961] | 309 | deltaAngle[i] += 2*Math.PI;
|
---|
| 310 | }
|
---|
| 311 | int nb = 0;
|
---|
[8510] | 312 | if (deltaAngle[1] < deltaAngle[0]) nb++;
|
---|
| 313 | if (deltaAngle[2] < deltaAngle[0]) nb++;
|
---|
| 314 | if (nb == 1) {
|
---|
[6961] | 315 | // Align along [neighbors[0], neighbors[1]] and [neighbors[0], neighbors[2]]
|
---|
| 316 | lines.add(new Line(neighbors.get(0), neighbors.get(1)));
|
---|
| 317 | lines.add(new Line(neighbors.get(2), neighbors.get(3)));
|
---|
| 318 | } else {
|
---|
| 319 | // Align along [neighbors[0], neighbors[2]] and [neighbors[1], neighbors[3]]
|
---|
| 320 | lines.add(new Line(neighbors.get(0), neighbors.get(2)));
|
---|
| 321 | lines.add(new Line(neighbors.get(1), neighbors.get(3)));
|
---|
| 322 | }
|
---|
| 323 | } else
|
---|
[8459] | 324 | throw new InvalidSelection("cannot treat more than 4 neighbours, got "+neighbors.size());
|
---|
[6961] | 325 | }
|
---|
| 326 | return lines;
|
---|
| 327 | }
|
---|
| 328 |
|
---|
| 329 | /**
|
---|
| 330 | * Align a single node relative to a set of lines #9081
|
---|
| 331 | * @param node Node to be aligned
|
---|
| 332 | * @param lines Lines to align node on
|
---|
| 333 | * @return Command that perform action
|
---|
[8459] | 334 | * @throws InvalidSelection if more than 2 lines
|
---|
[6961] | 335 | */
|
---|
[8870] | 336 | private static Command alignSingleNode(Node node, List<Line> lines) throws InvalidSelection {
|
---|
[8510] | 337 | if (lines.size() == 1)
|
---|
[6961] | 338 | return lines.get(0).projectionCommand(node);
|
---|
[8510] | 339 | else if (lines.size() == 2)
|
---|
[10378] | 340 | return lines.get(0).intersectionCommand(node, lines.get(1));
|
---|
[6961] | 341 | throw new InvalidSelection();
|
---|
| 342 | }
|
---|
| 343 |
|
---|
| 344 | /**
|
---|
| 345 | * Class that represent a line
|
---|
| 346 | */
|
---|
[10347] | 347 | static class Line {
|
---|
[6893] | 348 |
|
---|
| 349 | /**
|
---|
| 350 | * Line equation ax + by + c = 0
|
---|
| 351 | * Such as a^2 + b^2 = 1, ie (-b, a) is a unit vector of line
|
---|
| 352 | */
|
---|
[6961] | 353 | private double a, b, c;
|
---|
[6893] | 354 | /**
|
---|
[6961] | 355 | * (xM, yM) are coordinates of a point of the line
|
---|
[6893] | 356 | */
|
---|
[6961] | 357 | private double xM, yM;
|
---|
[6893] | 358 |
|
---|
| 359 | /**
|
---|
[6961] | 360 | * Init a line by 2 nodes.
|
---|
[8459] | 361 | * @param first One point of the line
|
---|
[6961] | 362 | * @param last Other point of the line
|
---|
[8459] | 363 | * @throws InvalidSelection if nodes have same coordinates
|
---|
[6893] | 364 | */
|
---|
[8836] | 365 | Line(Node first, Node last) throws InvalidSelection {
|
---|
[6961] | 366 | xM = first.getEastNorth().getX();
|
---|
| 367 | yM = first.getEastNorth().getY();
|
---|
| 368 | double xB = last.getEastNorth().getX();
|
---|
| 369 | double yB = last.getEastNorth().getY();
|
---|
[6893] | 370 | a = yB - yM;
|
---|
| 371 | b = xM - xB;
|
---|
| 372 | double norm = Math.sqrt(a*a + b*b);
|
---|
[8393] | 373 | if (norm == 0)
|
---|
[8459] | 374 | throw new InvalidSelection("Nodes have same coordinates!");
|
---|
[6893] | 375 | a /= norm;
|
---|
| 376 | b /= norm;
|
---|
| 377 | c = -(a*xM + b*yM);
|
---|
| 378 | }
|
---|
| 379 |
|
---|
| 380 | /**
|
---|
[6961] | 381 | * Init a line equation from a way.
|
---|
| 382 | * @param way Use extremity of this way to compute line equation
|
---|
[8459] | 383 | * @throws InvalidSelection if nodes have same coordinates
|
---|
[6961] | 384 | */
|
---|
[8836] | 385 | Line(Way way) throws InvalidSelection {
|
---|
[6961] | 386 | this(way.firstNode(), way.lastNode());
|
---|
| 387 | }
|
---|
| 388 |
|
---|
| 389 | /**
|
---|
[6893] | 390 | * Orthogonal projection of a node N along this line.
|
---|
| 391 | * @param n Node to be projected
|
---|
| 392 | * @return The command that do the projection of this node
|
---|
| 393 | */
|
---|
| 394 | public Command projectionCommand(Node n) {
|
---|
| 395 | double s = (xM - n.getEastNorth().getX()) * a + (yM - n.getEastNorth().getY()) * b;
|
---|
| 396 | return new MoveCommand(n, a*s, b*s);
|
---|
| 397 | }
|
---|
| 398 |
|
---|
| 399 | /**
|
---|
| 400 | * Intersection of two line.
|
---|
| 401 | * @param n Node to move to the intersection
|
---|
| 402 | * @param other Second line for intersection
|
---|
[6961] | 403 | * @return The command that move the node
|
---|
[8459] | 404 | * @throws InvalidSelection if two parallels ways found
|
---|
[6893] | 405 | */
|
---|
[6961] | 406 | public Command intersectionCommand(Node n, Line other) throws InvalidSelection {
|
---|
[6893] | 407 | double d = this.a * other.b - other.a * this.b;
|
---|
[8510] | 408 | if (Math.abs(d) < 10e-6)
|
---|
[6961] | 409 | // parallels lines
|
---|
| 410 | throw new InvalidSelection(tr("Two parallels ways found. Abort."));
|
---|
[6893] | 411 | double x = (this.b * other.c - other.b * this.c) / d;
|
---|
| 412 | double y = (other.a * this.c - this.a * other.c) / d;
|
---|
| 413 | return new MoveCommand(n, x - n.getEastNorth().getX(), y - n.getEastNorth().getY());
|
---|
| 414 | }
|
---|
| 415 | }
|
---|
| 416 |
|
---|
[1820] | 417 | @Override
|
---|
| 418 | protected void updateEnabledState() {
|
---|
[10382] | 419 | DataSet ds = getLayerManager().getEditDataSet();
|
---|
[10383] | 420 | setEnabled(ds != null && !ds.selectionEmpty());
|
---|
[1820] | 421 | }
|
---|
[2256] | 422 |
|
---|
| 423 | @Override
|
---|
| 424 | protected void updateEnabledState(Collection<? extends OsmPrimitive> selection) {
|
---|
| 425 | setEnabled(selection != null && !selection.isEmpty());
|
---|
| 426 | }
|
---|
[626] | 427 | }
|
---|