DeepMap<K, V> extension
Extends Map in order to add recursion.
- on
-
- Map<
K, V>
- Map<
Methods
-
deepCopy(
) → Map - https://stackoverflow.com/questions/64594543/how-to-deep-copy-nested-list-in-dart
-
deepDifferenceByKey(
Map toCompare) → Map -
Returns new instance of Map
containing values, which key differs in
toCompare. Does not work with nested List and Set yet. -
deepDifferenceByValue(
Map toCompare) → Map -
Returns new instance of Map
containing values, which differs in
toCompare. Does not work with nested List and Set yet. -
deepIntersectionByKey(
Map toCompare) → Map - Returns new instance of Map containing all values, which key exists in both maps. Does not work with nested List and Set yet.
-
deepIntersectionByValue(
Map toCompare) → Map - Returns new instance of Map containing all values existing in both maps. Does not work with nested List and Set yet.
-
deepMerge(
Map toMerge) → Map -
Merges current Map with
toMergeby key. -
deepReverse(
) → Map< K, V> - Returns new instance of recursively reversed Map. It reverses nested List, Set or Map (primitive collections), nested primitive collections inside nested primitive collections and so on.
-
deepSearchByKey(
bool predicate(Object? key)) → Map - Returns new instance of recursively filtered (by key) Map. Does not work with keys as List and Set yet.
-
deepSearchByValue<
E> (bool predicate(E value)) → Map - Returns new instance of recursively filtered (by value) Map.
-
deepSortByKey(
) → Map< K, V> - Returns new instance of Map, which is recursively sorted by keys. It sorts by keys even Map nested as a value, nested Map inside nested Map and so on.
-
deepSortByValue(
) → Map< K, V> - Returns new instance of Map, which is recursively sorted by values. It sorts by values nested List, Set or Map (primitive collections), nested primitive collections inside nested primitive collections and so on.