LinkedLruHashMap<K, V> class

A linked hash-table based implementation of LruMap.

Implemented types

Constructors

LinkedLruHashMap({int maximumSize })
Create a new LinkedLruHashMap with a maximumSize.
factory

Properties

entries → Iterable<MapEntry<K, V>>
The map entries of this.
read-only, override
isEmpty → bool
Returns true if there is no key/value pair in the map.
read-only, override
isNotEmpty → bool
Returns true if there is at least one key/value pair in the map.
read-only, override
keys → Iterable<K>
The keys of this - in order of MRU to LRU. [...]
read-only, override
length → int
The number of key/value pairs in the map.
read-only, override
maximumSize ↔ int
Maximum size of the Map. If length exceeds this value at any time, n entries accessed the earliest are removed, where n is length - maximumSize.
read / write, override
values → Iterable<V>
The values of this - in order of MRU to LRU. [...]
read-only, override
hashCode → int
The hash code for this object. [...]
read-only, inherited
runtimeType → Type
A representation of the runtime type of the object.
read-only, inherited

Methods

addAll(Map<K, V> other) → void
Adds all key-value pairs of other to this map. [...]
override
addEntries(Iterable<MapEntry<K, V>> entries) → void
Adds all key/value pairs of newEntries to this map. [...]
override
cast<K2, V2>() → LinkedLruHashMap<K2, V2>
Provides a view of this map as having RK keys and RV instances, if necessary. [...]
override
clear() → void
Removes all pairs from the map. [...]
override
containsKey(Object key) → bool
Returns true if this map contains the given key. [...]
override
containsValue(Object value) → bool
Returns true if this map contains the given value. [...]
override
forEach(void action(K key, V value)) → void
Applies action to each key-value pair of the map in order of MRU to LRU. [...]
override
map<K2, V2>(Object transform(K key, V value)) → Map<K2, V2>
Returns a new map where all entries of this map are transformed by the given f function.
override
putIfAbsent(K key, V ifAbsent()) → V
Look up the value associated with key, or add a new value if it isn't there. The pair is promoted to the MRU position. [...]
override
remove(Object key) → V
Removes key and its associated value, if present, from the map. [...]
override
removeWhere(bool test(K key, V value)) → void
Removes all entries of this map that satisfy the given predicate.
override
retype<K2, V2>() → LinkedLruHashMap<K2, V2>
toString() → String
Returns a string representation of this object.
override
update(K key, V update(V value), { V ifAbsent() }) → V
Updates the value for the provided key. [...]
override
updateAll(V update(K key, V value)) → void
Updates all values. [...]
override
noSuchMethod(Invocation invocation) → dynamic
Invoked when a non-existent method or property is accessed. [...]
inherited

Operators

operator [](Object key) → V
Get the value for a key in the Map. The key will be promoted to the 'Most Recently Used' position. [...]
override
operator []=(K key, V value) → void
If key already exists, promotes it to the MRU position & assigns value. [...]
override
operator ==(dynamic other) → bool
The equality operator. [...]
inherited