public long get(final long key) { final long[] entries = this.entries; int index = evenLongHash(key, mask); long candidateKey; while ((candidateKey = entries[index]) != missingValue) { if (candidateKey == key) { return entries[index + 1]; } index = next(index); } return missingValue; }
/** * Overloaded version of {@link Map#containsKey(Object)} that takes a primitive int key. * * @param key for indexing the {@link Map} * @return true if the key is found otherwise false. */ public boolean containsKey(final int key) { int index = intHash(key, mask); while (null != values[index]) { if (key == keys[index]) { return true; } index = ++index & mask; } return false; }
/** * Overloaded version of {@link Map#containsKey(Object)} that takes a primitive long key. * * @param key for indexing the {@link Map} * @return true if the key is found otherwise false. */ public boolean containsKey(final long key) { int index = longHash(key, mask); while (null != values[index]) { if (key == keys[index]) { return true; } index = ++index & mask; } return false; }
/** * Overloaded version of {@link Map#containsKey(Object)} that takes a primitive int key. * * @param key for indexing the {@link Map} * @return true if the key is found otherwise false. */ public boolean containsKey(final int key) { int index = intHash(key, mask); while (null != values[index]) { if (key == keys[index]) { return true; } index = ++index & mask; } return false; }
/** * Overloaded version of {@link Map#containsKey(Object)} that takes a primitive long key. * * @param key for indexing the {@link Map} * @return true if the key is found otherwise false. */ public boolean containsKey(final long key) { int index = longHash(key, mask); while (null != values[index]) { if (key == keys[index]) { return true; } index = ++index & mask; } return false; }
public long get(final long key) { final long[] entries = this.entries; int index = evenLongHash(key, mask); long candidateKey; while ((candidateKey = entries[index]) != missingValue) { if (candidateKey == key) { return entries[index + 1]; } index = next(index); } return missingValue; }
private void compactChain(int deleteIndex) { int index = deleteIndex; while (true) { index = ++index & mask; if (null == values[index]) { return; } final int hash = intHash(keys[index], mask); if ((index < hash && (hash <= deleteIndex || deleteIndex <= index)) || (hash <= deleteIndex && deleteIndex <= index)) { keys[deleteIndex] = keys[index]; values[deleteIndex] = values[index]; values[index] = null; deleteIndex = index; } } }
/** * Overloaded version of {@link Map#get(Object)} that takes a primitive long key. * * @param key for indexing the {@link Map} * @return the value if found otherwise null */ @SuppressWarnings("unchecked") public V get(final long key) { int index = longHash(key, mask); Object value; while (null != (value = values[index])) { if (key == keys[index]) { return (V) value; } index = ++index & mask; } return null; }
private void compactChain(int deleteIndex) { final long[] entries = this.entries; int index = deleteIndex; while (true) { index = next(index); if (entries[index] == missingValue) { return; } final int hash = evenLongHash(entries[index], mask); if ((index < hash && (hash <= deleteIndex || deleteIndex <= index)) || (hash <= deleteIndex && deleteIndex <= index)) { entries[deleteIndex] = entries[index]; entries[deleteIndex + 1] = entries[index + 1]; entries[index] = missingValue; entries[index + 1] = missingValue; deleteIndex = index; } } }
private void compactChain(int deleteIndex) { int index = deleteIndex; while (true) { index = ++index & mask; if (null == values[index]) { return; } final int hash = intHash(keys[index], mask); if ((index < hash && (hash <= deleteIndex || deleteIndex <= index)) || (hash <= deleteIndex && deleteIndex <= index)) { keys[deleteIndex] = keys[index]; values[deleteIndex] = values[index]; values[index] = null; deleteIndex = index; } } }
private void compactChain(int deleteIndex) { int index = deleteIndex; while (true) { index = ++index & mask; if (null == values[index]) { return; } final int hash = longHash(keys[index], mask); if ((index < hash && (hash <= deleteIndex || deleteIndex <= index)) || (hash <= deleteIndex && deleteIndex <= index)) { keys[deleteIndex] = keys[index]; values[deleteIndex] = values[index]; values[index] = null; deleteIndex = index; } } }
private void compactChain(int deleteIndex) { final long[] entries = this.entries; int index = deleteIndex; while (true) { index = next(index); if (entries[index] == missingValue) { return; } final int hash = evenLongHash(entries[index], mask); if ((index < hash && (hash <= deleteIndex || deleteIndex <= index)) || (hash <= deleteIndex && deleteIndex <= index)) { entries[deleteIndex] = entries[index]; entries[deleteIndex + 1] = entries[index + 1]; entries[index] = missingValue; entries[index + 1] = missingValue; deleteIndex = index; } } }
/** * Overloaded version of {@link Map#get(Object)} that takes a primitive int key. * * @param key for indexing the {@link Map} * @return the value if found otherwise null */ @SuppressWarnings("unchecked") public V get(final int key) { int index = intHash(key, mask); Object value; while (null != (value = values[index])) { if (key == keys[index]) { return (V) value; } index = ++index & mask; } return null; }
/** * Overloaded version of {@link Map#get(Object)} that takes a primitive long key. * * @param key for indexing the {@link Map} * @return the value if found otherwise null */ @SuppressWarnings("unchecked") public V get(final long key) { int index = longHash(key, mask); Object value; while (null != (value = values[index])) { if (key == keys[index]) { return (V) value; } index = ++index & mask; } return null; }
public long remove(final long key) { final long[] entries = this.entries; int index = evenLongHash(key, mask); long candidateKey; while ((candidateKey = entries[index]) != missingValue) { if (candidateKey == key) { final int valueIndex = index + 1; final long oldValue = entries[valueIndex]; entries[index] = missingValue; entries[valueIndex] = missingValue; size--; compactChain(index); return oldValue; } index = next(index); } return missingValue; }
/** * Overloaded version of {@link Map#get(Object)} that takes a primitive int key. * * @param key for indexing the {@link Map} * @return the value if found otherwise null */ @SuppressWarnings("unchecked") public V get(final int key) { int index = intHash(key, mask); Object value; while (null != (value = values[index])) { if (key == keys[index]) { return (V) value; } index = ++index & mask; } return null; }
private void compactChain(int deleteIndex) { int index = deleteIndex; while (true) { index = ++index & mask; if (null == values[index]) { return; } final int hash = longHash(keys[index], mask); if ((index < hash && (hash <= deleteIndex || deleteIndex <= index)) || (hash <= deleteIndex && deleteIndex <= index)) { keys[deleteIndex] = keys[index]; values[deleteIndex] = values[index]; values[index] = null; deleteIndex = index; } } }
public long remove(final long key) { final long[] entries = this.entries; int index = evenLongHash(key, mask); long candidateKey; while ((candidateKey = entries[index]) != missingValue) { if (candidateKey == key) { final int valueIndex = index + 1; final long oldValue = entries[valueIndex]; entries[index] = missingValue; entries[valueIndex] = missingValue; size--; compactChain(index); return oldValue; } index = next(index); } return missingValue; }
private void rehash(final int newCapacity) { if (1 != Integer.bitCount(newCapacity)) { throw new IllegalStateException("New capacity must be a power of two"); } capacity = newCapacity; mask = newCapacity - 1; resizeThreshold = (int) (newCapacity * loadFactor); final int[] tempKeys = new int[capacity]; final Object[] tempValues = new Object[capacity]; for (int i = 0, size = values.length; i < size; i++) { final Object value = values[i]; if (null != value) { final int key = keys[i]; int newHash = intHash(key, mask); while (null != tempValues[newHash]) { newHash = ++newHash & mask; } tempKeys[newHash] = key; tempValues[newHash] = value; } } keys = tempKeys; values = tempValues; }
private void rehash(final int newCapacity) { if (1 != Integer.bitCount(newCapacity)) { throw new IllegalStateException("New capacity must be a power of two"); } capacity = newCapacity; mask = newCapacity - 1; resizeThreshold = (int) (newCapacity * loadFactor); final long[] tempKeys = new long[capacity]; final Object[] tempValues = new Object[capacity]; for (int i = 0, size = values.length; i < size; i++) { final Object value = values[i]; if (null != value) { final long key = keys[i]; int newHash = longHash(key, mask); while (null != tempValues[newHash]) { newHash = ++newHash & mask; } tempKeys[newHash] = key; tempValues[newHash] = value; } } keys = tempKeys; values = tempValues; }