Package arc.struct
Class ObjectIntMap<K>
java.lang.Object
arc.struct.ObjectIntMap<K>
- All Implemented Interfaces:
Iterable<ObjectIntMap.Entry<K>>
An unordered map where the values are ints. This implementation is a cuckoo hash map using 3 hashes, random walking, and a
small stash for problematic keys. Null keys are not 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
Modifier and TypeClassDescriptionstatic class
static class
static class
static class
-
Field Summary
-
Constructor Summary
ConstructorDescriptionCreates a new map with an initial capacity of 51 and a load factor of 0.8.ObjectIntMap
(int initialCapacity) Creates a new map with a load factor of 0.8.ObjectIntMap
(int initialCapacity, float loadFactor) Creates a new map with the specified initial capacity and load factor.ObjectIntMap
(ObjectIntMap<? extends K> map) 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
(K key) boolean
containsValue
(int value) Returns true if the specified value is in the map.void
ensureCapacity
(int additionalCapacity) Increases the size of the backing array to accommodate the specified number of additional items.entries()
Returns an iterator for the entries in the map.boolean
findKey
(int value) Returns the key for the specified value, or null if it is not in the map.int
int
int
hashCode()
int
int
int
Returns the key's current value and increments the stored value.boolean
isEmpty()
Returns true if the map is empty.iterator()
keys()
Returns an iterator for the keys in the map.void
void
putAll
(ObjectIntMap<? extends K> map) void
int
int
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.Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
Methods inherited from interface java.lang.Iterable
forEach, spliterator
-
Field Details
-
size
public int size
-
-
Constructor Details
-
ObjectIntMap
public ObjectIntMap()Creates a new map with an initial capacity of 51 and a load factor of 0.8. -
ObjectIntMap
public ObjectIntMap(int initialCapacity) Creates a new map with a load factor of 0.8.- Parameters:
initialCapacity
- If not a power of two, it is increased to the next nearest power of two.
-
ObjectIntMap
public ObjectIntMap(int initialCapacity, float loadFactor) Creates a new map with the specified initial capacity and load factor. This map will hold initialCapacity items before growing the backing table.- Parameters:
initialCapacity
- If not a power of two, it is increased to the next nearest power of two.
-
ObjectIntMap
Creates a new map identical to the specified map.
-
-
Method Details
-
put
-
putAll
-
putAll
-
get
-
get
- Parameters:
defaultValue
- Returned if the key was not associated with a value.
-
increment
-
increment
-
increment
Returns the key's current value and increments the stored value. If the key is not in the map, defaultValue + increment is put into the map. -
remove
- Returns:
- 0 as default value.
-
remove
- Returns:
- the value that was removed, or defaultValue.
-
isEmpty
public boolean isEmpty()Returns true if the map is empty. -
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
public boolean containsValue(int value) 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. -
containsKey
-
findKey
Returns the key for the specified value, or null if it is not in the map. Note this traverses the entire map and compares every value, which may be an expensive operation. -
ensureCapacity
public void ensureCapacity(int additionalCapacity) Increases the size of the backing array to accommodate the specified number of additional items. Useful before adding many items to avoid multiple backing array resizes. -
hashCode
public int hashCode() -
equals
-
toString
-
iterator
-
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 theObjectIntMap.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 theObjectIntMap.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 theObjectIntMap.Entries
constructor for nested or multithreaded iteration.
-