--- /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 java.lang.reflect.Array;\r
+import java.util.ArrayList;\r
+\r
+\r
+\r
+/**\r
+ * An implementation of the Map interface which uses an open addressed\r
+ * hash table to store its contents.\r
+ *\r
+ * Created: Sun Nov 4 08:52:45 2001\r
+ *\r
+ * @author Eric D. Friedman\r
+ * @version $Id: BinaryQueryHashMap.java,v 1.2 2008/03/14 11:38:53 tuoksk Exp $\r
+ */\r
+public class DoubleKeyQueryHashMap<Procedure> extends DoubleKeyQueryHash<Procedure> {\r
+\r
+ /**\r
+ * Creates a new <code>THashMap</code> instance with the default\r
+ * capacity and load factor.\r
+ */\r
+ public DoubleKeyQueryHashMap() {\r
+ super();\r
+ }\r
+\r
+ /**\r
+ * initialize the value array of the map.\r
+ *\r
+ * @param initialCapacity an <code>int</code> value\r
+ * @return an <code>int</code> value\r
+ */\r
+ protected int setUp(int initialCapacity) {\r
+ int capacity;\r
+ \r
+ capacity = super.setUp(initialCapacity);\r
+// _values = (Object[]) new Object[capacity];\r
+ return capacity;\r
+ }\r
+ \r
+ private int sizeInternal = 0;\r
+ \r
+ /**\r
+ * Inserts a key/value pair into the map.\r
+ *\r
+ * @param key an <code>Object</code> value\r
+ * @param value an <code>Object</code> value\r
+ * @return the previous value associated with <tt>key</tt>,\r
+ * or null if none was found.\r
+ */\r
+ @SuppressWarnings("unchecked")\r
+ public DoubleKeyValueMap put(final int id, final DoubleKeyValueMap value) {\r
+ DoubleKeyValueMap previous = null;\r
+ Object oldKey;\r
+ int index = insertionIndex(id);\r
+ boolean isNewMapping = true;\r
+ if (index < 0) {\r
+ index = -index -1;\r
+ previous = _set[index];\r
+ isNewMapping = false;\r
+ }\r
+ oldKey = _set[index];\r
+ _set[index] = value;\r
+ if (isNewMapping) {\r
+ postInsertHook(oldKey == null);\r
+ }\r
+\r
+ return previous;\r
+ }\r
+ \r
+ public CacheEntry put(final long id, BinaryQuery value) {\r
+ int r1 = r1(id);\r
+ DoubleKeyValueMap map = get(r1);\r
+ if(map == null) {\r
+ map = new DoubleKeyValueMap(r1);\r
+ put(r1, map);\r
+ }\r
+ CacheEntry old = map.put(id, value);\r
+ if(old == null) sizeInternal++;\r
+ return old;\r
+ }\r
+\r
+ /**\r
+ * rehashes the map to the new capacity.\r
+ *\r
+ * @param newCapacity an <code>int</code> value\r
+ */\r
+ protected void rehash(int newCapacity) {\r
+ \r
+ int oldCapacity = _set.length;\r
+ DoubleKeyValueMap<Procedure> oldKeys[] = _set;\r
+\r
+ DoubleKeyValueMap<Procedure> newKeys[] = (DoubleKeyValueMap<Procedure>[])Array.newInstance(DoubleKeyValueMap.class, newCapacity);\r
+\r
+ for (int i = oldCapacity; i-- > 0;) {\r
+ if(oldKeys[i] != null && oldKeys[i] != REMOVED) {\r
+ DoubleKeyValueMap<Procedure> o = oldKeys[i];\r
+ int index = insertionIndex2(o.id, newKeys);\r
+ if (index < 0) {\r
+ throwObjectContractViolation(newKeys[(-index -1)], o);\r
+ }\r
+ newKeys[index] = o;\r
+ }\r
+ }\r
+ \r
+ _set = newKeys;\r
+ \r
+ }\r
+\r
+ /**\r
+ * retrieves the value for <tt>key</tt>\r
+ *\r
+ * @param key an <code>Object</code> value\r
+ * @return the value of <tt>key</tt> or null if no such mapping exists.\r
+ */\r
+ final public DoubleKeyValueMap<Procedure> get(final int id) {\r
+// int index = index(id);\r
+// return index < 0 ? null : _set[index];\r
+ return index2(id);\r
+ }\r
+ \r
+ final protected static long id(long r1, long r2) {\r
+ long result = (r1<<32) | (r2 & 0xffffffffL); \r
+ return result;\r
+ }\r
+\r
+ final public int r1(final long id) {\r
+ return (int)(id>>>32);\r
+ }\r
+ \r
+ final public int r2(final long id) {\r
+ return (int)id;\r
+ }\r
+ \r
+ final public BinaryQuery get(final int r1, final int r2) {\r
+ DoubleKeyValueMap<Procedure> map = get(r1);\r
+ if(map == null) return null;\r
+ return map.get(id(r1,r2));\r
+ }\r
+\r
+ final public BinaryQuery get(final long id) {\r
+ DoubleKeyValueMap<Procedure> map = get(r1(id));\r
+ if(map == null) return null;\r
+ return map.get(id);\r
+ }\r
+\r
+ /**\r
+ * Deletes a key/value pair from the map.\r
+ *\r
+ * @param key an <code>Object</code> value\r
+ * @return an <code>Object</code> value\r
+ */\r
+ public Object remove(final int id) {\r
+ DoubleKeyValueMap<Procedure> prev = null;\r
+ int index = index(id);\r
+ if (index >= 0) {\r
+ prev = _set[index];\r
+ removeAt(index); // clear key,state; adjust size\r
+ sizeInternal-=prev.size();\r
+ }\r
+ return prev;\r
+ }\r
+\r
+ public Object remove(final long id) {\r
+ int r1 = r1(id);\r
+ DoubleKeyValueMap<Procedure> map = get(r1);\r
+ if(map == null) return null;\r
+ Object removed = map.remove(id);\r
+ if(removed != null) sizeInternal--;\r
+ if(map.isEmpty()) remove(r1);\r
+ return removed;\r
+ }\r
+\r
+ final public void values(int level, CacheCollectionResult result) {\r
+ \r
+ for (int i = _set.length; i-- > 0;) {\r
+ if(_set[i] != null && _set[i] != REMOVED) {\r
+ DoubleKeyValueMap map = _set[i];\r
+ map.values(level, result);\r
+ }\r
+ }\r
+ \r
+ }\r
+\r
+ final public ArrayList<CacheEntry> values() {\r
+\r
+ ArrayList<CacheEntry> result = new ArrayList<CacheEntry>();\r
+ \r
+ for (int i = _set.length; i-- > 0;) {\r
+ if(_set[i] != null && _set[i] != REMOVED) {\r
+ DoubleKeyValueMap map = _set[i];\r
+ result.addAll(map.values());\r
+ }\r
+ }\r
+ \r
+ return result;\r
+ \r
+ }\r
+ \r
+ @Override\r
+ public int size() {\r
+ return sizeInternal;\r
+ }\r
+ \r
+ final public static ArrayList<BinaryQuery> NO_VALUES = new ArrayList<BinaryQuery>();\r
+\r
+ final public <T extends BinaryQuery> ArrayList<T> values(int r1) {\r
+\r
+ DoubleKeyValueMap map = get(r1);\r
+ if(map == null) return (ArrayList<T>)NO_VALUES;\r
+ \r
+ return map.values();\r
+ \r
+ }\r
+ \r
+} // THashMap\r
Code Review / simantics / platform.git / blobdiff