A hash-table based implementation of Map.
The insertion order of keys is remembered, and keys are iterated in the order they were inserted into the map. Values are iterated in their corresponding key's order. Changing a key's value, when the key is already in the map, does not change the iteration order, but removing the key and adding it again will make it be last in the iteration order.
The keys of a LinkedHashMap must have consistent Object.operator==
and Object.hashCode implementations. This means that the == operator
must define a stable equivalence relation on the keys (reflexive,
symmetric, transitive, and consistent over time), and that hashCode
must be the same for objects that are considered equal by ==.
The map allows null as a key.
- Implements
-
- HashMap<K,V>
Properties
- isEmpty → bool
-
read-only, inherited
Returns true if there is no key-value pair in the map.
- isNotEmpty → bool
-
read-only, inherited
Returns true if there is at least one key-value pair in the map.
- keys → Iterable<K>
-
read-only, inherited
The keys of
this.… - length → int
-
read-only, inherited
The number of key-value pairs in the map.
- values → Iterable<V>
-
read-only, inherited
The values of
this.…
Constructors
- LinkedHashMap({bool equals(K key1, K key2), int hashCode(K key), bool isValidKey(potentialKey)})
- LinkedHashMap.from(Map other)
-
Creates a LinkedHashMap that contains all key value pairs of
other. - LinkedHashMap.fromIterable(Iterable iterable, {K key(element), V value(element)})
-
Creates a LinkedHashMap where the keys and values are computed from the
iterable.… - LinkedHashMap.fromIterables(Iterable<K> keys, Iterable<V> values)
-
Creates a LinkedHashMap associating the given
keystovalues.… - LinkedHashMap.identity()
-
Creates an insertion-ordered identity-based map.…
Operators
-
operator [](
Object key) → V -
inherited
Returns the value for the given
keyor null ifkeyis not in the map.… -
operator []=(
K key, V value) → void -
inherited
Associates the
keywith the givenvalue.…
Methods
-
addAll(
Map<K,V> other) → void -
inherited
Adds all key-value pairs of
otherto this map.… -
clear(
) → void -
inherited
Removes all pairs from the map.…
-
containsKey(
Object key) → bool -
inherited
Returns true if this map contains the given
key.… -
containsValue(
Object value) → bool -
inherited
Returns true if this map contains the given
value.… -
forEach(
void f(K key, V value)) → void -
inherited
Applies
fto each key-value pair of the map.… -
putIfAbsent(
K key, V ifAbsent()) → V -
inherited
Look up the value of
key, or add a new value if it isn't there.… -
remove(
Object key) → V -
inherited
Removes
keyand its associated value, if present, from the map.…