Map<K, V> Interface
A Map is an associative container, mapping a key to a value. Null values are supported.
Default class
Subinterfaces
Implemented by
ImmutableMap<K, V>, SplayTreeMap<K, V>
Constructors
Code new Map() #
Creates a map with the default implementation.
Map();
Code new Map.from(Map other) #
Creates a Map that contains all key value pairs of other.
Map.from(Map<K, V> other);
Methods
Code operator [](key) #
Returns the value for the given key or null if key is not in the map. Because null values are supported, one should either use containsKey to distinguish between an absent key and a null value, or use the putIfAbsent method.
V operator [](K key);
Code void operator []=(key, value) #
Associates the key with the given value.
void operator []=(K key, V value);
Code bool containsKey(key) #
Returns whether this map contains the given key.
bool containsKey(K key);
Code bool containsValue(value) #
Returns whether this map contains the given value.
bool containsValue(V value);
Code void forEach(void f(key, value)) #
Applies f to each {key, value} pair of the map.
void forEach(void f(K key, V value));
Code Collection getKeys() #
Returns a collection containing all the keys in the map.
Collection<K> getKeys();
Code Collection getValues() #
Returns a collection containing all the values in the map.
Collection<V> getValues();
Code putIfAbsent(key, ifAbsent()) #
If key is not associated to a value, calls ifAbsent and updates the map by mapping key to the value returned by ifAbsent. Returns the value in the map.
V putIfAbsent(K key, V ifAbsent());
Code remove(key) #
Removes the association for the given key. Returns the value for key in the map or null if key is not in the map. Note that values can be null and a returned null value does not always imply that the key is absent.
V remove(K key);