Stdlib.Data.Map

Contents

Description

Definitions

type Binding Key ValueSource #

Constructors

| mkBinding@{ key : Key; value : Value; }

key {Key Value} (binding : Binding Key Value) : KeySource #

value {Key Value} (binding : Binding Key Value) : ValueSource #

toPair {Key Value} (binding : Binding Key Value) : Pair Key ValueSource #

instance bindingKeyOrdering {Key Value} {{Ord Key}} : Ord (Binding Key Value)Source #

type Map Key ValueSource #

Constructors

| mkMap (AVLTree (Binding Key Value))

empty {Key Value} : Map Key ValueSource #

insertWith {Key Value} {{Ord Key}} (fun : Value -> Value -> Value) (key : Key) (value : Value) (map : Map Key Value) : Map Key ValueSource #

insert {Key Value : Type} {{Ord Key}} (key : Key) (elem : Value) (map : Map Key Value) : Map Key ValueSource #

𝒪(log 𝓃). Inserts a new `key` and `value` into `map`. If `key` is already present in `map`, the associated value is replaced with the supplied `value`.

lookup {Key Value} {{Ord Key}} (key : Key) (map : Map Key Value) : Maybe ValueSource #

𝒪(log 𝓃). Queries whether a given `key` is in `map`.

isMember {Key Value} {{Ord Key}} (key : Key) (map : Map Key Value) : BoolSource #

𝒪(log 𝓃). Queries whether a given `key` is in `map`.

fromListWithKey {Key Value} {{Ord Key}} (fun : Key -> Value -> Value -> Value) (list : List (Pair Key Value)) : Map Key ValueSource #

fromListWith {Key Value} {{Ord Key}} (fun : Value -> Value -> Value) (list : List (Pair Key Value)) : Map Key ValueSource #

fromList {Key Value} {{Ord Key}} (list : List (Pair Key Value)) : Map Key ValueSource #

toList {Key Value} (map : Map Key Value) : List (Pair Key Value)Source #

fromSetWithFun {Key Value} {{Ord Key}} (fun : Key -> Value) (set : Set Key) : Map Key ValueSource #

fromSet {Key Value} {{Ord Key}} (set : Set (Pair Key Value)) : Map Key ValueSource #

toSet {Key Value} {{Ord Key}} {{Ord Value}} (map : Map Key Value) : Set (Pair Key Value)Source #

isEmpty {Key Value} (map : Map Key Value) : BoolSource #

𝒪(1). Checks if a Map is empty.

size {Key Value} (map : Map Key Value) : NatSource #

𝒪(𝓃). Returns the number of elements of a Map.

delete {Key Value} {{Ord Key}} (key : Key) (map : Map Key Value) : Map Key ValueSource #

𝒪(log 𝓃). Removes `key` assignment from `map`.

keys {Key Value} (map : Map Key Value) : List KeySource #

values {Key Value} (map : Map Key Value) : List ValueSource #

keySet {Key Value} {{Ord Key}} (map : Map Key Value) : Set KeySource #

valueSet {Key Value} {{Ord Value}} (map : Map Key Value) : Set ValueSource #

mapValuesWithKey {Key Value1 Value2} (fun : Key -> Value1 -> Value2) (map : Map Key Value1) : Map Key Value2Source #

mapValues {Key Value1 Value2} (fun : Value1 -> Value2) (map : Map Key Value1) : Map Key Value2Source #

singleton {Key Value} {{Ord Key}} (key : Key) (value : Value) : Map Key ValueSource #

foldr {Key Value Acc} (fun : Key -> Value -> Acc -> Acc) (acc : Acc) (map : Map Key Value) : AccSource #

foldl {Key Value Acc} (fun : Acc -> Key -> Value -> Acc) (acc : Acc) (map : Map Key Value) : AccSource #

intersection {Key Value} {{Ord Key}} (map1 map2 : Map Key Value) : Map Key ValueSource #

𝒪(n log n). Intersection of two maps. Returns data in the first map for the keys existing in both maps.

difference {Key Value} {{Ord Key}} (map1 map2 : Map Key Value) : Map Key ValueSource #

𝒪(n log n). Return elements of `map1` with keys not existing in `map2`.

unionLeft {Key Value} {{Ord Key}} (map1 map2 : Map Key Value) : Map Key ValueSource #

𝒪(n log n). Returns a Map containing the elements that are in `map1` or `map2`. This is a left-biased union of `map1` and `map2` which prefers `map1` when duplicate keys are encountered.

union {Key Value} {{Ord Key}} (map1 map2 : Map Key Value) : Map Key ValueSource #

𝒪(n log n). Returns a Map containing the elements that are in `map1` or `map2`.

unions {Key Value Container} {{Ord Key}} {{Foldable Container (Map Key Value)}} (maps : Container) : Map Key ValueSource #

disjointUnion {Key Value} {{Ord Key}} (map1 map2 : Map Key Value) : Result Key (Map Key Value)Source #

O(n log n). If `map1` and `map2` are disjoint (have no common keys), then returns `ok map` where `map` is the union of `map1` and `map2`. If `map1` and `map2` are not disjoint, then returns `error k` where `k` is a common key.

all {Key Value} (predicate : Key -> Value -> Bool) (map : Map Key Value) : BoolSource #

𝒪(𝓃). Returns true if all key-value pairs in `map` satisfy `predicate`.

any {Key Value} (predicate : Key -> Value -> Bool) (map : Map Key Value) : BoolSource #

𝒪(𝓃). Returns true if some key-value pair in `map` satisfies `predicate`.

filter {Key Value} {{Ord Key}} (predicate : Key -> Value -> Bool) (map : Map Key Value) : Map Key ValueSource #

𝒪(n log n). Returns a Map containing all key-value pairs of `map` that satisfy `predicate`.

partition {Key Value} {{Ord Key}} (predicate : Key -> Value -> Bool) (map : Map Key Value) : Pair (Map Key Value) (Map Key Value)Source #

instance functorMapI {Key} : Functor (Map Key)Source #

instance foldableMapI {Key Value} : Foldable (Map Key Value) (Pair Key Value)Source #

instance eqMapI {A B} {{Eq A}} {{Eq B}} : Eq (Map A B)Source #

instance ordMapI {A B} {{Ord A}} {{Ord B}} : Ord (Map A B)Source #