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

[phpeclipse.git] / net.sourceforge.phpeclipse / src / net / sourceforge / phpdt / internal / core / util / SimpleLookupTable.java

diff --git a/net.sourceforge.phpeclipse/src/net/sourceforge/phpdt/internal/core/util/SimpleLookupTable.java b/net.sourceforge.phpeclipse/src/net/sourceforge/phpdt/internal/core/util/SimpleLookupTable.java
index 0caafdd..0292b38 100644 (file)
--- a/net.sourceforge.phpeclipse/src/net/sourceforge/phpdt/internal/core/util/SimpleLookupTable.java
+++ b/net.sourceforge.phpeclipse/src/net/sourceforge/phpdt/internal/core/util/SimpleLookupTable.java
@@ -26,9 +26,9 @@ public final class SimpleLookupTable implements Cloneable {
 
        public int threshold;
 
-       public SimpleLookupTable() {
-               this(13);
-       }
+//     public SimpleLookupTable() {
+//             this(13);
+//     }
 
        public SimpleLookupTable(int size) {
                if (size < 3)
@@ -81,13 +81,13 @@ public final class SimpleLookupTable implements Cloneable {
                return null;
        }
 
-       public Object keyForValue(Object valueToMatch) {
-               if (valueToMatch != null)
-                       for (int i = 0, l = valueTable.length; i < l; i++)
-                               if (valueToMatch.equals(valueTable[i]))
-                                       return keyTable[i];
-               return null;
-       }
+//     public Object keyForValue(Object valueToMatch) {
+//             if (valueToMatch != null)
+//                     for (int i = 0, l = valueTable.length; i < l; i++)
+//                             if (valueToMatch.equals(valueTable[i]))
+//                                     return keyTable[i];
+//             return null;
+//     }
 
        public Object put(Object key, Object value) {
                int length = keyTable.length;
@@ -108,42 +108,42 @@ public final class SimpleLookupTable implements Cloneable {
                return value;
        }
 
-       public Object removeKey(Object key) {
-               int length = keyTable.length;
-               int index = (key.hashCode() & 0x7FFFFFFF) % length;
-               Object currentKey;
-               while ((currentKey = keyTable[index]) != null) {
-                       if (currentKey.equals(key)) {
-                               elementSize--;
-                               Object oldValue = valueTable[index];
-                               keyTable[index] = null;
-                               valueTable[index] = null;
-                               if (keyTable[index + 1 == length ? 0 : index + 1] != null)
-                                       rehash(); // only needed if a possible collision existed
-                               return oldValue;
-                       }
-                       if (++index == length)
-                               index = 0;
-               }
-               return null;
-       }
-
-       public void removeValue(Object valueToRemove) {
-               boolean rehash = false;
-               for (int i = 0, l = valueTable.length; i < l; i++) {
-                       Object value = valueTable[i];
-                       if (value != null && value.equals(valueToRemove)) {
-                               elementSize--;
-                               keyTable[i] = null;
-                               valueTable[i] = null;
-                               if (!rehash && keyTable[i + 1 == l ? 0 : i + 1] != null)
-                                       rehash = true; // only needed if a possible collision
-                                                                       // existed
-                       }
-               }
-               if (rehash)
-                       rehash();
-       }
+//     public Object removeKey(Object key) {
+//             int length = keyTable.length;
+//             int index = (key.hashCode() & 0x7FFFFFFF) % length;
+//             Object currentKey;
+//             while ((currentKey = keyTable[index]) != null) {
+//                     if (currentKey.equals(key)) {
+//                             elementSize--;
+//                             Object oldValue = valueTable[index];
+//                             keyTable[index] = null;
+//                             valueTable[index] = null;
+//                             if (keyTable[index + 1 == length ? 0 : index + 1] != null)
+//                                     rehash(); // only needed if a possible collision existed
+//                             return oldValue;
+//                     }
+//                     if (++index == length)
+//                             index = 0;
+//             }
+//             return null;
+//     }
+
+//     public void removeValue(Object valueToRemove) {
+//             boolean rehash = false;
+//             for (int i = 0, l = valueTable.length; i < l; i++) {
+//                     Object value = valueTable[i];
+//                     if (value != null && value.equals(valueToRemove)) {
+//                             elementSize--;
+//                             keyTable[i] = null;
+//                             valueTable[i] = null;
+//                             if (!rehash && keyTable[i + 1 == l ? 0 : i + 1] != null)
+//                                     rehash = true; // only needed if a possible collision
+//                                                                     // existed
+//                     }
+//             }
+//             if (rehash)
+//                     rehash();
+//     }
 
        private void rehash() {
                SimpleLookupTable newLookupTable = new SimpleLookupTable(