Changeset 30737 in osm for applications/editors/josm/plugins/michigan_left/src/MichiganLeft

Timestamp:

2014-10-18T23:07:52+02:00 (10 years ago)

Author:

donvip

Message:

[josm_plugins] fix Java 7 / unused code warnings

File:

• applications/editors/josm/plugins/michigan_left/src/MichiganLeft/MichiganLeft.java (modified) (6 diffs)

applications/editors/josm/plugins/michigan_left/src/MichiganLeft/MichiganLeft.java

@@ -42 +42 @@
          */
     private static final long serialVersionUID = 1L;
-    private LinkedList<Command> cmds = new LinkedList<Command>();
+    private LinkedList<Command> cmds = new LinkedList<>();
 
     public MichiganLeftAction() {
@@ -56 +56 @@
           .getSelected();
 
-      ArrayList<OsmPrimitive> selection = new ArrayList<OsmPrimitive>();
+      ArrayList<OsmPrimitive> selection = new ArrayList<>();
 
       for (OsmPrimitive prim: mainSelection) selection.add(prim);
@@ -74 +74 @@
       if (ways == 4) {
         // Find extremities of ways
-        Hashtable<Node, Integer> ExtremNodes = new Hashtable<Node, Integer>();
+        Hashtable<Node, Integer> ExtremNodes = new Hashtable<>();
         for (OsmPrimitive prim : selection) {
           if (prim instanceof Way) {
@@ -90 +90 @@
 
         // order the ways
-        ArrayList<Way> orderedWays = new ArrayList<Way>();
+        ArrayList<Way> orderedWays = new ArrayList<>();
         Way currentWay = (Way) selection.iterator().next();
         orderedWays.add((Way) currentWay);
@@ -130 +130 @@
       if (ways == 5) {
         // Find extremities of ways
-        Hashtable<Node, Integer> ExtremNodes = new Hashtable<Node, Integer>();
+        Hashtable<Node, Integer> ExtremNodes = new Hashtable<>();
         for (OsmPrimitive prim : selection) {
           if (prim instanceof Way) {
@@ -140 +140 @@
         // System.out.println(tr("{0} extrem nodes.", ExtremNodes.size()));
 
-        ArrayList<Node> viaNodes = new ArrayList<Node>();
+        ArrayList<Node> viaNodes = new ArrayList<>();
         // find via nodes (they have 3 occurences in the list)
         for (Enumeration<Node> enumKey = ExtremNodes.keys(); enumKey