Changeset 1598 in josm for trunk/src/org/openstreetmap/josm/data

Timestamp:

2009-05-18T19:47:22+02:00 (15 years ago)

Author:

framm

Message:

• secured all methods in Way class against breakage when used with incomplete ways
• fix relation editor breakage with incomplete objects (closes #2599)
• less exceptions in AboutAction when run inside develeopment environment

Location:

trunk/src/org/openstreetmap/josm/data/osm

Files:

• Relation.java (modified) (2 diffs)
• Way.java (modified) (8 diffs)

trunk/src/org/openstreetmap/josm/data/osm/Relation.java

@@ -106 +106 @@
     }
 
+    // seems to be different from member "incomplete" - FIXME
     public boolean isIncomplete() {
         for (RelationMember m : members)
@@ -114 +115 @@
     
     public RelationMember firstMember() {
+        if (incomplete) return null;
         return (members.size() == 0) ? null : members.get(0);
     }
     public RelationMember lastMember() {
+        if (incomplete) return null;
         return (members.size() == 0) ? null : members.get(members.size() -1);
     }

trunk/src/org/openstreetmap/josm/data/osm/Way.java

@@ -31 +31 @@
     public Integer mappaintDrawnAreaCode = 0;
     /* end of mappaint data */
-    @Override protected void clearCached()
-    {
+    @Override protected void clearCached() {
         super.clearCached();
         isMappaintArea = false;
@@ -39 +38 @@
 
     public void visitNodes(Visitor v) {
+        if (incomplete) return;
         for (Node n : this.nodes)
             v.visit(n);
@@ -45 +45 @@
     public ArrayList<Pair<Node,Node>> getNodePairs(boolean sort) {
         ArrayList<Pair<Node,Node>> chunkSet = new ArrayList<Pair<Node,Node>>();
+        if (incomplete) return chunkSet;
         Node lastN = null;
         for (Node n : this.nodes) {
@@ -70 +71 @@
      */
     public Way(Way clone) {
-            cloneFrom(clone);
+        cloneFrom(clone);
     }
 
@@ -95 +96 @@
 
     @Override public String toString() {
+        if (incomplete) return "{Way id="+id+" version="+version+" (incomplete)}";
         return "{Way id="+id+" version="+version+" nodes="+Arrays.toString(nodes.toArray())+"}";
     }
@@ -103 +105 @@
 
     public int compareTo(OsmPrimitive o) {
-        if(o instanceof Relation)
+        if (o instanceof Relation)
             return 1;
         return o instanceof Way ? Long.valueOf(id).compareTo(o.id) : -1;
@@ -132 +134 @@
     }
 
-    public void removeNode(Node n)
-    {
-        Boolean closed = (lastNode() == n && firstNode() == n);
+    public void removeNode(Node n) {
+        if (incomplete) return;
+        boolean closed = (lastNode() == n && firstNode() == n);
         int i;
-        while((i = nodes.indexOf(n)) >= 0)
+        while ((i = nodes.indexOf(n)) >= 0)
             nodes.remove(i);
         i = nodes.size();
-        if(closed && i > 2) // close again
+        if (closed && i > 2) // close again
             addNode(firstNode());
         // prevent closed ways with less than 3 different nodes
-        else if(i >= 2 && i <= 3 && nodes.get(0) == nodes.get(i-1))
+        else if (i >= 2 && i <= 3 && nodes.get(0) == nodes.get(i-1))
             nodes.remove(i-1);
     }
 
-    public void removeNodes(Collection<? extends OsmPrimitive> selection)
-    {
-       for(OsmPrimitive p : selection)
-       {
-           if(p instanceof Node)
-           {
+    public void removeNodes(Collection<? extends OsmPrimitive> selection) {
+        if (incomplete) return;
+        for(OsmPrimitive p : selection) {
+           if (p instanceof Node) {
                removeNode((Node)p);
            }
@@ -157 +157 @@
     }
 
-    public void addNode(Node n)
-    {
+    public void addNode(Node n) {
+        if (incomplete) return;
         clearCached();
         nodes.add(n);
     }
 
-    public void addNode(int offs, Node n)
-    {
+    public void addNode(int offs, Node n) {
+        if (incomplete) return;
         clearCached();
         nodes.add(offs, n);
     }
 
-    public Boolean isClosed() {
+    public boolean isClosed() {
+        if (incomplete) return false;
         return nodes.size() >= 3 && lastNode() == firstNode();
     }
 
     public Node lastNode() {
+        if (incomplete) return null;
         return nodes.get(nodes.size()-1);
     }
 
     public Node firstNode() {
+        if (incomplete) return null;
         return nodes.get(0);
     }
 
     public boolean isFirstLastNode(Node n) {
+        if (incomplete) return false; 
         return n == firstNode() || n == lastNode();
     }