Changeset 30532 in osm for applications/editors/josm/plugins/utilsplugin2/src/edu

Timestamp:

2014-07-14T04:18:06+02:00 (10 years ago)

Author:

donvip

Message:

[josm_plugins] fix compilation warnings

Location:

applications/editors/josm/plugins/utilsplugin2/src/edu/princeton/cs/algs4

Files:

• EdgeWeightedDigraph.java (modified) (6 diffs)
• IndexMinPQ.java (modified) (2 diffs)

applications/editors/josm/plugins/utilsplugin2/src/edu/princeton/cs/algs4/EdgeWeightedDigraph.java

@@ -21 +21 @@
  *  <i>Algorithms, 4th Edition</i> by Robert Sedgewick and Kevin Wayne.
  */
-
-
-
 public class EdgeWeightedDigraph {
     private final int V;
@@ -32 +29 @@
      * Create an empty edge-weighted digraph with V vertices.
      */
+    @SuppressWarnings("unchecked")
     public EdgeWeightedDigraph(int V) {
         if (V < 0) throw new RuntimeException("Number of vertices must be nonnegative");
@@ -102 +100 @@
     }
 
-
    /**
      * Add the edge e to this digraph.
@@ -111 +108 @@
         E++;
     }
-
 
    /**
@@ -144 +140 @@
     }
 
-
-
    /**
      * Return a string representation of this graph.
@@ -162 +156 @@
         return s.toString();
     }
-
-    /**
-     * Test client.
-     */
-//    public static void main(String[] args) {
-//        In in = new In(args[0]);
-//        EdgeWeightedDigraph G = new EdgeWeightedDigraph(in);
-//        StdOut.println(G);
-//    }
-
 }

applications/editors/josm/plugins/utilsplugin2/src/edu/princeton/cs/algs4/IndexMinPQ.java

@@ -19 +19 @@
     private Key[] keys;      // keys[i] = priority of i
 
+    @SuppressWarnings("unchecked")
     public IndexMinPQ(int NMAX) {
         keys = (Key[]) new Comparable[NMAX + 1];    // make this of length NMAX??
@@ -186 +187 @@
         }
     }
-
-
-//    public static void main(String[] args) {
-//        // insert a bunch of strings
-//        String[] strings = { "it", "was", "the", "best", "of", "times", "it", "was", "the", "worst" };
-//
-//        IndexMinPQ<String> pq = new IndexMinPQ<String>(strings.length);
-//        for (int i = 0; i < strings.length; i++) {
-//            pq.insert(i, strings[i]);
-//        }
-//
-//        // delete and print each key
-//        while (!pq.isEmpty()) {
-//            int i = pq.delMin();
-//            StdOut.println(i + " " + strings[i]);
-//        }
-//        StdOut.println();
-//
-//        // reinsert the same strings
-//        for (int i = 0; i < strings.length; i++) {
-//            pq.insert(i, strings[i]);
-//        }
-//
-//        // print each key using the iterator
-//        for (int i : pq) {
-//            StdOut.println(i + " " + strings[i]);
-//        }
-//        while (!pq.isEmpty()) {
-//            pq.delMin();
-//        }
-//
-//    }
 }