Results for “Std.MultiMap.MultiMap”
30 matching declarations
Use module:Std.List, kind:fn, or is:exact. Put a Pudu type after ::.
- Std.MultiMap.MultiMap
A map holding several values under one key.
- Std.MultiMap.add
&Std.MultiMap.MultiMap[K, V] -> K -> V -> Std.MultiMap.MultiMap[K, V]The map with a value added under a key, after any already there.
- Std.MultiMap.addAll
&Std.MultiMap.MultiMap[K, V] -> K -> &Array[V] -> Std.MultiMap.MultiMap[K, V]The map with several values added under a key, in the order given.
- Std.MultiMap.all
&Std.MultiMap.MultiMap[K, V] -> fn(K, V) -> Bool -> BoolWhether every value satisfies the predicate. True for an empty map.
- Std.MultiMap.any
&Std.MultiMap.MultiMap[K, V] -> fn(K, V) -> Bool -> BoolWhether any value satisfies the predicate. False for an empty map.
- Std.MultiMap.contains
&Std.MultiMap.MultiMap[K, V] -> K -> V -> BoolWhether a key has this particular value.
- Std.MultiMap.containsKey
&Std.MultiMap.MultiMap[K, V] -> K -> BoolWhether a key has any value.
- Std.MultiMap.count
&Std.MultiMap.MultiMap[K, V] -> K -> IntHow many values a key has.
- Std.MultiMap.empty
Std.MultiMap.MultiMap[K, V]A map with no entries.
- Std.MultiMap.filterKeys
&Std.MultiMap.MultiMap[K, V] -> fn(K) -> Bool -> Std.MultiMap.MultiMap[K, V]Only the keys the predicate accepts.
- Std.MultiMap.filterValues
&Std.MultiMap.MultiMap[K, V] -> fn(V) -> Bool -> Std.MultiMap.MultiMap[K, V]Only the values the predicate accepts, dropping keys left with none.
- Std.MultiMap.fold
&Std.MultiMap.MultiMap[K, V] -> fn(A, K, Array[V]) -> A -> A -> AEvery key and all its values combined into one value, in key order.
- Std.MultiMap.fromPairs
&Array[(K, V)] -> Std.MultiMap.MultiMap[K, V]A map built from pairs, collecting values under their shared keys.
- Std.MultiMap.get
&Std.MultiMap.MultiMap[K, V] -> K -> Array[V]Every value under a key, in the order they were added, or an empty array.
- Std.MultiMap.groupBy
&Array[T] -> fn(T) -> K -> Std.MultiMap.MultiMap[K, T]Items collected under the key each one produces.
- Std.MultiMap.groups
&Std.MultiMap.MultiMap[K, V] -> Array[(K, Array[V])]Every key paired with all of its values, in key order.
- Std.MultiMap.inverted
&Std.MultiMap.MultiMap[K, V] -> Std.MultiMap.MultiMap[V, K]The map with its keys and values exchanged.
- Std.MultiMap.isEmpty
&Std.MultiMap.MultiMap[K, V] -> BoolWhether the map holds nothing.
- Std.MultiMap.keys
&Std.MultiMap.MultiMap[K, V] -> Array[K]Every key that has values, in order.
- Std.MultiMap.mapValues
&Std.MultiMap.MultiMap[K, A] -> fn(A) -> B -> Std.MultiMap.MultiMap[K, B]Every value transformed, keeping its key and position.
- Std.MultiMap.merge
&Std.MultiMap.MultiMap[K, V] -> &Std.MultiMap.MultiMap[K, V] -> Std.MultiMap.MultiMap[K, V]Two maps combined, with the second map's values added after the first's.
- Std.MultiMap.pairs
&Std.MultiMap.MultiMap[K, V] -> Array[(K, V)]Every key paired with each of its values, in key order.
- Std.MultiMap.remove
&Std.MultiMap.MultiMap[K, V] -> K -> V -> Std.MultiMap.MultiMap[K, V]The map with one occurrence of a value removed from a key.
- Std.MultiMap.removeAll
&Std.MultiMap.MultiMap[K, V] -> K -> V -> Std.MultiMap.MultiMap[K, V]The map with every occurrence of a value removed from a key.
- Std.MultiMap.removeKey
&Std.MultiMap.MultiMap[K, V] -> K -> Std.MultiMap.MultiMap[K, V]The map with a key and all its values removed.
- Std.MultiMap.setAll
&Std.MultiMap.MultiMap[K, V] -> K -> &Array[V] -> Std.MultiMap.MultiMap[K, V]The map with a key's values replaced entirely.
- Std.MultiMap.size
&Std.MultiMap.MultiMap[K, V] -> IntHow many keys have values.
- Std.MultiMap.toMap
&Std.MultiMap.MultiMap[K, V] -> Map[K, Array[V]]The map as an ordinary map from key to its values.
- Std.MultiMap.total
&Std.MultiMap.MultiMap[K, V] -> IntHow many values the map holds across every key.
- Std.MultiMap.values
&Std.MultiMap.MultiMap[K, V] -> Array[V]Every value under every key, in key order.
