public boolean add(long item1, long item2) { checkBiggerEqualZero(item1); long h = hash(item1, item2); return getSection(h).add(item1, item2, (int) h); }
public boolean contains(long item1, long item2) { checkBiggerEqualZero(item1); long h = hash(item1, item2); return getSection(h).contains(item1, item2, (int) h); }
public void forEach(LongPairConsumer processor) { for (Section s : sections) { s.forEach(processor); } }
public V computeIfAbsent(K key, Function<K, V> provider) { checkNotNull(key); checkNotNull(provider); long h = hash(key); return getSection(h).put(key, null, (int) h, true, provider); }
public V get(long key) { long h = hash(key); return getSection(h).get(key, (int) h); }
public boolean contains(V value) { checkNotNull(value); long h = hash(value); return getSection(h).contains(value, (int) h); }
public V get(K key) { checkNotNull(key); long h = hash(key); return getSection(h).get(key, (int) h); }
public V put(long key, V value) { checkNotNull(value); long h = hash(key); return getSection(h).put(key, value, (int) h, false, null); }
public V remove(long key) { long h = hash(key); return getSection(h).remove(key, null, (int) h); }
@Override public boolean offer(T e) { // Queue is unbounded and it will never reject new items put(e); return true; }
public void clear() { for (Section<V> s : sections) { s.clear(); } }
public void clear() { for (Section s : sections) { s.clear(); } }
public void forEach(Consumer<? super V> processor) { for (Section<V> s : sections) { s.forEach(processor); } }
public void clear() { for (Section<K, V> s : sections) { s.clear(); } }
public void clear() { for (Section<V> s : sections) { s.clear(); } }
public V put(K key, V value) { checkNotNull(key); checkNotNull(value); long h = hash(key); return getSection(h).put(key, value, (int) h, false, null); }
@Override public boolean add(T e) { put(e); return true; }
public V putIfAbsent(K key, V value) { checkNotNull(key); checkNotNull(value); long h = hash(key); return getSection(h).put(key, value, (int) h, true, null); }
@Override public boolean offer(T e, long timeout, TimeUnit unit) { // Queue is unbounded and it will never reject new items put(e); return true; }