Idris2Doc : Data.SortedMap

Data.SortedMap

recordSortedMap : Type -> Type -> Type
Totality: total
Constructor: 
M : SortedDMapk (constv) -> SortedMapkv

Projection: 
.unM : SortedMapkv -> SortedDMapk (constv)
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.

leftMost : SortedMapkeyval -> Maybe (key, val)
  Returns the leftmost (least) key and value

lookup : k -> SortedMapkv -> Maybev
lookupBetween : key -> SortedMapkeyval -> (Maybe (key, val), Maybe (key, val))
  looks up a key in map, returning the left and right closest values, so that
k1 <= k < k2. If at the end of the beginning and/or end of the sorted map, returns
nothing appropriately

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.

rightMost : SortedMapkeyval -> Maybe (key, val)
  Returns the rightmost (greatest) key and value

singleton : Ordk => k -> v -> SortedMapkv
toList : SortedMapkv -> List (k, v)
values : SortedMapkv -> Listv
  Gets the values of the map. Could contain duplicates.