Changeset 29854 in osm for applications/editors/josm/plugins/junctionchecking/src/org

Timestamp:

2013-08-21T03:47:16+02:00 (11 years ago)

Author:

donvip

Message:

[josm_plugins] fix #8987 - bump min JOSM version of nearly all plugins to r6162 + code update/cleanup, fix warnings

Location:

applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker

Files:

• connectedness/DiGraphSealer.java (modified) (6 diffs)
• converting/PseudoChannelRemover.java (modified) (3 diffs)
• converting/TurnRestrictionChecker.java (modified) (2 diffs)
• datastructure/OSMRelation.java (modified) (1 diff)
• junctionchecking/BackPropagation.java (modified) (2 diffs)
• junctionchecking/JMinimality.java (modified) (4 diffs)

applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/connectedness/DiGraphSealer.java

@@ -1 +1 @@
 package org.openstreetmap.josm.plugins.JunctionChecker.connectedness;
 
-import java.util.ArrayList;
 import java.util.Vector;
+
 import org.openstreetmap.josm.plugins.JunctionChecker.datastructure.Channel;
 import org.openstreetmap.josm.plugins.JunctionChecker.datastructure.ChannelDiGraph;
@@ -45 +45 @@
                         }
                 }
-                int counter = 0;
                 Channel tempChannel;
                 LeadsTo tempLeadsTo;
@@ -73 +72 @@
                                 newID++;
                                 digraph.addChannel(tempChannel);
-                                counter++;
                         }
                 }
@@ -103 +101 @@
                                 newID++;
                                 digraph.addChannel(tempChannel);
-                                counter++;
                         }
                 }
@@ -125 +122 @@
          */
         private void deleteDuplicateChannels() {
-                ArrayList<Integer> pointer = new ArrayList<Integer>();
 
                 for (int i = 0; i < digraph.getChannels().size(); i++) {
@@ -136 +132 @@
                                 }
                         }
-
                 }
         }

applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/converting/PseudoChannelRemover.java

@@ -13 +13 @@
 
         private final ChannelDiGraph digraph;
-        private final ArrayList<Channel> pseudochannels = new ArrayList<Channel>();
-        private int c = 0;
+        //private final ArrayList<Channel> pseudochannels = new ArrayList<Channel>();
         private Channel succChannel;
-        private String s;
         private Channel tempToChannel;
         private LeadsTo tempLeadsTo;
@@ -27 +25 @@
                 succChannel = tempchannel.getLeadsTo().get(0).getToChannel();
                 tempchannel.setToNode(succChannel.getToNode());
-                s = "";
                 //log.trace("---Folgender Channel ist überflüssig: " + succChannel.getNewid() + "---");
                 //log.trace("... und wird durch diesen ersetzt: " + tempchannel.getNewid());
@@ -57 +54 @@
                 digraph.removeChannel(succChannel);
                 //pseudochannels.add(tempchannel.getSuccChannels().get(0));
-                c++;
         }
 

applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/converting/TurnRestrictionChecker.java

@@ -20 +20 @@
         private final ArrayList<OSMRelation> turnrestrictionsrelations = new ArrayList<OSMRelation>();
         private final ChannelDiGraph channelDigraph;
-        private final boolean isInturnrestriction;
         private int relationpointer;
         private LeadsTo tempLeadsTo;
@@ -35 +34 @@
                 }
                 this.channelDigraph = channelDigraph;
-                this.isInturnrestriction = false;
         }
 

applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/datastructure/OSMRelation.java

@@ -64 +64 @@
                 }
                 
-                public Class getType() {
+                public Class<? extends OSMEntity> getType() {
                         return member.getClass();
                 }

applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/junctionchecking/BackPropagation.java

@@ -11 +11 @@
 public class BackPropagation {
 
-        private Channel y;
-        private Channel z;
         private final ChannelDiGraph digraph;
 
@@ -25 +23 @@
          */
         public void backPropagation(Channel y, Channel z, Channel zstrich) {
-                this.y = y;
-                this.z = z;
                 for (int i = 0; i < z.getReachableNodes().size(); i++) {
                         y.addReachableNode(z.getReachableNodeAt(i));

applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/junctionchecking/JMinimality.java

@@ -30 +30 @@
         private long EEovern = 0;
         private final HashSet<Channel> subgraph = new HashSet<Channel>();//The candidate subgraph to be tested
-        private double durchlauf = 1;
         private ProgressMonitor pm;
         private final boolean pmenabled;
-        private final ArrayList<Integer> anzahlchannels = new ArrayList<Integer>();
         private final ArrayList<HashSet<Channel>> junctions = new ArrayList<HashSet<Channel>>();
         private final boolean searchFirstJunction;
@@ -85 +83 @@
 
                 Combination c = new Combination(Grid.length, n);
-                EEovern = (int) c.Choose(Grid.length*Grid.length, n*n);
+                EEovern = (int) Combination.Choose(Grid.length*Grid.length, n*n);
                 long ans = c.Choose(); //This is the number of subcolumns to be generated
                 int[][] v; // this is a column variable containing n y-index entries plus true false values (0/1)
@@ -135 +133 @@
                 ArrayList<int[]> CandidateK = new ArrayList<int[]>(n*n); //saves the candidate K_{n-1} in entry-exit pairs
                 long lindex= 0;
-                int countk = 0;
                 int h = 0;
                 int m = 0;
@@ -188 +185 @@
                                         }
                                         if (missing <=1 && smallerjunction == true){//The k-subgrid is a different junction candidate satisfying total reachability
-                                                countk++;
                                                 CheckMinimal = CheckSmallJunction(CandidateK)==false;// If the candidate is a smaller junction, then minimality is false
-                                                durchlauf++;
                                                 //log.info("durchlauf: " + durchlauf + " Wert von CheckMinimal: " + CheckMinimal);
                                                 if (!CheckMinimal) {