Changeset 7005 in josm for trunk/src/org/openstreetmap/josm/actions/downloadtasks/DownloadReferrersTask.java

Timestamp:

2014-04-26T17:39:23+02:00 (10 years ago)

Author:

Don-vip

Message:

see #8465 - use diamond operator where applicable

File:

• trunk/src/org/openstreetmap/josm/actions/downloadtasks/DownloadReferrersTask.java (modified) (5 diffs)

trunk/src/org/openstreetmap/josm/actions/downloadtasks/DownloadReferrersTask.java

@@ -62 +62 @@
         CheckParameterUtil.ensureParameterNotNull(targetLayer, "targetLayer");
         canceled = false;
-        this.children = new HashMap<Long, OsmPrimitiveType>();
+        this.children = new HashMap<>();
         if (children != null) {
             for (OsmPrimitive p: children) {
@@ -85 +85 @@
         CheckParameterUtil.ensureParameterNotNull(targetLayer, "targetLayer");
         canceled = false;
-        this.children = new HashMap<Long, OsmPrimitiveType>();
+        this.children = new HashMap<>();
         if (children != null) {
             for (Entry<Long, OsmPrimitiveType> entry : children.entrySet()) {
@@ -115 +115 @@
         CheckParameterUtil.ensureParameterNotNull(type, "type");
         canceled = false;
-        this.children = new HashMap<Long, OsmPrimitiveType>();
+        this.children = new HashMap<>();
         this.children.put(id, type);
         this.targetLayer = targetLayer;
@@ -151 +151 @@
             throw new IllegalArgumentException(MessageFormat.format("Cannot download referrers for new primitives (ID {0})", primitiveId.getUniqueId()));
         canceled = false;
-        this.children = new HashMap<Long, OsmPrimitiveType>();
+        this.children = new HashMap<>();
         this.children.put(primitiveId.getUniqueId(), primitiveId.getType());
         this.targetLayer = targetLayer;
@@ -215 +215 @@
         DataSetMerger merger;
         if (!ways.isEmpty()) {
-            Set<Node> nodes = new HashSet<Node>();
+            Set<Node> nodes = new HashSet<>();
             for (Way w: ways) {
                 // Ensure each node is only listed once