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; }
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; }
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; }