Package arc.struct
Class ObjectMap<K,V>
java.lang.Object
arc.struct.ObjectMap<K,V>
- All Implemented Interfaces:
Iterable<ObjectMap.Entry<K,
V>>
- Direct Known Subclasses:
OrderedMap
,StringMap
An unordered map. This implementation is a cuckoo hash map using 3 hashes, random walking, and a small stash for problematic
keys. Null keys are not allowed. 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.
Iteration can be very slow for a map with a large capacity.
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.
Iteration can be very slow for a map with a large capacity.
clear(int)
and shrink(int)
can be used to reduce
the capacity. OrderedMap
provides much faster iteration.-
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.ObjectMap
(int initialCapacity) Creates a new map with a load factor of 0.8.ObjectMap
(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()
Clears the map, leaving the backing arrays at the current capacity.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
(Object value, boolean identity) Returns true if the specified value is in the map.copy()
void
Iterates through key/value pairs.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
Returns the key for the specified value, or null if it is not in the map.Returns the value for the specified key, or null if the key is not in the map.Tries to get the value.Returns the value for the specified key, or the default value if the key is not in the map.Get, with a nullable key.getThrow
(K key, Prov<? extends RuntimeException> error) int
hashCode()
boolean
isEmpty()
Returns true if the map is empty.iterator()
keys()
Returns an iterator for the keys in the map.Put all the keys of this other map into this map, and return this map for chaining.static <K,
V> ObjectMap<K, V> Returns the old value associated with the specified key, or null.void
void
Returns the value associated with the key, or null.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
-
ObjectMap
public ObjectMap()Creates a new map with an initial capacity of 51 and a load factor of 0.8. -
ObjectMap
public ObjectMap(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.
-
ObjectMap
public ObjectMap(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.
-
ObjectMap
Creates a new map identical to the specified map.
-
-
Method Details
-
of
-
each
Iterates through key/value pairs. -
copy
-
put
Returns the old value associated with the specified key, or null. -
putAll
-
putAll
-
merge
Put all the keys of this other map into this map, and return this map for chaining. -
getThrow
-
get
Tries to get the value. If it does not exist, it creates a new instance using the supplier and places it, returning the value. -
getNull
Get, with a nullable key. -
get
Returns the value for the specified key, or null if the key is not in the map. -
get
Returns the value for the specified key, or the default value if the key is not in the map. -
remove
Returns the value associated with the key, or null. -
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. The reduction is done by allocating new arrays, though for large arrays this can be faster than clearing the existing array. -
clear
public void clear()Clears the map, leaving the backing arrays at the current capacity. When the capacity is high and the population is low, iteration can be unnecessarily slow.clear(int)
can be used to reduce the capacity. -
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, usesequals(Object)
.
-
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.- Parameters:
identity
- If true, uses == to compare the specified value with values in the map. If false, usesequals(Object)
.
-
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
-
toString
-
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 theObjectMap.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 theObjectMap.Values
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 theObjectMap.Keys
constructor for nested or multithreaded iteration.
-