Package org.infinispan.commons.util

Class HopscotchHashMap<K,V>

java.lang.Object

java.util.AbstractMap<K,V>

org.infinispan.commons.util.ArrayMap<K,V>

org.infinispan.commons.util.HopscotchHashMap<K,V>

All Implemented Interfaces:

Map<K,V>

public class HopscotchHashMap<K,V>
extends ArrayMap<K,V>

Lookup on a table without collisions will require only single access, if there are collisions it will be limited to (number of collisions to particular bin + 1) and all those will lie in proximity (32 * reference size). Inserts can be O(n) in the worst case when we have to rehash whole table or search through close-to-full for an empty spot.

Not thread safe (though, look-ups are safe when there are no concurrent modifications).

See Also:

• Hopscotch hashing

Field Summary

Fields inherited from class org.infinispan.commons.util.ArrayMap

keys, modCount, size, values

Constructor Summary

Constructors

Constructor	Description
HopscotchHashMap(int initialCapacity)

Method Summary

Modifier and Type	Method	Description
V	get(Object key)
V	put(K key, V value)
V	remove(Object key)

Methods inherited from class org.infinispan.commons.util.ArrayMap

clear, containsKey, containsValue, entrySet, keySet, size, values

Constructor Details

HopscotchHashMap

public HopscotchHashMap(int initialCapacity)

Method Details

get

public V get(Object key)

Specified by:

get in class ArrayMap<K,V>

put

public V put(K key,
 V value)

Specified by:

put in class ArrayMap<K,V>

remove

public V remove(Object key)

Specified by:

remove in class ArrayMap<K,V>