Changeset 1941 in josm for trunk/src

Timestamp:

2009-08-09T22:43:59+02:00 (15 years ago)

Author:

stoecker

Message:

fixed NPE

File:

• trunk/src/org/openstreetmap/josm/gui/NavigatableComponent.java (modified) (6 diffs)

trunk/src/org/openstreetmap/josm/gui/NavigatableComponent.java

@@ -292 +292 @@
         double minDistanceSq = snapDistance;
         Node minPrimitive = null;
-        for (Node n : getCurrentDataSet().nodes) {
+        DataSet ds = getCurrentDataSet();
+        if(ds == null)
+            return null;
+        for (Node n : ds.nodes) {
             if (n.deleted || n.incomplete) {
                 continue;
@@ -320 +323 @@
     public final List<WaySegment> getNearestWaySegments(Point p) {
         TreeMap<Double, List<WaySegment>> nearest = new TreeMap<Double, List<WaySegment>>();
-        for (Way w : getCurrentDataSet().ways) {
+        DataSet ds = getCurrentDataSet();
+        if(ds == null)
+            return null;
+        for (Way w : ds.ways) {
             if (w.deleted || w.incomplete) {
                 continue;
@@ -376 +382 @@
     public final WaySegment getNearestWaySegment(Point p, Collection<WaySegment> ignore) {
         List<WaySegment> nearest = getNearestWaySegments(p);
+        if(nearest == null)
+            return null;
         if (ignore != null) {
             nearest.removeAll(ignore);
@@ -439 +447 @@
     public Collection<OsmPrimitive> getAllNearest(Point p) {
         Collection<OsmPrimitive> nearest = new HashSet<OsmPrimitive>();
-        for (Way w : getCurrentDataSet().ways) {
+        DataSet ds = getCurrentDataSet();
+        if(ds == null)
+            return null;
+        for (Way w : ds.ways) {
             if (w.deleted || w.incomplete) {
                 continue;
@@ -465 +476 @@
             }
         }
-        for (Node n : getCurrentDataSet().nodes) {
+        for (Node n : ds.nodes) {
             if (!n.deleted && !n.incomplete
                     && getPoint(n).distanceSq(p) < snapDistance) {
@@ -484 +495 @@
     public Collection<Node> getNearestNodes(Point p) {
         Collection<Node> nearest = new HashSet<Node>();
-        for (Node n : getCurrentDataSet().nodes) {
+        DataSet ds = getCurrentDataSet();
+        if(ds == null)
+            return null;
+        for (Node n : ds.nodes) {
             if (!n.deleted && !n.incomplete
                     && getPoint(n).distanceSq(p) < snapDistance) {