public synchronized int remove(int key) { IntIntLinkedEntry tab[] = table; int index = hash(key) % tab.length; IntIntLinkedEntry e = tab[index]; IntIntLinkedEntry prev = null; while (e != null) { if (CompareUtil.equals(e.key, key)) { if (prev != null) { prev.hash_next = e.hash_next; } else { tab[index] = e.hash_next; } count--; int oldValue = e.value; e.value = NONE; // unchain(e); return oldValue; } prev = e; e = e.hash_next; } return NONE; }
public synchronized int remove(int key) { IntIntLinkedEntry tab[] = table; int index = hash(key) % tab.length; IntIntLinkedEntry e = tab[index]; IntIntLinkedEntry prev = null; while (e != null) { if (CompareUtil.equals(e.key, key)) { if (prev != null) { prev.hash_next = e.hash_next; } else { tab[index] = e.hash_next; } count--; int oldValue = e.value; e.value = NONE; // unchain(e); return oldValue; } prev = e; e = e.hash_next; } return NONE; }
public synchronized int remove(int key) { IntIntLinkedEntry tab[] = table; int index = hash(key) % tab.length; IntIntLinkedEntry e = tab[index]; IntIntLinkedEntry prev = null; while (e != null) { if (CompareUtil.equals(e.key, key)) { if (prev != null) { prev.hash_next = e.hash_next; } else { tab[index] = e.hash_next; } count--; int oldValue = e.value; e.value = NONE; // unchain(e); return oldValue; } prev = e; e = e.hash_next; } return NONE; }
public synchronized int remove(int key) { IntIntLinkedEntry tab[] = table; int index = hash(key) % tab.length; IntIntLinkedEntry e = tab[index]; IntIntLinkedEntry prev = null; while (e != null) { if (CompareUtil.equals(e.key, key)) { if (prev != null) { prev.hash_next = e.hash_next; } else { tab[index] = e.hash_next; } count--; int oldValue = e.value; e.value = NONE; // unchain(e); return oldValue; } prev = e; e = e.hash_next; } return NONE; }
public synchronized int remove(int key) { IntIntLinkedEntry tab[] = table; int index = hash(key) % tab.length; IntIntLinkedEntry e = tab[index]; IntIntLinkedEntry prev = null; while (e != null) { if (CompareUtil.equals(e.key, key)) { if (prev != null) { prev.hash_next = e.hash_next; } else { tab[index] = e.hash_next; } count--; int oldValue = e.value; e.value = NONE; // unchain(e); return oldValue; } prev = e; e = e.hash_next; } return NONE; }
public synchronized int remove(int key) { IntIntLinkedEntry tab[] = table; int index = hash(key) % tab.length; IntIntLinkedEntry e = tab[index]; IntIntLinkedEntry prev = null; while (e != null) { if (CompareUtil.equals(e.key, key)) { if (prev != null) { prev.hash_next = e.hash_next; } else { tab[index] = e.hash_next; } count--; int oldValue = e.value; e.value = NONE; // unchain(e); return oldValue; } prev = e; e = e.hash_next; } return NONE; }
public synchronized int remove(int key) { IntIntLinkedEntry tab[] = table; int index = hash(key) % tab.length; IntIntLinkedEntry e = tab[index]; IntIntLinkedEntry prev = null; while (e != null) { if (CompareUtil.equals(e.key, key)) { if (prev != null) { prev.hash_next = e.hash_next; } else { tab[index] = e.hash_next; } count--; int oldValue = e.value; e.value = NONE; // unchain(e); return oldValue; } prev = e; e = e.hash_next; } return NONE; }
public synchronized int remove(int key) { IntIntLinkedEntry tab[] = table; int index = hash(key) % tab.length; IntIntLinkedEntry e = tab[index]; IntIntLinkedEntry prev = null; while (e != null) { if (CompareUtil.equals(e.key, key)) { if (prev != null) { prev.hash_next = e.hash_next; } else { tab[index] = e.hash_next; } count--; int oldValue = e.value; e.value = NONE; // unchain(e); return oldValue; } prev = e; e = e.hash_next; } return NONE; }