-/*******************************************************************************\r
- * Copyright (c) 2007, 2010 Association for Decentralized Information Management\r
- * in Industry THTH ry.\r
- * All rights reserved. This program and the accompanying materials\r
- * are made available under the terms of the Eclipse Public License v1.0\r
- * which accompanies this distribution, and is available at\r
- * http://www.eclipse.org/legal/epl-v10.html\r
- *\r
- * Contributors:\r
- * VTT Technical Research Centre of Finland - initial API and implementation\r
- *******************************************************************************/\r
-package org.simantics.utils.datastructures;\r
-\r
-import java.util.Collection;\r
-import java.util.Iterator;\r
-import java.util.Set;\r
-\r
-public class SetUnion<T> extends ImmutableCollection<T> {\r
-\r
- private Set<T> set1;\r
- private Set<T> set2; \r
- \r
- public SetUnion(Set<T> set1, Set<T> set2) {\r
- this.set1 = set1;\r
- this.set2 = set2;\r
- }\r
-\r
- @Override\r
- public boolean contains(Object o) {\r
- return set1.contains(o) || set2.contains(o);\r
- }\r
-\r
- @Override\r
- public boolean containsAll(Collection<?> c) {\r
- for(Object o : c)\r
- if(!contains(o))\r
- return false;\r
- return true;\r
- }\r
-\r
- @Override\r
- public boolean isEmpty() {\r
- return set1.isEmpty() && set2.isEmpty();\r
- }\r
-\r
- @Override\r
- public Iterator<T> iterator() {\r
- return new ImmutableIterator<T>() {\r
-\r
- int setId = 0;\r
- Iterator<T> it1 = set1.iterator();\r
- Iterator<T> it2 = set2.iterator();\r
- T element = null;\r
- \r
- @Override\r
- public boolean hasNext() {\r
- if(setId == 0) {\r
- if(it1.hasNext())\r
- return true;\r
- else {\r
- setId = 1;\r
- return hasNext();\r
- }\r
- }\r
- else {\r
- if(element != null)\r
- return true;\r
- while(it2.hasNext()) { \r
- element = it2.next();\r
- if(set1.contains(element)) \r
- element = null;\r
- else\r
- return true;\r
- }\r
- return false;\r
- }\r
- }\r
-\r
- @Override\r
- public T next() {\r
- if(setId == 0) {\r
- if(it1.hasNext())\r
- return it1.next();\r
- else {\r
- setId = 1;\r
- return next();\r
- }\r
- }\r
- else {\r
- if(element != null) {\r
- T ret = element;\r
- element = null;\r
- return ret;\r
- }\r
- while(it2.hasNext()) { \r
- T ret = it2.next();\r
- if(!set1.contains(ret)) \r
- return ret;\r
- }\r
- return null;\r
- }\r
- }\r
- \r
- };\r
- }\r
-\r
- @Override\r
- public int size() {\r
- int count = set1.size(); \r
- for(T o : set2)\r
- if(!set1.contains(o))\r
- ++count;\r
- return count;\r
- } \r
- \r
-}\r
+/*******************************************************************************
+ * 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.utils.datastructures;
+
+import java.util.Collection;
+import java.util.Iterator;
+import java.util.Set;
+
+public class SetUnion<T> extends ImmutableCollection<T> {
+
+ private Set<T> set1;
+ private Set<T> set2;
+
+ public SetUnion(Set<T> set1, Set<T> set2) {
+ this.set1 = set1;
+ this.set2 = set2;
+ }
+
+ @Override
+ public boolean contains(Object o) {
+ return set1.contains(o) || set2.contains(o);
+ }
+
+ @Override
+ public boolean containsAll(Collection<?> c) {
+ for(Object o : c)
+ if(!contains(o))
+ return false;
+ return true;
+ }
+
+ @Override
+ public boolean isEmpty() {
+ return set1.isEmpty() && set2.isEmpty();
+ }
+
+ @Override
+ public Iterator<T> iterator() {
+ return new ImmutableIterator<T>() {
+
+ int setId = 0;
+ Iterator<T> it1 = set1.iterator();
+ Iterator<T> it2 = set2.iterator();
+ T element = null;
+
+ @Override
+ public boolean hasNext() {
+ if(setId == 0) {
+ if(it1.hasNext())
+ return true;
+ else {
+ setId = 1;
+ return hasNext();
+ }
+ }
+ else {
+ if(element != null)
+ return true;
+ while(it2.hasNext()) {
+ element = it2.next();
+ if(set1.contains(element))
+ element = null;
+ else
+ return true;
+ }
+ return false;
+ }
+ }
+
+ @Override
+ public T next() {
+ if(setId == 0) {
+ if(it1.hasNext())
+ return it1.next();
+ else {
+ setId = 1;
+ return next();
+ }
+ }
+ else {
+ if(element != null) {
+ T ret = element;
+ element = null;
+ return ret;
+ }
+ while(it2.hasNext()) {
+ T ret = it2.next();
+ if(!set1.contains(ret))
+ return ret;
+ }
+ return null;
+ }
+ }
+
+ };
+ }
+
+ @Override
+ public int size() {
+ int count = set1.size();
+ for(T o : set2)
+ if(!set1.contains(o))
+ ++count;
+ return count;
+ }
+
+}