-/*******************************************************************************\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.security.InvalidParameterException;\r
-import java.util.Collection;\r
-import java.util.Iterator;\r
-import java.util.List;\r
-import java.util.Set;\r
-\r
-public class SetUnion2<T> extends ImmutableCollection<T> {\r
-\r
- List<Set<T>> sets;\r
-\r
- @Override\r
- public boolean contains(Object o) {\r
- for(Set<T> set : sets)\r
- if(set.contains(o))\r
- return true;\r
- return false;\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
- for(Set<T> set : sets)\r
- if(!set.isEmpty())\r
- return false;\r
- return true;\r
- }\r
-\r
- @Override\r
- public Iterator<T> iterator() {\r
- return new ImmutableIterator<T>() {\r
-\r
- int setId = 0;\r
- Iterator<T> it = sets.get(0).iterator();\r
- T element = null;\r
- \r
- @Override\r
- public boolean hasNext() {\r
- while(true) {\r
- if(element != null)\r
- return true;\r
- if(it.hasNext()) {\r
- element = it.next();\r
- for(int i=0;i<setId;++i)\r
- if(sets.get(i).contains(element)) {\r
- element = null;\r
- break;\r
- }\r
- }\r
- else {\r
- ++setId;\r
- if(setId < sets.size())\r
- it = sets.get(setId).iterator();\r
- else\r
- return false;\r
- }\r
- }\r
- }\r
-\r
- @Override\r
- public T next() {\r
- while(true) {\r
- if(element != null)\r
- return element;\r
- if(it.hasNext()) {\r
- element = it.next();\r
- for(int i=0;i<setId;++i)\r
- if(sets.get(i).contains(element)) {\r
- element = null;\r
- break;\r
- }\r
- }\r
- else {\r
- ++setId;\r
- if(setId < sets.size())\r
- it = sets.get(setId).iterator();\r
- else\r
- throw new InvalidParameterException();\r
- }\r
- }\r
- }\r
- \r
- };\r
- }\r
-\r
- @Override\r
- public int size() {\r
- int count = sets.get(0).size();\r
- for(int i=1;i<sets.size();++i) {\r
- floop:\r
- for(T o : sets.get(i)) {\r
- for(int j=0;j<i;++j)\r
- if(sets.get(j).contains(o))\r
- break floop;\r
- ++count;\r
- }\r
- }\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.security.InvalidParameterException;
+import java.util.Collection;
+import java.util.Iterator;
+import java.util.List;
+import java.util.Set;
+
+public class SetUnion2<T> extends ImmutableCollection<T> {
+
+ List<Set<T>> sets;
+
+ @Override
+ public boolean contains(Object o) {
+ for(Set<T> set : sets)
+ if(set.contains(o))
+ return true;
+ return false;
+ }
+
+ @Override
+ public boolean containsAll(Collection<?> c) {
+ for(Object o : c)
+ if(!contains(o))
+ return false;
+ return true;
+ }
+
+ @Override
+ public boolean isEmpty() {
+ for(Set<T> set : sets)
+ if(!set.isEmpty())
+ return false;
+ return true;
+ }
+
+ @Override
+ public Iterator<T> iterator() {
+ return new ImmutableIterator<T>() {
+
+ int setId = 0;
+ Iterator<T> it = sets.get(0).iterator();
+ T element = null;
+
+ @Override
+ public boolean hasNext() {
+ while(true) {
+ if(element != null)
+ return true;
+ if(it.hasNext()) {
+ element = it.next();
+ for(int i=0;i<setId;++i)
+ if(sets.get(i).contains(element)) {
+ element = null;
+ break;
+ }
+ }
+ else {
+ ++setId;
+ if(setId < sets.size())
+ it = sets.get(setId).iterator();
+ else
+ return false;
+ }
+ }
+ }
+
+ @Override
+ public T next() {
+ while(true) {
+ if(element != null)
+ return element;
+ if(it.hasNext()) {
+ element = it.next();
+ for(int i=0;i<setId;++i)
+ if(sets.get(i).contains(element)) {
+ element = null;
+ break;
+ }
+ }
+ else {
+ ++setId;
+ if(setId < sets.size())
+ it = sets.get(setId).iterator();
+ else
+ throw new InvalidParameterException();
+ }
+ }
+ }
+
+ };
+ }
+
+ @Override
+ public int size() {
+ int count = sets.get(0).size();
+ for(int i=1;i<sets.size();++i) {
+ floop:
+ for(T o : sets.get(i)) {
+ for(int j=0;j<i;++j)
+ if(sets.get(j).contains(o))
+ break floop;
+ ++count;
+ }
+ }
+ return count;
+ }
+
+}
Code Review / simantics / platform.git / blobdiff