Changeset 4684 in josm for trunk/src/org/openstreetmap/josm/data

Timestamp:

2011-12-21T12:58:59+01:00 (12 years ago)

Author:

Don-vip

Message:

see #7159 - Layer merging performance

Location:

trunk/src/org/openstreetmap/josm/data/osm

Files:

• AbstractPrimitive.java (modified) (1 diff)
• DataSetMerger.java (modified) (4 diffs)
• OsmPrimitive.java (modified) (1 diff)

trunk/src/org/openstreetmap/josm/data/osm/AbstractPrimitive.java

@@ -648 +648 @@
      */
     public boolean hasSameTags(OsmPrimitive other) {
-        return getKeys().equals(other.getKeys());
+        // We cannot directly use Arrays.equals(keys, other.keys) as keys is not ordered by key
+        // but we can at least check if both arrays are null or of the same size before creating 
+        // and comparing the key maps (costly operation, see #7159)
+        return (keys == null && other.keys == null) 
+            || (keys != null && other.keys != null && keys.length == other.keys.length && (keys.length == 0 || getKeys().equals(other.getKeys())));
     }
 

trunk/src/org/openstreetmap/josm/data/osm/DataSetMerger.java

@@ -16 +16 @@
 import org.openstreetmap.josm.data.conflict.Conflict;
 import org.openstreetmap.josm.data.conflict.ConflictCollection;
+import org.openstreetmap.josm.gui.progress.ProgressMonitor;
 import org.openstreetmap.josm.tools.CheckParameterUtil;
 
@@ -77 +78 @@
      * @param source  the other primitive
      */
-    protected void mergePrimitive(OsmPrimitive source) {
+    protected void mergePrimitive(OsmPrimitive source, Collection<? extends OsmPrimitive> candidates) {
         if (!source.isNew() ) {
             // try to merge onto a matching primitive with the same
@@ -94 +95 @@
             // yet but which is equal in its semantic attributes
             //
-            Collection<? extends OsmPrimitive> candidates = null;
-            switch (source.getType()) {
-            case NODE: candidates = targetDataSet.getNodes(); break;
-            case WAY: candidates  = targetDataSet.getWays(); break;
-            case RELATION: candidates = targetDataSet.getRelations(); break;
-            default: throw new AssertionError();
-            }
             for (OsmPrimitive target : candidates) {
                 if (!target.isNew() || target.isDeleted()) {
@@ -382 +376 @@
      */
     public void merge() {
+        merge(null);
+    }
+
+    /**
+     * Runs the merge operation. Successfully merged {@see OsmPrimitive}s are in
+     * {@see #getMyDataSet()}.
+     *
+     * See {@see #getConflicts()} for a map of conflicts after the merge operation.
+     */
+    public void merge(ProgressMonitor progressMonitor) {
         if (sourceDataSet == null)
             return;
+        if (progressMonitor != null) {
+            progressMonitor.beginTask(tr("Merging data..."), sourceDataSet.allPrimitives().size());
+        }
         targetDataSet.beginUpdate();
         try {
+                ArrayList<? extends OsmPrimitive> candidates = new ArrayList<Node>(targetDataSet.getNodes());
             for (Node node: sourceDataSet.getNodes()) {
-                mergePrimitive(node);
-            }
+                mergePrimitive(node, candidates);
+                if (progressMonitor != null) {
+                    progressMonitor.worked(1);
+                }
+            }
+            candidates.clear();
+            candidates = new ArrayList<Way>(targetDataSet.getWays());
             for (Way way: sourceDataSet.getWays()) {
-                mergePrimitive(way);
-            }
+                mergePrimitive(way, candidates);
+                if (progressMonitor != null) {
+                    progressMonitor.worked(1);
+                }
+            }
+            candidates.clear();
+            candidates = new ArrayList<Relation>(targetDataSet.getRelations());
             for (Relation relation: sourceDataSet.getRelations()) {
-                mergePrimitive(relation);
-            }
+                mergePrimitive(relation, candidates);
+                if (progressMonitor != null) {
+                    progressMonitor.worked(1);
+                }
+            }
+            candidates.clear();
             fixReferences();
         } finally {
             targetDataSet.endUpdate();
         }
+        if (progressMonitor != null) {
+            progressMonitor.finishTask();
+        }
     }
 

trunk/src/org/openstreetmap/josm/data/osm/OsmPrimitive.java

@@ -966 +966 @@
         if (!isNew() &&  id != other.id)
             return false;
-        if (isIncomplete() && ! other.isIncomplete() || !isIncomplete()  && other.isIncomplete())
+//        if (isIncomplete() && ! other.isIncomplete() || !isIncomplete()  && other.isIncomplete())
+        if (isIncomplete() ^ other.isIncomplete()) // exclusive or operator for performance (see #7159)
             return false;
         // can't do an equals check on the internal keys array because it is not ordered