Refactory: remove unused classes, imports, fields and methods.

[phpeclipse.git] / net.sourceforge.phpeclipse / src / net / sourceforge / phpdt / internal / compiler / util / HashtableOfPackage.java

diff --git a/net.sourceforge.phpeclipse/src/net/sourceforge/phpdt/internal/compiler/util/HashtableOfPackage.java b/net.sourceforge.phpeclipse/src/net/sourceforge/phpdt/internal/compiler/util/HashtableOfPackage.java
index 8dab8c3..e86a621 100644 (file)
--- a/net.sourceforge.phpeclipse/src/net/sourceforge/phpdt/internal/compiler/util/HashtableOfPackage.java
+++ b/net.sourceforge.phpeclipse/src/net/sourceforge/phpdt/internal/compiler/util/HashtableOfPackage.java
@@ -16,81 +16,96 @@ import net.sourceforge.phpdt.internal.compiler.lookup.PackageBinding;
 public final class HashtableOfPackage {
        // to avoid using Enumerations, walk the individual tables skipping nulls
        public char[] keyTable[];
+
        public PackageBinding valueTable[];
 
        int elementSize; // number of elements in the table
+
        int threshold;
-public HashtableOfPackage() {
-       this(3); // usually not very large
-}
-public HashtableOfPackage(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 PackageBinding[extraRoom];
-}
-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.prefixEquals(currentKey, key))
-                       return true;
-               index = (index + 1) % keyTable.length;
+
+       public HashtableOfPackage() {
+               this(3); // usually not very large
        }
-       return false;
-}
-public PackageBinding 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.prefixEquals(currentKey, key))
-                       return valueTable[index];
-               index = (index + 1) % keyTable.length;
+
+       public HashtableOfPackage(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 PackageBinding[extraRoom];
        }
-       return null;
-}
-public PackageBinding put(char[] key, PackageBinding value) {
-       int index = CharOperation.hashCode(key) % valueTable.length;
-       int keyLength = key.length;
-       char[] currentKey;
-       while ((currentKey = keyTable[index]) != null) {
-               if (currentKey.length == keyLength && CharOperation.prefixEquals(currentKey, key))
-                       return valueTable[index] = value;
-               index = (index + 1) % keyTable.length;
+
+       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.prefixEquals(currentKey, key))
+                               return true;
+                       index = (index + 1) % keyTable.length;
+               }
+               return false;
        }
-       keyTable[index] = key;
-       valueTable[index] = value;
 
-       // assumes the threshold is never equal to the size of the table
-       if (++elementSize > threshold)
-               rehash();
-       return value;
-}
-private void rehash() {
-       HashtableOfPackage newHashtable = new HashtableOfPackage(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]);
+       public PackageBinding 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.prefixEquals(currentKey, key))
+                               return valueTable[index];
+                       index = (index + 1) % keyTable.length;
+               }
+               return null;
+       }
 
-       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$
-       PackageBinding pkg;
-       for (int i = 0, length = valueTable.length; i < length; i++)
-               if ((pkg = valueTable[i]) != null)
-                       s += pkg.toString() + "\n"; //$NON-NLS-1$
-       return s;
-}
+       public PackageBinding put(char[] key, PackageBinding value) {
+               int index = CharOperation.hashCode(key) % valueTable.length;
+               int keyLength = key.length;
+               char[] currentKey;
+               while ((currentKey = keyTable[index]) != null) {
+                       if (currentKey.length == keyLength
+                                       && CharOperation.prefixEquals(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;
+       }
+
+       private void rehash() {
+               HashtableOfPackage newHashtable = new HashtableOfPackage(
+                               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$
+               PackageBinding pkg;
+               for (int i = 0, length = valueTable.length; i < length; i++)
+                       if ((pkg = valueTable[i]) != null)
+                               s += pkg.toString() + "\n"; //$NON-NLS-1$
+               return s;
+       }
 }