@Override public boolean containsKey(final Object key) { return containsKey((long) (Long) key); }
@Override public boolean containsValue(final Object value) { return containsValue((long) (Long) value); }
private Long2LongHashMap(double loadFactor, long missingValue) { this.entrySet = entrySetSingleton(); this.keySet = keySetSingleton(); this.values = valuesSingleton(); this.valueIterator = new LongIterator(1); this.loadFactor = loadFactor; this.missingValue = missingValue; }
@Override public String toString() { final StringBuilder b = new StringBuilder(size() * 8); b.append('{'); longForEach(new LongLongConsumer() { String separator = ""; @Override public void accept(long key, long value) { b.append(separator).append(key).append("->").append(value); separator = " "; } }); return b.append('}').toString(); }
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; }
public long put(final long key, final long value) { assert key != missingValue : "Invalid key " + key; assert value != missingValue : "Invalid value " + value; long oldValue = missingValue; int index = evenLongHash(key, mask); long candidateKey; while ((candidateKey = entries[index]) != missingValue) { if (candidateKey == key) { oldValue = entries[index + 1]; break; } index = next(index); } if (oldValue == missingValue) { ++size; entries[index] = key; } entries[index + 1] = value; checkResize(); return oldValue; }
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; }
/** * Long primitive specialised containsKey. * * @param key the key to check. * @return true if the map contains key as a key, false otherwise. */ public boolean containsKey(final long key) { return get(key) != missingValue; }
public Long2LongHashMap(int initialCapacity, double loadFactor, long missingValue) { this(loadFactor, missingValue); capacity(QuickMath.nextPowerOfTwo(initialCapacity)); }
public void forEach(final BiConsumer<? super Long, ? super Long> action) { longForEach(new UnboxingBiConsumer(action)); }
private Long2LongHashMap(double loadFactor, long missingValue) { this.entrySet = entrySetSingleton(); this.keySet = keySetSingleton(); this.values = valuesSingleton(); this.valueIterator = new LongIterator(1); this.loadFactor = loadFactor; this.missingValue = missingValue; }
@Override public String toString() { final StringBuilder b = new StringBuilder(size() * 8); b.append('{'); longForEach(new LongLongConsumer() { String separator = ""; @Override public void accept(long key, long value) { b.append(separator).append(key).append("->").append(value); separator = " "; } }); return b.append('}').toString(); }
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; }
public long put(final long key, final long value) { assert key != missingValue : "Invalid key " + key; assert value != missingValue : "Invalid value " + value; long oldValue = missingValue; int index = evenLongHash(key, mask); long candidateKey; while ((candidateKey = entries[index]) != missingValue) { if (candidateKey == key) { oldValue = entries[index + 1]; break; } index = next(index); } if (oldValue == missingValue) { ++size; entries[index] = key; } entries[index + 1] = value; checkResize(); return oldValue; }
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; }
/** * Long primitive specialised containsKey. * * @param key the key to check. * @return true if the map contains key as a key, false otherwise. */ public boolean containsKey(final long key) { return get(key) != missingValue; }
public Long2LongHashMap(int initialCapacity, double loadFactor, long missingValue) { this(loadFactor, missingValue); capacity(QuickMath.nextPowerOfTwo(initialCapacity)); }
public void forEach(final BiConsumer<? super Long, ? super Long> action) { longForEach(new UnboxingBiConsumer(action)); }