Package org.codehaus.groovy.util
Class ListHashMap<K,V>
java.lang.Object
org.codehaus.groovy.util.ListHashMap<K,V>
- All Implemented Interfaces:
Map<K,V>
Represents a
Map that is optimized for a small number of entries. For
a number of entries up to listSize the entries are stored in arrays.
After listSize entries are exceeded storage switches internally to a
Map and converts back to being array based when its size is less than
or equal to listSize.
Null keys or values are not supported.
This class is not thread-safe!
-
Nested Class Summary
-
Constructor Summary
ConstructorsConstructorDescriptionCreates a map that keeps up to three entries in array-backed storage.ListHashMap(int listSize) Creates a map that keeps up tolistSizeentries in array-backed storage. -
Method Summary
Modifier and TypeMethodDescriptionvoidclear()booleancontainsKey(Object key) booleancontainsValue(Object value) entrySet()booleanisEmpty()keySet()voidintsize()values()Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitMethods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, equals, forEach, getOrDefault, hashCode, merge, putIfAbsent, remove, replace, replace, replaceAll
-
Constructor Details
-
ListHashMap
public ListHashMap()Creates a map that keeps up to three entries in array-backed storage. -
ListHashMap
public ListHashMap(int listSize) Creates a map that keeps up tolistSizeentries in array-backed storage.- Parameters:
listSize- the number of entries to keep in arrays before promoting to a backing map
-
-
Method Details
-
clear
public void clear() -
containsKey
- Specified by:
containsKeyin interfaceMap<K,V>
-
containsValue
- Specified by:
containsValuein interfaceMap<K,V>
-
entrySet
-
get
-
isEmpty
public boolean isEmpty() -
keySet
-
put
-
putAll
-
remove
-
size
public int size() -
values
-