--- /dev/null
+/*******************************************************************************\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.db.impl.query;\r
+\r
+import gnu.trove.procedure.TIntProcedure;\r
+\r
+import java.util.Arrays;\r
+import java.util.Collection;\r
+import java.util.Iterator;\r
+import java.util.Set;\r
+\r
+import org.simantics.db.Resource;\r
+import org.simantics.db.ResourceSet;\r
+import org.simantics.db.impl.ResourceImpl;\r
+import org.simantics.db.impl.support.ResourceSupport;\r
+\r
+\r
+final public class IntSet implements ResourceSet {\r
+\r
+ final private ResourceSupport support;\r
+\r
+ public int[] data;\r
+\r
+ /** the index after the last entry in the list */\r
+ public int sizeOrData;\r
+\r
+ /** the default capacity for new lists */\r
+ protected static final int DEFAULT_CAPACITY = 3;\r
+\r
+ public static final int NO_DATA = -1;\r
+\r
+ public IntSet() {\r
+ support = null;\r
+ data = null;\r
+ sizeOrData = NO_DATA;\r
+ }\r
+\r
+ public IntSet(QuerySupport support) {\r
+ this.support = support.getSupport();\r
+ data = null;\r
+ sizeOrData = NO_DATA;\r
+ }\r
+\r
+ public IntSet(QuerySupport support, int value) {\r
+ this.support = support.getSupport();\r
+ data = null;\r
+ sizeOrData = value;\r
+ }\r
+\r
+ @Override\r
+ public int hashCode() {\r
+ return 31 * sizeOrData + 41 * Arrays.hashCode(data);\r
+ }\r
+ \r
+ @Override\r
+ public boolean equals(Object object) {\r
+ if (this == object)\r
+ return true;\r
+ else if (object == null)\r
+ return false;\r
+ else if (IntSet.class != object.getClass())\r
+ return false;\r
+ IntSet r = (IntSet)object;\r
+// System.out.println("equals " + this + " vs. " + r);\r
+ return sizeOrData == r.sizeOrData && Arrays.equals(data, r.data);\r
+ }\r
+\r
+\r
+ /**\r
+ * Returns the number of values in the list.\r
+ *\r
+ * @return the number of values in the list.\r
+ */\r
+ public int size() {\r
+ return data != null ? sizeOrData : (sizeOrData != NO_DATA ? 1 : 0);\r
+ }\r
+\r
+ /**\r
+ * Tests whether this list contains any values.\r
+ *\r
+ * @return true if the list is empty.\r
+ */\r
+ public boolean isEmpty() {\r
+ return sizeOrData == NO_DATA;\r
+ }\r
+\r
+ // modifying\r
+\r
+ /**\r
+ * Adds <tt>val</tt> to the end of the list, growing as needed.\r
+ *\r
+ * @param val an <code>int</code> value\r
+ */\r
+ public boolean add(int val) {\r
+ if(data == null) {\r
+ if(sizeOrData == val) return false;\r
+ if(sizeOrData == NO_DATA) {\r
+ sizeOrData = val;\r
+ return true;\r
+ } else {\r
+ data = new int[DEFAULT_CAPACITY];\r
+ data[0] = sizeOrData;\r
+ data[1] = val;\r
+ sizeOrData = 2;\r
+ return true;\r
+ }\r
+ } else {\r
+ for(int i=0;i<sizeOrData;i++) if(data[i] == val) return false;\r
+ if(data.length == sizeOrData) {\r
+ int newCap = data.length << 1;\r
+ int[] tmp = new int[newCap];\r
+ System.arraycopy(data, 0, tmp, 0, data.length);\r
+ data = tmp;\r
+ data[sizeOrData++] = val;\r
+ } else {\r
+ data[sizeOrData++] = val;\r
+ }\r
+ return true;\r
+ }\r
+ }\r
+\r
+ public void forEach(TIntProcedure proc) {\r
+ if(data == null) {\r
+ if(sizeOrData != NO_DATA) proc.execute(sizeOrData);\r
+ } else {\r
+ for(int i = 0;i < sizeOrData ; i++) proc.execute(data[i]);\r
+ }\r
+ }\r
+ \r
+ public boolean contains(int val) {\r
+ if(data == null) {\r
+ return sizeOrData == val;\r
+ } else {\r
+ for(int i = 0;i < sizeOrData ; i++) if(data[i] == val) return true;\r
+ }\r
+ return false;\r
+ }\r
+\r
+ public void trim() {\r
+ if(data != null && sizeOrData < data.length) {\r
+ int newCap = sizeOrData;\r
+ int[] tmp = new int[newCap];\r
+ System.arraycopy(data, 0, tmp, 0, newCap);\r
+ data = tmp;\r
+ sizeOrData = newCap;\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public boolean add(Resource e) {\r
+ return add(((ResourceImpl)e).id);\r
+ }\r
+\r
+ @Override\r
+ public boolean addAll(Collection<? extends Resource> c) {\r
+ boolean ret = false;\r
+ for (Resource r : c) {\r
+ if (add(r))\r
+ ret = true;\r
+ }\r
+ return ret;\r
+ }\r
+\r
+ @Override\r
+ public void clear() {\r
+ sizeOrData = NO_DATA;\r
+ data = null;\r
+ }\r
+\r
+ @Override\r
+ public boolean contains(Object o) {\r
+ assert(o != null);\r
+ return contains(((ResourceImpl)o).id);\r
+ }\r
+\r
+ @Override\r
+ public boolean containsAll(Collection<?> c) {\r
+ for (Object o : c) {\r
+ if (!contains(o))\r
+ return false;\r
+ }\r
+ return true;\r
+ }\r
+\r
+ @Override\r
+ public Iterator<Resource> iterator() {\r
+\r
+ class ArraySetIterator implements Iterator<Resource> {\r
+\r
+ int next = 0;\r
+\r
+ @Override\r
+ public boolean hasNext() {\r
+ return next < size();\r
+ }\r
+\r
+ @Override\r
+ public Resource next() {\r
+ if(size() == 1) {\r
+ next++;\r
+ return new ResourceImpl(support, sizeOrData);\r
+ } else {\r
+ return new ResourceImpl(support, data[next++]);\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public void remove() {\r
+ throw new UnsupportedOperationException();\r
+ }\r
+\r
+ }\r
+\r
+ return new ArraySetIterator();\r
+\r
+ }\r
+\r
+ @Override\r
+ public boolean remove(Object o) {\r
+ throw new UnsupportedOperationException();\r
+ }\r
+\r
+ @Override\r
+ public boolean removeAll(Collection<?> c) {\r
+ throw new UnsupportedOperationException();\r
+ }\r
+\r
+ @Override\r
+ public boolean retainAll(Collection<?> c) {\r
+ throw new UnsupportedOperationException();\r
+ }\r
+\r
+ @Override\r
+ public Object[] toArray() {\r
+ throw new UnsupportedOperationException();\r
+ }\r
+\r
+ @Override\r
+ public <T> T[] toArray(T[] a) {\r
+ throw new UnsupportedOperationException();\r
+ }\r
+\r
+ @Override\r
+ public String toString() {\r
+ return "IntSet " + sizeOrData + " " + Arrays.toString(data);\r
+ }\r
+ \r
+ @Override\r
+ public boolean disjoint(Set<Resource> other) {\r
+ if(other instanceof ResourceSet) {\r
+ ResourceSet rs = (ResourceSet)other;\r
+ if(data == null) {\r
+ return !rs.contains(sizeOrData);\r
+ } else {\r
+ for(int i = 0;i < sizeOrData ; i++) \r
+ if(rs.contains(data[i])) return false;\r
+ return true;\r
+ }\r
+ } else {\r
+ if(data == null) {\r
+ return !other.contains(sizeOrData);\r
+ } else {\r
+ for(int i = 0;i < sizeOrData ; i++) \r
+ if(other.contains(data[i])) return false;\r
+ return true;\r
+ }\r
+ }\r
+ }\r
+\r
+}
\ No newline at end of file
Code Review / simantics / platform.git / blobdiff