Module type CCMap.S
include Stdlib.Map.S
val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val update : key -> ('a option -> 'a option) -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val merge : (key -> 'a option -> 'b option -> 'c option) -> 'a t -> 'b t -> 'c t
val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val min_binding : 'a t -> key * 'a
val min_binding_opt : 'a t -> (key * 'a) option
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val find_opt : key -> 'a t -> 'a option
val find_first : (key -> bool) -> 'a t -> key * 'a
val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option
val find_last : (key -> bool) -> 'a t -> key * 'a
val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t
val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val get_or : key -> 'a t -> default:'a -> 'a
get_or k m ~default
returns the value associated tok
if present, and returnsdefault
otherwise (ifk
doesn't belong inm
).- since
- 0.16
val update : key -> ('a option -> 'a option) -> 'a t -> 'a t
update k f m
callsf (Some v)
iffind k m = v
, otherwise it callsf None
. In any case, if the result isNone
k
is removed fromm
, and if the result isSome v'
thenadd k v' m
is returned.
val min_binding_opt : 'a t -> (key * 'a) option
Safe version of
min_binding
.- since
- 1.5
val max_binding_opt : 'a t -> (key * 'a) option
Safe version of
max_binding
.- since
- 1.5
val find_first : (key -> bool) -> 'a t -> key * 'a
Find smallest binding satisfying the monotonic predicate. See
Map
.S.find_first.- since
- 1.5
val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option
Safe version of
find_first
.- since
- 1.5
val merge_safe : f:(key -> [ `Left of 'a | `Right of 'b | `Both of 'a * 'b ] -> 'c option) -> 'a t -> 'b t -> 'c t
merge_safe ~f a b
merges the mapsa
andb
together.- since
- 0.17
val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
Union of both maps, using the function to combine bindings that belong to both inputs.
- since
- 1.4