Module org.elasticsearch.server
Package org.elasticsearch.common.util

Class IntNHash

java.lang.Object
org.elasticsearch.common.util.IntNHash
All Implemented Interfaces:
Closeable, AutoCloseable, Releasable
public final class IntNHash extends Object
Specialized hash table implementation maps N int values to ids. Collisions are resolved with open addressing and linear probing, growth is smooth thanks to BigArrays and capacity is always a multiple of N for faster identification of buckets. This class is not thread-safe.

  • Constructor Summary

    Constructors
    Constructor
    Description
    IntNHash(long capacity, int keySize, float maxLoadFactor, BigArrays bigArrays)
     
    IntNHash(long capacity, int keySize, BigArrays bigArrays)
     

  • Method Summary

    Modifier and Type
    Method
    Description
    long
    add(int[] keys)
    Try to add key.
    long
    capacity()
    Return the number of allocated slots to store this hash table.
    void
    close()
     
    long
    find(int[] keys)
     
    protected final long
    getAndSetId(long index, long id)
    Set the id provided key at 0 <= index <= capacity() and get the previous value or -1 if this slot is unused.
    int[]
    getKeys(long id)
     
    void
    getKeys(long id, int[] dst)
     
    protected final void
    grow()
     
    long
    id(long index)
    Get the id associated with key at 0 <= index <= capacity() or -1 if this slot is unused.
    protected void
    removeAndAdd(long index)
    Remove the entry at the given index and add it back
    protected void
    resize(long capacity)
    Resize to the given capacity.
    protected final void
    setId(long index, long id)
    Set the id provided key at 0 <= index <= 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

  • Constructor Details

    • IntNHash

      public IntNHash(long capacity, int keySize, BigArrays bigArrays)

    • IntNHash

      public IntNHash(long capacity, int keySize, float maxLoadFactor, BigArrays bigArrays)

  • Method Details

    • getKeys

      public int[] getKeys(long id)

    • getKeys

      public void getKeys(long id, int[] dst)

    • find

      public long find(int[] keys)

    • add

      public long add(int[] keys)
      Try to add key. Return its newly allocated id if it wasn't in the hash table yet, or -1-id if 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:
      close in interface AutoCloseable
      Specified by:
      close in interface Closeable
      Specified by:
      close in interface Releasable

    • id

      public long id(long index)
      Get the id associated with key at 0 <= index <= capacity() or -1 if this slot is unused.

    • setId

      protected final void setId(long index, long id)
      Set the id provided key at 0 <= index <= capacity() .

    • getAndSetId

      protected final long getAndSetId(long index, long id)
      Set the id provided key at 0 <= index <= capacity() and get the previous value or -1 if this slot is unused.

    • 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()