Package org.elasticsearch.common.util
Class LongHash
- java.lang.Object
-
- org.elasticsearch.common.util.LongHash
-
- All Implemented Interfaces:
java.io.Closeable,java.lang.AutoCloseable,Releasable
public final class LongHash extends java.lang.ObjectSpecialized hash table implementation similar to BytesRefHash that maps long values to ids. Collisions are resolved with open addressing and linear probing, growth is smooth thanks toBigArraysand capacity is always a multiple of 2 for faster identification of buckets. This class is not thread-safe.
-
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description longadd(long key)Try to addkey.longcapacity()Return the number of allocated slots to store this hash table.voidclose()longfind(long key)Get the id associated withkeyor -1 if the key is not contained in the hash.longget(long id)Return the key at0 <= index <= capacity().protected voidgrow()longid(long index)Get the id associated with key at0 <= index <= capacity()or -1 if this slot is unused.protected longid(long index, long id)protected voidremoveAndAdd(long index)Remove the entry at the given index and add it backprotected voidresize(long capacity)Resize to the given capacity.longsize()Return the number of longs in this hash table.protected booleanused(long bucket)
-
-
-
Method Detail
-
get
public long get(long id)
Return the key at0 <= index <= capacity(). The result is undefined if the slot is unused.
-
find
public long find(long key)
Get the id associated withkeyor -1 if the key is not contained in the hash.
-
add
public long add(long key)
Try to addkey. Return its newly allocated id if it wasn't in the hash table yet, or-1-idif it was already present in the hash table.
-
removeAndAdd
protected void removeAndAdd(long index)
Remove the entry at the given index and add it back
-
close
public void close()
- Specified by:
closein interfacejava.lang.AutoCloseable- Specified by:
closein interfacejava.io.Closeable- Specified by:
closein interfaceReleasable
-
id
public long id(long index)
Get the id associated with key at0 <= index <= capacity()or -1 if this slot is unused.
-
id
protected final long id(long index, long id)
-
resize
protected void resize(long capacity)
Resize to the given capacity.
-
used
protected boolean used(long bucket)
-
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()
-
-