/** * Put this new (key, value) pair into this hash table and return the value * that was previously associated with <code>key</code> or null in case of * an insertion. */ public T put(long key, T value) { if (size >= maxSize) { assert size == maxSize; grow(); } assert size < maxSize; return set(key, value); }
@Override protected void removeAndAdd(long index) { final long key = keys.get(index); final T value = values.set(index, null); --size; final T removed = set(key, value); assert removed == null; }
/** * Put this new (key, value) pair into this hash table and return the value * that was previously associated with <code>key</code> or null in case of * an insertion. */ public T put(long key, T value) { if (size >= maxSize) { assert size == maxSize; grow(); } assert size < maxSize; return set(key, value); }
/** * Put this new (key, value) pair into this hash table and return the value * that was previously associated with <code>key</code> or null in case of * an insertion. */ public T put(long key, T value) { if (size >= maxSize) { assert size == maxSize; grow(); } assert size < maxSize; return set(key, value); }
/** * Put this new (key, value) pair into this hash table and return the value * that was previously associated with <code>key</code> or null in case of * an insertion. */ public T put(long key, T value) { if (size >= maxSize) { assert size == maxSize; grow(); } assert size < maxSize; return set(key, value); }
/** * Put this new (key, value) pair into this hash table and return the value * that was previously associated with <code>key</code> or null in case of * an insertion. */ public T put(long key, T value) { if (size >= maxSize) { assert size == maxSize; grow(); } assert size < maxSize; return set(key, value); }
@Override protected void removeAndAdd(long index) { final long key = keys.get(index); final T value = values.set(index, null); --size; final T removed = set(key, value); assert removed == null; }
@Override protected void removeAndAdd(long index) { final long key = keys.get(index); final T value = values.set(index, null); --size; final T removed = set(key, value); assert removed == null; }
@Override protected void removeAndAdd(long index) { final long key = keys.get(index); final T value = values.set(index, null); --size; final T removed = set(key, value); assert removed == null; }
@Override protected void removeAndAdd(long index) { final long key = keys.get(index); final T value = values.set(index, null); --size; final T removed = set(key, value); assert removed == null; }