X-Git-Url: https://gerrit.simantics.org/r/gitweb?a=blobdiff_plain;f=bundles%2Forg.simantics.db.common%2Fsrc%2Forg%2Fsimantics%2Fdb%2Fcommon%2Fprocedure%2Fsingle%2FSingleSetListener.java;h=54ed69a7471d6c9f8b48ca2b4879c365609d2fe9;hb=HEAD;hp=7da48efa5eb216ef0c03e972333ae19128a731c1;hpb=969bd23cab98a79ca9101af33334000879fb60c5;p=simantics%2Fplatform.git

diff --git a/bundles/org.simantics.db.common/src/org/simantics/db/common/procedure/single/SingleSetListener.java b/bundles/org.simantics.db.common/src/org/simantics/db/common/procedure/single/SingleSetListener.java
index 7da48efa5..54ed69a74 100644
--- a/bundles/org.simantics.db.common/src/org/simantics/db/common/procedure/single/SingleSetListener.java
+++ b/bundles/org.simantics.db.common/src/org/simantics/db/common/procedure/single/SingleSetListener.java
@@ -1,64 +1,64 @@
-/*******************************************************************************
- * Copyright (c) 2007, 2010 Association for Decentralized Information Management
- * in Industry THTH ry.
- * All rights reserved. This program and the accompanying materials
- * are made available under the terms of the Eclipse Public License v1.0
- * which accompanies this distribution, and is available at
- * http://www.eclipse.org/legal/epl-v10.html
- *
- * Contributors:
- *     VTT Technical Research Centre of Finland - initial API and implementation
- *******************************************************************************/
-package org.simantics.db.common.procedure.single;
-
-import java.util.Collection;
-import java.util.HashSet;
-
-import org.simantics.db.Disposable;
-import org.simantics.db.procedure.Listener;
-import org.simantics.db.procedure.SetListener;
-
-abstract public class SingleSetListener<T> implements Listener<Collection<T>>, SetListener<T>, Disposable {
-	
-    private boolean disposed = false;
-	
-    private Collection<T> previous = null;
-    
-    public void add(T result) {};
-    public void remove(T result) {};
-    
-    @Override
-    public void execute(Collection<T> result) {
-    	
-    	if(result == null) result = new HashSet<T>();
-    	
-        if(previous == null) {
-
-            for(T t : result) add(t);
-
-        } else {
-
-            HashSet<T> added = new HashSet<T>(result);
-            added.removeAll(previous);
-            HashSet<T> removed = new HashSet<T>(previous);
-            removed.removeAll(result);
-
-            for(T t : added) add(t);
-            for(T t : removed) remove(t);
-
-        }
-
-        previous = result;
-        
-    }
-	
-    public void dispose() {
-        disposed = true;
-    }
-
-    @Override
-    public boolean isDisposed() {
-        return disposed;
-    }
-    
-}
+/*******************************************************************************
+ * Copyright (c) 2007, 2010 Association for Decentralized Information Management
+ * in Industry THTH ry.
+ * All rights reserved. This program and the accompanying materials
+ * are made available under the terms of the Eclipse Public License v1.0
+ * which accompanies this distribution, and is available at
+ * http://www.eclipse.org/legal/epl-v10.html
+ *
+ * Contributors:
+ *     VTT Technical Research Centre of Finland - initial API and implementation
+ *******************************************************************************/
+package org.simantics.db.common.procedure.single;
+
+import java.util.Collection;
+import java.util.HashSet;
+
+import org.simantics.db.Disposable;
+import org.simantics.db.procedure.Listener;
+import org.simantics.db.procedure.SetListener;
+
+abstract public class SingleSetListener<T> implements Listener<Collection<T>>, SetListener<T>, Disposable {
+	
+    private boolean disposed = false;
+	
+    private Collection<T> previous = null;
+    
+    public void add(T result) {};
+    public void remove(T result) {};
+    
+    @Override
+    public void execute(Collection<T> result) {
+    	
+    	if(result == null) result = new HashSet<T>();
+    	
+        if(previous == null) {
+
+            for(T t : result) add(t);
+
+        } else {
+
+            HashSet<T> added = new HashSet<T>(result);
+            added.removeAll(previous);
+            HashSet<T> removed = new HashSet<T>(previous);
+            removed.removeAll(result);
+
+            for(T t : added) add(t);
+            for(T t : removed) remove(t);
+
+        }
+
+        previous = result;
+        
+    }
+	
+    public void dispose() {
+        disposed = true;
+    }
+
+    @Override
+    public boolean isDisposed() {
+        return disposed;
+    }
+    
+}