public synchronized long remove(long key) { LongLongLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (LongLongLinkedEntry 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--; long oldValue = e.value; e.value = NONE; // unchain(e); return oldValue; } } return NONE; }
public synchronized long remove(long key) { LongLongLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (LongLongLinkedEntry 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--; long oldValue = e.value; e.value = NONE; // unchain(e); return oldValue; } } return NONE; }
public synchronized long remove(long key) { LongLongLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (LongLongLinkedEntry 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--; long oldValue = e.value; e.value = NONE; // unchain(e); return oldValue; } } return NONE; }
public synchronized long remove(long key) { LongLongLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (LongLongLinkedEntry 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--; long oldValue = e.value; e.value = NONE; // unchain(e); return oldValue; } } return NONE; }
public synchronized long remove(long key) { LongLongLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (LongLongLinkedEntry 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--; long oldValue = e.value; e.value = NONE; // unchain(e); return oldValue; } } return NONE; }
public synchronized long remove(long key) { LongLongLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (LongLongLinkedEntry 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--; long oldValue = e.value; e.value = NONE; // unchain(e); return oldValue; } } return NONE; }
public synchronized long remove(long key) { LongLongLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (LongLongLinkedEntry 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--; long oldValue = e.value; e.value = NONE; // unchain(e); return oldValue; } } return NONE; }
public synchronized long remove(long key) { LongLongLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (LongLongLinkedEntry 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--; long oldValue = e.value; e.value = NONE; // unchain(e); return oldValue; } } return NONE; }