X-Git-Url: https://gerrit.simantics.org/r/gitweb?a=blobdiff_plain;f=org.simantics.g3d.vtk%2Fsrc%2Forg%2Fsimantics%2Fg3d%2Fvtk%2Fcommon%2FAbstractVTKNodeMap.java;h=efb4c07b151d95b4ee336984f861c8dc094de69c;hb=refs%2Fchanges%2F07%2F3407%2F1;hp=d9b754b45e115bb0f7be78fc6c3f56c327abae37;hpb=46c28cc32944d0f73c5ab4062bd6b0b232143be7;p=simantics%2F3d.git

diff --git a/org.simantics.g3d.vtk/src/org/simantics/g3d/vtk/common/AbstractVTKNodeMap.java b/org.simantics.g3d.vtk/src/org/simantics/g3d/vtk/common/AbstractVTKNodeMap.java
index d9b754b4..efb4c07b 100644
--- a/org.simantics.g3d.vtk/src/org/simantics/g3d/vtk/common/AbstractVTKNodeMap.java
+++ b/org.simantics.g3d.vtk/src/org/simantics/g3d/vtk/common/AbstractVTKNodeMap.java
@@ -143,6 +143,10 @@ public abstract class AbstractVTKNodeMap<E extends INode> implements VTKNodeMap<
 
 	private boolean rangeModified = false;
 	
+	public boolean isRangeModified() {
+        return rangeModified;
+    }
+	
 	@Override
 	public void onChanged() {
 		try {
@@ -428,6 +432,16 @@ public abstract class AbstractVTKNodeMap<E extends INode> implements VTKNodeMap<
 		return n + "@" + Integer.toHexString(n.hashCode());
 	}
 	
+	protected boolean filterChange(List<Pair<E,String>> list,E n) {
+	    for (int i = list.size()-1; i >= 0; i--) {
+            if (list.get(i).first == n) {
+                list.remove(i);
+                return true;
+            }
+        }
+	    return false;
+	}
+	
 	@SuppressWarnings("unchecked")
 	protected void updateCycle() {
 		rem.clear();
@@ -437,18 +451,19 @@ public abstract class AbstractVTKNodeMap<E extends INode> implements VTKNodeMap<
 		
 		
 		synchronized (syncMutex) {
-		    // Check for overlapping additions and deletions, prevent deleting objects that are also added.
+		    // Check for overlapping additions and deletions, prevent deleting objects that are also added and vice versa.
 		    Deque<E> stack = new ArrayDeque<E>();
 	        for (Pair<E, String> n : added) {
 	            stack.add(n.first);
 	        }
 	        while (!stack.isEmpty()) {
 	            E n = stack.pop();
-	            for (int i = removed.size()-1; i >= 0; i--) {
-	                if (removed.get(i).first == n) {
-	                    removed.remove(i);
-	                    break;
-	                }
+	            boolean conflict = filterChange(removed, n);
+	            if (conflict) {
+	                System.out.println("Prevent removing " + n);
+	                //filterChange(added, n)
+	                if (filterChange(added, n))
+	                    System.out.println("Prevent adding " + n);
 	            }
 	            if (n instanceof ParentNode) {
 	                ParentNode<INode> pn = (ParentNode<INode>)n;