- Timestamp:
- 2016-10-29T22:13:16+02:00 (8 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/src/org/openstreetmap/josm/actions/DistributeAction.java
r10467 r11187 211 211 // Find from the selected nodes two that are the furthest apart. 212 212 // Let's call them A and B. 213 double distance = 0;213 double distance = Double.NEGATIVE_INFINITY; 214 214 215 215 Node nodea = null; … … 256 256 257 257 // Find the node that is furthest from B (i.e. closest to A) 258 distance = 0.0;258 distance = Double.NEGATIVE_INFINITY; 259 259 for (Node n : nodes) { 260 260 double dist = Math.sqrt(nodeb.getEastNorth().distance(n.getEastNorth()));
Note:
See TracChangeset
for help on using the changeset viewer.