public synchronized V remove(String key) { if (key == null) return null; StringKeyLinkedEntry<V> tab[] = table; int index = hash(key) % tab.length; for (StringKeyLinkedEntry<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(String key) { if (key == null) return null; StringKeyLinkedEntry<V> tab[] = table; int index = hash(key) % tab.length; for (StringKeyLinkedEntry<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(String key) { if (key == null) return null; StringKeyLinkedEntry<V> tab[] = table; int index = hash(key) % tab.length; for (StringKeyLinkedEntry<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(String key) { if (key == null) return null; StringKeyLinkedEntry<V> tab[] = table; int index = hash(key) % tab.length; for (StringKeyLinkedEntry<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(String key) { if (key == null) return null; StringKeyLinkedEntry<V> tab[] = table; int index = hash(key) % tab.length; for (StringKeyLinkedEntry<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(String key) { if (key == null) return null; StringKeyLinkedEntry<V> tab[] = table; int index = hash(key) % tab.length; for (StringKeyLinkedEntry<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(String key) { if (key == null) return null; StringKeyLinkedEntry<V> tab[] = table; int index = hash(key) % tab.length; for (StringKeyLinkedEntry<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(String key) { if (key == null) return null; StringKeyLinkedEntry<V> tab[] = table; int index = hash(key) % tab.length; for (StringKeyLinkedEntry<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; }