Package org.opensearch.common.util
Class LongObjectPagedHashMap<T>
java.lang.Object
org.opensearch.common.util.LongObjectPagedHashMap<T>
- All Implemented Interfaces:
Closeable
,AutoCloseable
,Iterable<LongObjectPagedHashMap.Cursor<T>>
,org.opensearch.common.lease.Releasable
public class LongObjectPagedHashMap<T>
extends Object
implements Iterable<LongObjectPagedHashMap.Cursor<T>>
A hash table from native longs to objects. This implementation resolves collisions
using open-addressing and does not support null values. This class is not thread-safe.
- Opensearch.internal:
-
Nested Class Summary
Modifier and TypeClassDescriptionstatic final class
Cursor for the map -
Constructor Summary
ConstructorDescriptionLongObjectPagedHashMap
(long capacity, float maxLoadFactor, BigArrays bigArrays) LongObjectPagedHashMap
(long capacity, BigArrays bigArrays) -
Method Summary
Modifier and TypeMethodDescriptionlong
capacity()
Return the number of allocated slots to store this hash table.void
close()
get
(long key) Get the value that is associated withkey
or null ifkey
was not present in the hash table.protected final void
grow()
iterator()
Put this new (key, value) pair into this hash table and return the value that was previously associated withkey
or null in case of an insertion.remove
(long key) Remove the entry which has this key in the hash table and return the associated value or null if there was no entry associated with this key.protected void
removeAndAdd
(long index) Remove the entry at the given index and add it backprotected void
resize
(long capacity) Resize to the given capacity.long
size()
Return the number of longs in this hash table.protected boolean
used
(long bucket) Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
Methods inherited from interface java.lang.Iterable
forEach, spliterator
-
Constructor Details
-
LongObjectPagedHashMap
-
LongObjectPagedHashMap
-
-
Method Details
-
get
Get the value that is associated withkey
or null ifkey
was not present in the hash table. -
put
Put this new (key, value) pair into this hash table and return the value that was previously associated withkey
or null in case of an insertion. -
remove
Remove the entry which has this key in the hash table and return the associated value or null if there was no entry associated with this key. -
iterator
-
close
public void close()- Specified by:
close
in interfaceAutoCloseable
- Specified by:
close
in interfaceCloseable
- Specified by:
close
in interfaceorg.opensearch.common.lease.Releasable
-
resize
protected void resize(long capacity) Resize to the given capacity. -
used
protected boolean used(long bucket) -
removeAndAdd
protected void removeAndAdd(long index) Remove the entry at the given index and add it back -
capacity
public long capacity()Return the number of allocated slots to store this hash table. -
size
public long size()Return the number of longs in this hash table. -
grow
protected final void grow()
-