X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=src%2Forg%2Feclipse%2Fjdt%2Finternal%2Fcompiler%2Futil%2FHashtableOfIntValues.java;fp=src%2Forg%2Feclipse%2Fjdt%2Finternal%2Fcompiler%2Futil%2FHashtableOfIntValues.java;h=0000000000000000000000000000000000000000;hb=6f0cd02d46e011bd5599e1b7fefc6159cb811135;hp=7c42adb7f80d755c5963681d5ef70e7fd78da9a4;hpb=622d0e5a4b1b35b6918a516a79a0cc22272a919e;p=org.ibex.tool.git

diff --git a/src/org/eclipse/jdt/internal/compiler/util/HashtableOfIntValues.java b/src/org/eclipse/jdt/internal/compiler/util/HashtableOfIntValues.java
deleted file mode 100644
index 7c42adb..0000000
--- a/src/org/eclipse/jdt/internal/compiler/util/HashtableOfIntValues.java
+++ /dev/null
@@ -1,148 +0,0 @@
-/*******************************************************************************
- * Copyright (c) 2000, 2004 IBM Corporation and others.
- * All rights reserved. This program and the accompanying materials 
- * are made available under the terms of the Common Public License v1.0
- * which accompanies this distribution, and is available at
- * http://www.eclipse.org/legal/cpl-v10.html
- * 
- * Contributors:
- *     IBM Corporation - initial API and implementation
- *******************************************************************************/
-package org.eclipse.jdt.internal.compiler.util;
-
-import org.eclipse.jdt.core.compiler.CharOperation;
-
-/**
- * Hashtable of {char[] --> int}
- */
-public final class HashtableOfIntValues implements Cloneable {
-	
-	public static final int NO_VALUE = Integer.MIN_VALUE;
-	
-	// to avoid using Enumerations, walk the individual tables skipping nulls
-	public char[] keyTable[];
-	public int valueTable[];
-
-	public int elementSize; // number of elements in the table
-	int threshold;
-
-	public HashtableOfIntValues() {
-		this(13);
-	}
-
-	public HashtableOfIntValues(int size) {
-
-		this.elementSize = 0;
-		this.threshold = size; // size represents the expected number of elements
-		int extraRoom = (int) (size * 1.75f);
-		if (this.threshold == extraRoom)
-			extraRoom++;
-		this.keyTable = new char[extraRoom][];
-		this.valueTable = new int[extraRoom];
-	}
-
-	public Object clone() throws CloneNotSupportedException {
-		HashtableOfIntValues result = (HashtableOfIntValues) super.clone();
-		result.elementSize = this.elementSize;
-		result.threshold = this.threshold;
-
-		int length = this.keyTable.length;
-		result.keyTable = new char[length][];
-		System.arraycopy(this.keyTable, 0, result.keyTable, 0, length);
-
-		length = this.valueTable.length;
-		result.valueTable = new int[length];
-		System.arraycopy(this.valueTable, 0, result.valueTable, 0, length);
-		return result;
-	}
-
-	public boolean containsKey(char[] key) {
-
-		int index = CharOperation.hashCode(key) % valueTable.length;
-		int keyLength = key.length;
-		char[] currentKey;
-		while ((currentKey = keyTable[index]) != null) {
-			if (currentKey.length == keyLength && CharOperation.equals(currentKey, key))
-				return true;
-			index = (index + 1) % keyTable.length;
-		}
-		return false;
-	}
-
-	public int get(char[] key) {
-
-		int index = CharOperation.hashCode(key) % valueTable.length;
-		int keyLength = key.length;
-		char[] currentKey;
-		while ((currentKey = keyTable[index]) != null) {
-			if (currentKey.length == keyLength && CharOperation.equals(currentKey, key))
-				return valueTable[index];
-			index = (index + 1) % keyTable.length;
-		}
-		return NO_VALUE;
-	}
-
-	public int put(char[] key, int value) {
-
-		int index = CharOperation.hashCode(key) % valueTable.length;
-		int keyLength = key.length;
-		char[] currentKey;
-		while ((currentKey = keyTable[index]) != null) {
-			if (currentKey.length == keyLength && CharOperation.equals(currentKey, key))
-				return valueTable[index] = value;
-			index = (index + 1) % keyTable.length;
-		}
-		keyTable[index] = key;
-		valueTable[index] = value;
-
-		// assumes the threshold is never equal to the size of the table
-		if (++elementSize > threshold)
-			rehash();
-		return value;
-	}
-
-	public int removeKey(char[] key) {
-
-		int index = CharOperation.hashCode(key) % valueTable.length;
-		int keyLength = key.length;
-		char[] currentKey;
-		while ((currentKey = keyTable[index]) != null) {
-			if (currentKey.length == keyLength && CharOperation.equals(currentKey, key)) {
-				int value = valueTable[index];
-				elementSize--;
-				keyTable[index] = null;
-				valueTable[index] = NO_VALUE;
-				rehash();
-				return value;
-			}
-			index = (index + 1) % keyTable.length;
-		}
-		return NO_VALUE;
-	}
-
-	private void rehash() {
-
-		HashtableOfIntValues newHashtable = new HashtableOfIntValues(elementSize * 2);		// double the number of expected elements
-		char[] currentKey;
-		for (int i = keyTable.length; --i >= 0;)
-			if ((currentKey = keyTable[i]) != null)
-				newHashtable.put(currentKey, valueTable[i]);
-
-		this.keyTable = newHashtable.keyTable;
-		this.valueTable = newHashtable.valueTable;
-		this.threshold = newHashtable.threshold;
-	}
-
-	public int size() {
-		return elementSize;
-	}
-
-	public String toString() {
-		String s = ""; //$NON-NLS-1$
-		char[] key;
-		for (int i = 0, length = valueTable.length; i < length; i++)
-			if ((key = keyTable[i]) != null)
-				s += new String(key) + " -> " + valueTable[i] + "\n"; 	//$NON-NLS-2$ //$NON-NLS-1$
-		return s;
-	}
-}