Idris2Doc : Data.SortedMap

Data.SortedMap

SortedMap : Type -> Type -> Type
Totality: total
Constructors:
Empty : Ordk => SortedMapkv
M : {auto o : Ordk} -> (n : Nat) -> Treenkvo -> SortedMapkv
delete : k -> SortedMapkv -> SortedMapkv
empty : Ordk => SortedMapkv
fromList : Ordk => List (k, v) -> SortedMapkv
insert : k -> v -> SortedMapkv -> SortedMapkv
insertFrom : Foldablef => f (k, v) -> SortedMapkv -> SortedMapkv
keys : SortedMapkv -> Listk
Gets the keys of the map.
lookup : k -> SortedMapkv -> Maybev
merge : Semigroupv => SortedMapkv -> SortedMapkv -> SortedMapkv
Merge two maps using the Semigroup (and by extension, Monoid) operation.
Uses mergeWith internally, so the ordering of the left map is kept.
mergeLeft : SortedMapkv -> SortedMapkv -> SortedMapkv
Left-biased merge, also keeps the ordering specified by the left map.
mergeWith : (v -> v -> v) -> SortedMapkv -> SortedMapkv -> SortedMapkv
Merge two maps. When encountering duplicate keys, using a function to combine the values.
Uses the ordering of the first map given.
singleton : Ordk => k -> v -> SortedMapkv
toList : SortedMapkv -> List (k, v)
values : SortedMapkv -> Listv
Gets the values of the map. Could contain duplicates.