Index: /trunk/src/org/openstreetmap/josm/command/PurgeCommand.java
===================================================================
--- /trunk/src/org/openstreetmap/josm/command/PurgeCommand.java	(revision 6112)
+++ /trunk/src/org/openstreetmap/josm/command/PurgeCommand.java	(revision 6113)
@@ -192,8 +192,9 @@
 
         /**
-            * Rest are relations. Do topological sorting on a DAG where each
-            * arrow points from child to parent. (Because it is faster to
-            * loop over getReferrers() than getMembers().)
-            */
+          * Rest are relations. Do topological sorting on a DAG where each
+          * arrow points from child to parent. (Because it is faster to
+          * loop over getReferrers() than getMembers().)
+          */
+        @SuppressWarnings({ "unchecked", "rawtypes" })
         Set<Relation> inR = (Set) in;
         Set<Relation> childlessR = new HashSet<Relation>();
Index: /trunk/src/org/openstreetmap/josm/data/osm/QuadBuckets.java
===================================================================
--- /trunk/src/org/openstreetmap/josm/data/osm/QuadBuckets.java	(revision 6112)
+++ /trunk/src/org/openstreetmap/josm/data/osm/QuadBuckets.java	(revision 6113)
@@ -102,4 +102,5 @@
             // testing.  Child access is one of the single
             // hottest code paths in this entire class.
+            @SuppressWarnings("unchecked")
             QBLevel[] result = (QBLevel[]) Array.newInstance(this.getClass(), QuadTiling.TILES_PER_LEVEL);
             result[NW_INDEX] = nw;
Index: /trunk/src/org/openstreetmap/josm/data/osm/visitor/paint/WireframeMapRenderer.java
===================================================================
--- /trunk/src/org/openstreetmap/josm/data/osm/visitor/paint/WireframeMapRenderer.java	(revision 6112)
+++ /trunk/src/org/openstreetmap/josm/data/osm/visitor/paint/WireframeMapRenderer.java	(revision 6113)
@@ -154,4 +154,5 @@
      * @param bounds display boundaries
      */
+    @SuppressWarnings("unchecked")
     @Override
     public void render(DataSet data, boolean virtual, Bounds bounds) {
Index: /trunk/src/org/openstreetmap/josm/data/validation/tests/RelationChecker.java
===================================================================
--- /trunk/src/org/openstreetmap/josm/data/validation/tests/RelationChecker.java	(revision 6112)
+++ /trunk/src/org/openstreetmap/josm/data/validation/tests/RelationChecker.java	(revision 6113)
@@ -88,4 +88,5 @@
     }
 
+    @SuppressWarnings("unchecked")
     @Override
     public void visit(Relation n) {
Index: /trunk/src/org/openstreetmap/josm/gui/dialogs/properties/TagEditHelper.java
===================================================================
--- /trunk/src/org/openstreetmap/josm/gui/dialogs/properties/TagEditHelper.java	(revision 6112)
+++ /trunk/src/org/openstreetmap/josm/gui/dialogs/properties/TagEditHelper.java	(revision 6113)
@@ -158,4 +158,5 @@
         objKey=key;
         
+        @SuppressWarnings("unchecked")
         final EditTagDialog editDialog = new EditTagDialog(key, row, 
                 (Map<String, Integer>) propertyData.getValueAt(row, 1), focusOnKey);
@@ -164,4 +165,5 @@
         editDialog.performTagEdit();
     }
+    
     /**
      * If during last editProperty call user changed the key name, this key will be returned
Index: /trunk/src/org/openstreetmap/josm/tools/Geometry.java
===================================================================
--- /trunk/src/org/openstreetmap/josm/tools/Geometry.java	(revision 6112)
+++ /trunk/src/org/openstreetmap/josm/tools/Geometry.java	(revision 6113)
@@ -49,7 +49,6 @@
     public static Set<Node> addIntersections(List<Way> ways, boolean test, List<Command> cmds) {
 
-        //stupid java, cannot instantiate array of generic classes..
+        int n = ways.size();
         @SuppressWarnings("unchecked")
-        int n = ways.size();
         ArrayList<Node>[] newNodes = new ArrayList[n];
         BBox[] wayBounds = new BBox[n];
@@ -67,5 +66,5 @@
         //iterate over all way pairs and introduce the intersections
         Comparator<Node> coordsComparator = new NodePositionComparator();
-        WayLoop: for (int seg1Way = 0; seg1Way < n; seg1Way ++) {
+        for (int seg1Way = 0; seg1Way < n; seg1Way ++) {
             for (int seg2Way = seg1Way; seg2Way < n; seg2Way ++) {