Base class for implementing a Map.
This class has a basic implementation of all but five of the members of
Map.
A basic Map
class can be implemented by extending this class and
implementing keys
, operator[]
, operator[]=
, remove
and clear
.
The remaining operations are implemented in terms of these five.
The keys
iterable should have efficient length
and contains
operations, and it should catch concurrent modifications of the keys
while iterating.
A more efficient implementation is usually possible by overriding some of the other members as well.
- Mixes-in
- MapMixin<K,V>
- Implemented by
Properties
Constructors
- MapBase()
-
const
Operators
-
operator [](
Object key) → V -
inheritedReturns the value for the given
key
or null ifkey
is not in the map. -
operator []=(
K key, V value) → dynamic -
inheritedAssociates the
key
with the givenvalue
.
Methods
-
addAll(
Map<K,V> other) → void -
inheritedAdds all key-value pairs of
other
to this map. -
clear(
) → void -
inheritedRemoves all pairs from the map.
-
containsKey(
Object key) → bool -
inheritedReturns true if this map contains the given
key
. -
containsValue(
V value) → bool -
inheritedReturns true if this map contains the given
value
. -
forEach(
void action(K key, V value)) → void -
inheritedApplies
f
to each key-value pair of the map. -
putIfAbsent(
K key, V ifAbsent()) → V -
inheritedLook up the value of
key
, or add a new value if it isn't there. -
remove(
Object key) → V -
inheritedRemoves
key
and its associated value, if present, from the map. -
toString(
) → String -
inheritedReturns a string representation of this object.