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