Package com.esotericsoftware.kryo.util
Class IntMap<V>
java.lang.Object
com.esotericsoftware.kryo.util.IntMap<V>
An unordered map that uses int keys. This implementation is a cuckoo hash map using 3 hashes (if table size is less than 2^16)
or 4 hashes (if table size is greater than or equal to 2^16), random walking, and a small stash for problematic keys. Null
values are allowed. No allocation is done except when growing the table size.
This map performs very fast get, containsKey, and remove (typically O(1), worst case O(log(n))). Put may be a bit slower, depending on hash collisions. Load factors greater than 0.91 greatly increase the chances the map will have to rehash to the next higher POT size.
This map performs very fast get, containsKey, and remove (typically O(1), worst case O(log(n))). Put may be a bit slower, depending on hash collisions. Load factors greater than 0.91 greatly increase the chances the map will have to rehash to the next higher POT size.
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionstatic class
static class
static class
private static class
static class
-
Field Summary
FieldsModifier and TypeFieldDescriptionprivate boolean
(package private) int
private static final int
private int
(package private) boolean
(package private) int[]
private float
private int
private static final int
private static final int
private static final int
private int
int
private int
(package private) int
private int
(package private) V[]
(package private) V
-
Constructor Summary
ConstructorsConstructorDescriptionIntMap()
Creates a new map with an initial capacity of 32 and a load factor of 0.8.IntMap
(int initialCapacity) Creates a new map with a load factor of 0.8.IntMap
(int initialCapacity, float loadFactor) Creates a new map with the specified initial capacity and load factor.Creates a new map identical to the specified map. -
Method Summary
Modifier and TypeMethodDescriptionvoid
clear()
void
clear
(int maximumCapacity) Clears the map and reduces the size of the backing arrays to be the specified capacity if they are larger.boolean
containsKey
(int key) private boolean
containsKeyStash
(int key) boolean
containsValue
(Object value, boolean identity) Returns true if the specified value is in the map.void
ensureCapacity
(int additionalCapacity) Increases the size of the backing array to acommodate the specified number of additional items.entries()
Returns an iterator for the entries in the map.int
Returns the key for the specified value, or notFound if it is not in the map.get
(int key) private V
private int
hash2
(int h) private int
hash3
(int h) private int
hash4
(int h) keys()
Returns an iterator for the keys in the map.private void
push
(int insertKey, V insertValue, int index1, int key1, int index2, int key2, int index3, int key3, int index4, int key4) void
private void
Skips checks for existing keys.private void
remove
(int key) (package private) V
removeStash
(int key) (package private) void
removeStashIndex
(int index) private void
resize
(int newSize) void
shrink
(int maximumCapacity) Reduces the size of the backing arrays to be the specified capacity or less.toString()
values()
Returns an iterator for the values in the map.
-
Field Details
-
PRIME2
private static final int PRIME2- See Also:
-
PRIME3
private static final int PRIME3- See Also:
-
PRIME4
private static final int PRIME4- See Also:
-
EMPTY
private static final int EMPTY- See Also:
-
size
public int size -
keyTable
int[] keyTable -
valueTable
V[] valueTable -
capacity
int capacity -
stashSize
int stashSize -
zeroValue
V zeroValue -
hasZeroValue
boolean hasZeroValue -
loadFactor
private float loadFactor -
hashShift
private int hashShift -
mask
private int mask -
threshold
private int threshold -
stashCapacity
private int stashCapacity -
pushIterations
private int pushIterations -
bigTable
private boolean bigTable
-
-
Constructor Details
-
IntMap
public IntMap()Creates a new map with an initial capacity of 32 and a load factor of 0.8. This map will hold 25 items before growing the backing table. -
IntMap
public IntMap(int initialCapacity) Creates a new map with a load factor of 0.8. This map will hold initialCapacity * 0.8 items before growing the backing table. -
IntMap
public IntMap(int initialCapacity, float loadFactor) Creates a new map with the specified initial capacity and load factor. This map will hold initialCapacity * loadFactor items before growing the backing table. -
IntMap
Creates a new map identical to the specified map.
-
-
Method Details
-
put
-
putAll
-
putResize
Skips checks for existing keys. -
push
private void push(int insertKey, V insertValue, int index1, int key1, int index2, int key2, int index3, int key3, int index4, int key4) -
putStash
-
get
-
get
-
getStash
-
remove
-
removeStash
-
removeStashIndex
void removeStashIndex(int index) -
shrink
public void shrink(int maximumCapacity) Reduces the size of the backing arrays to be the specified capacity or less. If the capacity is already less, nothing is done. If the map contains more items than the specified capacity, the next highest power of two capacity is used instead. -
clear
public void clear(int maximumCapacity) Clears the map and reduces the size of the backing arrays to be the specified capacity if they are larger. -
clear
public void clear() -
containsValue
Returns true if the specified value is in the map. Note this traverses the entire map and compares every value, which may be an expensive operation.- Parameters:
identity
- If true, uses == to compare the specified value with values in the map. If false, usesObject.equals(Object)
.
-
containsKey
public boolean containsKey(int key) -
containsKeyStash
private boolean containsKeyStash(int key) -
findKey
Returns the key for the specified value, or notFound if it is not in the map. Note this traverses the entire map and compares every value, which may be an expensive operation.- Parameters:
identity
- If true, uses == to compare the specified value with values in the map. If false, usesObject.equals(Object)
.
-
ensureCapacity
public void ensureCapacity(int additionalCapacity) Increases the size of the backing array to acommodate the specified number of additional items. Useful before adding many items to avoid multiple backing array resizes. -
resize
private void resize(int newSize) -
hash2
private int hash2(int h) -
hash3
private int hash3(int h) -
hash4
private int hash4(int h) -
toString
-
entries
Returns an iterator for the entries in the map. Remove is supported. Note that the same iterator instance is returned each time this method is called. Use theIntMap.Entries
constructor for nested or multithreaded iteration. -
values
Returns an iterator for the values in the map. Remove is supported. Note that the same iterator instance is returned each time this method is called. Use theIntMap.Entries
constructor for nested or multithreaded iteration. -
keys
Returns an iterator for the keys in the map. Remove is supported. Note that the same iterator instance is returned each time this method is called. Use theIntMap.Entries
constructor for nested or multithreaded iteration.
-