public synchronized boolean containsKey(long key) { LongKeyEntry tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry e = tab[index]; e != null; e = e.next) { if (e.key == key) { return true; } } return false; }
public synchronized boolean containsKey(long key) { LongKeyEntry tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry e = tab[index]; e != null; e = e.next) { if (e.key == key) { return true; } } return false; }
public synchronized boolean containsKey(long key) { LongKeyEntry tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry e = tab[index]; e != null; e = e.next) { if (e.key == key) { return true; } } return false; }
public synchronized V get(long key) { LongKeyEntry<V> tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry e = tab[index]; e != null; e = e.next) { if (e.key == key) { return (V) e.value; } } return null; }
public synchronized boolean containsKey(long key) { LongKeyEntry tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry e = tab[index]; e != null; e = e.next) { if (e.key == key) { return true; } } return false; }
public synchronized V get(long key) { LongKeyEntry<V> tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry e = tab[index]; e != null; e = e.next) { if (e.key == key) { return (V) e.value; } } return null; }
public synchronized boolean containsKey(long key) { LongKeyEntry tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry e = tab[index]; e != null; e = e.next) { if (e.key == key) { return true; } } return false; }
public synchronized V get(long key) { LongKeyEntry<V> tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry e = tab[index]; e != null; e = e.next) { if (e.key == key) { return (V) e.value; } } return null; }
public synchronized V get(long key) { LongKeyEntry<V> tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry e = tab[index]; e != null; e = e.next) { if (e.key == key) { return (V) e.value; } } return null; }
public synchronized V get(long key) { LongKeyEntry<V> tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry e = tab[index]; e != null; e = e.next) { if (e.key == key) { return (V) e.value; } } return null; }
public synchronized Object remove(long key) { LongKeyEntry tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry e = tab[index], prev = null; e != null; prev = e, e = e.next) { if (e.key == key) { if (prev != null) { prev.next = e.next; } else { tab[index] = e.next; } count--; Object oldValue = e.value; e.value = null; return oldValue; } } return null; }
protected void rehash() { int oldCapacity = table.length; LongKeyEntry oldMap[] = table; int newCapacity = oldCapacity * 2 + 1; LongKeyEntry newMap[] = new LongKeyEntry[newCapacity]; threshold = (int) (newCapacity * loadFactor); table = newMap; for (int i = oldCapacity; i-- > 0;) { LongKeyEntry old = oldMap[i]; while (old != null) { LongKeyEntry e = old; old = old.next; long key = e.key; int index = hash(key) % newCapacity; e.next = newMap[index]; newMap[index] = e; } } }
public synchronized Object remove(long key) { LongKeyEntry tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry e = tab[index], prev = null; e != null; prev = e, e = e.next) { if (e.key == key) { if (prev != null) { prev.next = e.next; } else { tab[index] = e.next; } count--; Object oldValue = e.value; e.value = null; return oldValue; } } return null; }
public synchronized Object remove(long key) { LongKeyEntry tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry e = tab[index], prev = null; e != null; prev = e, e = e.next) { if (e.key == key) { if (prev != null) { prev.next = e.next; } else { tab[index] = e.next; } count--; Object oldValue = e.value; e.value = null; return oldValue; } } return null; }
public synchronized Object remove(long key) { LongKeyEntry tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry e = tab[index], prev = null; e != null; prev = e, e = e.next) { if (e.key == key) { if (prev != null) { prev.next = e.next; } else { tab[index] = e.next; } count--; Object oldValue = e.value; e.value = null; return oldValue; } } return null; }
public synchronized Object remove(long key) { LongKeyEntry tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry e = tab[index], prev = null; e != null; prev = e, e = e.next) { if (e.key == key) { if (prev != null) { prev.next = e.next; } else { tab[index] = e.next; } count--; Object oldValue = e.value; e.value = null; return oldValue; } } return null; }
protected void rehash() { int oldCapacity = table.length; LongKeyEntry oldMap[] = table; int newCapacity = oldCapacity * 2 + 1; LongKeyEntry newMap[] = new LongKeyEntry[newCapacity]; threshold = (int) (newCapacity * loadFactor); table = newMap; for (int i = oldCapacity; i-- > 0;) { LongKeyEntry old = oldMap[i]; while (old != null) { LongKeyEntry e = old; old = old.next; long key = e.key; int index = hash(key) % newCapacity; e.next = newMap[index]; newMap[index] = e; } } }
public synchronized V put(long key, V value) { LongKeyEntry<V> tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry<V> e = tab[index]; e != null; e = e.next) { if (e.key == key) { V old = e.value; e.value = value; return old; } } if (count >= threshold) { rehash(); tab = table; index = hash(key) % tab.length; } LongKeyEntry e = new LongKeyEntry(key, value, tab[index]); tab[index] = e; count++; return null; }
public synchronized V put(long key, V value) { LongKeyEntry<V> tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry<V> e = tab[index]; e != null; e = e.next) { if (e.key == key) { V old = e.value; e.value = value; return old; } } if (count >= threshold) { rehash(); tab = table; index = hash(key) % tab.length; } LongKeyEntry e = new LongKeyEntry(key, value, tab[index]); tab[index] = e; count++; return null; }
public synchronized V put(long key, V value) { LongKeyEntry<V> tab[] = table; int index = hash(key) % tab.length; for (LongKeyEntry<V> e = tab[index]; e != null; e = e.next) { if (e.key == key) { V old = e.value; e.value = value; return old; } } if (count >= threshold) { rehash(); tab = table; index = hash(key) % tab.length; } LongKeyEntry e = new LongKeyEntry(key, value, tab[index]); tab[index] = e; count++; return null; }