Changeset 2512 in josm for trunk/src/org/openstreetmap/josm/actions/CombineWayAction.java

Timestamp:

2009-11-24T10:45:04+01:00 (14 years ago)

Author:

stoecker

Message:

i18n updated, fixed files to reduce problems when applying patches, fix #4017

File:

• trunk/src/org/openstreetmap/josm/actions/CombineWayAction.java (modified) (10 diffs)

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

@@ -90 +90 @@
     }
 
-
     public void combineWays(Collection<Way> ways) {
 
@@ -219 +218 @@
      * This is a collection of relations referring to at least one out of a set of
      * ways.
-     * 
+     *
      *
      */
@@ -230 +229 @@
 
         /**
-         * 
+         *
          * @param ways  a collection of ways
          */
@@ -246 +245 @@
         /**
          * build the sets of referring relations from the relations in the dataset <code>ds</code>
-         * 
+         *
          * @param ds the data set
          */
@@ -273 +272 @@
         /**
          * Replies the set of referring relations
-         * 
+         *
          * @return the set of referring relations
          */
@@ -286 +285 @@
         /**
          * Replies the set of referring relations for a specific way
-         * 
+         *
          * @return the set of referring relations
          */
@@ -412 +411 @@
     }
 
-
     static public class NodeGraph {
         static public List<NodePair> buildNodePairs(Way way, boolean directed) {
@@ -480 +478 @@
         private HashMap<Node, List<NodePair>> successors;
         private HashMap<Node, List<NodePair>> predecessors;
-
 
         protected void rememberSuccessor(NodePair pair) {
@@ -612 +609 @@
         /**
          * Tries to find a spanning path starting from node <code>startNode</code>.
-         * 
+         *
          * Traverses the path in depth-first order.
-         * 
+         *
          * @param startNode the start node
          * @return the spanning path; null, if no path is found
@@ -641 +638 @@
          * Tries to find a path through the graph which visits each edge (i.e.
          * the segment of a way) exactly one.
-         * 
+         *
          * @return the path; null, if no path was found
          */