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