Class HashMap<K,V>
java.lang.Object
com.github.andrewoma.dexx.collection.internal.base.AbstractTraversable<Pair<K,V>>
com.github.andrewoma.dexx.collection.internal.base.AbstractIterable<Pair<K,V>>
com.github.andrewoma.dexx.collection.internal.base.AbstractMap<K,V>
com.github.andrewoma.dexx.collection.HashMap<K,V>
- All Implemented Interfaces:
Iterable<Pair<K,
,V>> Map<K,
,V> Traversable<Pair<K,
,V>> Iterable<Pair<K,
V>>
HashMap
is an implementation of Map
based on a hash trie.
The underlying implementation is a port of Scala's HashMap which is an implementation of a hash array mapped trie.
-
Nested Class Summary
Nested Classes -
Field Summary
FieldsModifier and TypeFieldDescriptionprivate final CompactHashMap
<K, Pair<K, V>> private static final HashMap
private static final KeyFunction
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionboolean
containsKey
(K key) Returns true if this map contains the specified key.static <K,
V> @NotNull HashMap <K, V> empty()
static <K,
V> @NotNull BuilderFactory <Pair<K, V>, HashMap<K, V>> factory()
<U> void
All collection methods can be built upon thisforEach
definition.Returns the value associated with the key ornull
if the no value exists with the key specified.iterator()
private KeyFunction
<K, Pair<K, V>> Returns a map with the value specified associated to the key specified.Returns a map with the value associated with the key removed if it exists.int
size()
Returns the size of the collection.Methods inherited from class com.github.andrewoma.dexx.collection.internal.base.AbstractMap
asMap, equals, hashCode, keys, values
Methods inherited from class com.github.andrewoma.dexx.collection.internal.base.AbstractTraversable
isEmpty, makeString, makeString, to, toArray, toArray, toIndexedList, toSet, toSortedSet, toString
Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
Methods inherited from interface java.lang.Iterable
forEach, spliterator
Methods inherited from interface com.github.andrewoma.dexx.collection.Traversable
isEmpty, makeString, makeString, to, toArray, toArray, toIndexedList, toSet, toSortedSet
-
Field Details
-
EMPTY
-
keyFunction
-
compactHashMap
-
-
Constructor Details
-
HashMap
public HashMap() -
HashMap
-
-
Method Details
-
empty
-
factory
-
keyFunction
-
containsKey
Description copied from interface:Map
Returns true if this map contains the specified key. -
put
Description copied from interface:Map
Returns a map with the value specified associated to the key specified.If value already exists for the key, it will be replaced.
-
get
Description copied from interface:Map
Returns the value associated with the key ornull
if the no value exists with the key specified. -
remove
Description copied from interface:Map
Returns a map with the value associated with the key removed if it exists. -
size
public int size()Description copied from interface:Traversable
Returns the size of the collection.Warning: infinite collections are possible, as are collections that require traversal to calculate the size.
- Specified by:
size
in interfaceTraversable<K>
- Overrides:
size
in classAbstractTraversable<Pair<K,
V>>
-
forEach
Description copied from interface:Traversable
All collection methods can be built upon thisforEach
definition.- Specified by:
forEach
in interfaceTraversable<K>
- Overrides:
forEach
in classAbstractIterable<Pair<K,
V>>
-
iterator
-