1 /*******************************************************************************
2 * Copyright (c) 2007, 2010 Association for Decentralized Information Management
4 * All rights reserved. This program and the accompanying materials
5 * are made available under the terms of the Eclipse Public License v1.0
6 * which accompanies this distribution, and is available at
7 * http://www.eclipse.org/legal/epl-v10.html
10 * VTT Technical Research Centre of Finland - initial API and implementation
11 *******************************************************************************/
12 package org.simantics.db.impl.query;
14 import java.lang.reflect.Array;
15 import java.util.ArrayList;
20 * An implementation of the Map interface which uses an open addressed
21 * hash table to store its contents.
23 * Created: Sun Nov 4 08:52:45 2001
25 * @author Eric D. Friedman
26 * @version $Id: BinaryQueryHashMap.java,v 1.2 2008/03/14 11:38:53 tuoksk Exp $
28 public class BinaryQueryHashMap<Procedure> extends BinaryQueryHash<Procedure> {
31 * Creates a new <code>THashMap</code> instance with the default
32 * capacity and load factor.
34 public BinaryQueryHashMap() {
39 * initialize the value array of the map.
41 * @param initialCapacity an <code>int</code> value
42 * @return an <code>int</code> value
44 protected int setUp(int initialCapacity) {
47 capacity = super.setUp(initialCapacity);
48 // _values = (Object[]) new Object[capacity];
53 * Inserts a key/value pair into the map.
55 * @param key an <code>Object</code> value
56 * @param value an <code>Object</code> value
57 * @return the previous value associated with <tt>key</tt>,
58 * or null if none was found.
60 public BinaryQuery<Procedure> put(final long id, final BinaryQuery<Procedure> value) {
61 BinaryQuery<Procedure> previous = null;
63 int index = insertionIndex(id);
64 boolean isNewMapping = true;
67 previous = _set[index];
69 new Exception().printStackTrace();
70 throw new Error("Duplicate entry in BinaryQueryHashMap2 " + value);
75 postInsertHook(oldKey == null);
83 * rehashes the map to the new capacity.
85 * @param newCapacity an <code>int</code> value
87 @SuppressWarnings("unchecked")
88 protected void rehash(int newCapacity) {
90 int oldCapacity = _set.length;
91 BinaryQuery oldKeys[] = _set;
93 _set = (BinaryQuery[])Array.newInstance(BinaryQuery.class, newCapacity);
95 for (int i = oldCapacity; i-- > 0;) {
96 if(oldKeys[i] != null && oldKeys[i] != REMOVED) {
97 BinaryQuery o = oldKeys[i];
98 int index = insertionIndex(o.id);
100 throwObjectContractViolation(_set[(-index -1)], o);
108 * retrieves the value for <tt>key</tt>
110 * @param key an <code>Object</code> value
111 * @return the value of <tt>key</tt> or null if no such mapping exists.
113 public BinaryQuery<Procedure> get(final long id) {
114 int index = index(id);
115 return index < 0 ? null : _set[index];
119 * Deletes a key/value pair from the map.
121 * @param key an <code>Object</code> value
122 * @return an <code>Object</code> value
124 public Object remove(final long id) {
126 int index = index(id);
129 removeAt(index); // clear key,state; adjust size
134 final public void values(int level, CacheCollectionResult result) {
136 for (int i = _set.length; i-- > 0;) {
137 CacheEntryBase entry = _set[i];
138 if(entry != null && entry != REMOVED) {
139 if(entry.getLevel() <= level)
146 final public ArrayList<CacheEntry> values() {
148 ArrayList<CacheEntry> result = new ArrayList<CacheEntry>();
150 for (int i = _set.length; i-- > 0;) {
151 if(_set[i] != null && _set[i] != REMOVED) {
160 final public <T extends BinaryQuery> ArrayList<T> values(final int r1) {
162 ArrayList<T> result = new ArrayList<T>();
164 for (int i = _set.length; i-- > 0;) {
165 if(_set[i] != null && _set[i] != REMOVED) {
166 BinaryQuery<Procedure> e = _set[i];