sig
module type S =
sig
type key
type +!'a t
val empty : 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key -> 'a -> 'a t -> 'a t
val update_stdlib : key -> ('a option -> 'a option) -> 'a t -> 'a t
val update : key -> key -> 'a -> 'a t -> 'a t
val find : key -> 'a t -> 'a
val find_opt : key -> 'a t -> 'a option
val find_default : 'a -> key -> 'a t -> 'a
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 remove : key -> 'a t -> 'a t
val remove_exn : key -> 'a t -> 'a t
val modify : key -> ('a -> 'a) -> 'a t -> 'a t
val modify_def : 'a -> key -> ('a -> 'a) -> 'a t -> 'a t
val modify_opt : key -> ('a option -> 'a option) -> 'a t -> 'a t
val extract : key -> 'a t -> 'a * 'a t
val pop : 'a t -> (key * 'a) * 'a t
val mem : key -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val filterv : ('a -> bool) -> 'a t -> 'a t
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : 'a t -> key BatEnum.t
val values : 'a t -> 'a BatEnum.t
val min_binding : 'a t -> key * 'a
val min_binding_opt : 'a t -> (key * 'a) option
val pop_min_binding : 'a t -> (key * 'a) * 'a t
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val pop_max_binding : 'a t -> (key * 'a) * 'a t
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
val any : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val singleton : key -> 'a -> 'a t
val bindings : 'a t -> (key * 'a) list
val enum : 'a t -> (key * 'a) BatEnum.t
val backwards : 'a t -> (key * 'a) BatEnum.t
val of_enum : (key * 'a) BatEnum.t -> 'a t
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
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 to_seq : 'a t -> (key * 'a) BatSeq.t
val to_rev_seq : 'a t -> (key * 'a) BatSeq.t
val to_seq_from : key -> 'a t -> (key * 'a) BatSeq.t
val add_seq : (key * 'a) BatSeq.t -> 'a t -> 'a t
val of_seq : (key * 'a) BatSeq.t -> 'a t
val print :
?first:string ->
?last:string ->
?sep:string ->
?kvsep:string ->
('a BatInnerIO.output -> key -> unit) ->
('a BatInnerIO.output -> 'c -> unit) ->
'a BatInnerIO.output -> 'c t -> unit
module Exceptionless :
sig
val find : key -> 'a t -> 'a option
val choose : 'a t -> (key * 'a) option
val any : 'a t -> (key * 'a) option
end
module Infix :
sig
val ( --> ) : 'a t -> key -> 'a
val ( <-- ) : 'a t -> key * 'a -> 'a t
end
module Labels :
sig
val add : key:key -> data:'a -> 'a t -> 'a t
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val map : f:('a -> 'b) -> 'a t -> 'b t
val mapi : f:(key:key -> data:'a -> 'b) -> 'a t -> 'b t
val filterv : f:('a -> bool) -> 'a t -> 'a t
val filter : f:(key -> 'a -> bool) -> 'a t -> 'a t
val fold :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val compare : cmp:('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : cmp:('a -> 'a -> bool) -> 'a t -> 'a t -> bool
end
end
module Make :
functor (Ord : BatInterfaces.OrderedType) ->
sig
type key = Ord.t
type +!'a t
val empty : 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key -> 'a -> 'a t -> 'a t
val update_stdlib : key -> ('a option -> 'a option) -> 'a t -> 'a t
val update : key -> key -> 'a -> 'a t -> 'a t
val find : key -> 'a t -> 'a
val find_opt : key -> 'a t -> 'a option
val find_default : 'a -> key -> 'a t -> 'a
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 remove : key -> 'a t -> 'a t
val remove_exn : key -> 'a t -> 'a t
val modify : key -> ('a -> 'a) -> 'a t -> 'a t
val modify_def : 'a -> key -> ('a -> 'a) -> 'a t -> 'a t
val modify_opt : key -> ('a option -> 'a option) -> 'a t -> 'a t
val extract : key -> 'a t -> 'a * 'a t
val pop : 'a t -> (key * 'a) * 'a t
val mem : key -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val filterv : ('a -> bool) -> 'a t -> 'a t
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : 'a t -> key BatEnum.t
val values : 'a t -> 'a BatEnum.t
val min_binding : 'a t -> key * 'a
val min_binding_opt : 'a t -> (key * 'a) option
val pop_min_binding : 'a t -> (key * 'a) * 'a t
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val pop_max_binding : 'a t -> (key * 'a) * 'a t
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
val any : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val singleton : key -> 'a -> 'a t
val bindings : 'a t -> (key * 'a) list
val enum : 'a t -> (key * 'a) BatEnum.t
val backwards : 'a t -> (key * 'a) BatEnum.t
val of_enum : (key * 'a) BatEnum.t -> 'a t
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
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 to_seq : 'a t -> (key * 'a) BatSeq.t
val to_rev_seq : 'a t -> (key * 'a) BatSeq.t
val to_seq_from : key -> 'a t -> (key * 'a) BatSeq.t
val add_seq : (key * 'a) BatSeq.t -> 'a t -> 'a t
val of_seq : (key * 'a) BatSeq.t -> 'a t
val print :
?first:string ->
?last:string ->
?sep:string ->
?kvsep:string ->
('a BatInnerIO.output -> key -> unit) ->
('a BatInnerIO.output -> 'c -> unit) ->
'a BatInnerIO.output -> 'c t -> unit
module Exceptionless :
sig
val find : key -> 'a t -> 'a option
val choose : 'a t -> (key * 'a) option
val any : 'a t -> (key * 'a) option
end
module Infix :
sig
val ( --> ) : 'a t -> key -> 'a
val ( <-- ) : 'a t -> key * 'a -> 'a t
end
module Labels :
sig
val add : key:key -> data:'a -> 'a t -> 'a t
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val map : f:('a -> 'b) -> 'a t -> 'b t
val mapi : f:(key:key -> data:'a -> 'b) -> 'a t -> 'b t
val filterv : f:('a -> bool) -> 'a t -> 'a t
val filter : f:(key -> 'a -> bool) -> 'a t -> 'a t
val fold :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val compare : cmp:('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : cmp:('a -> 'a -> bool) -> 'a t -> 'a t -> bool
end
end
module Int :
sig
type key = int
type +!'a t
val empty : 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key -> 'a -> 'a t -> 'a t
val update_stdlib : key -> ('a option -> 'a option) -> 'a t -> 'a t
val update : key -> key -> 'a -> 'a t -> 'a t
val find : key -> 'a t -> 'a
val find_opt : key -> 'a t -> 'a option
val find_default : 'a -> key -> 'a t -> 'a
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 remove : key -> 'a t -> 'a t
val remove_exn : key -> 'a t -> 'a t
val modify : key -> ('a -> 'a) -> 'a t -> 'a t
val modify_def : 'a -> key -> ('a -> 'a) -> 'a t -> 'a t
val modify_opt : key -> ('a option -> 'a option) -> 'a t -> 'a t
val extract : key -> 'a t -> 'a * 'a t
val pop : 'a t -> (key * 'a) * 'a t
val mem : key -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val filterv : ('a -> bool) -> 'a t -> 'a t
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : 'a t -> key BatEnum.t
val values : 'a t -> 'a BatEnum.t
val min_binding : 'a t -> key * 'a
val min_binding_opt : 'a t -> (key * 'a) option
val pop_min_binding : 'a t -> (key * 'a) * 'a t
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val pop_max_binding : 'a t -> (key * 'a) * 'a t
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
val any : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val singleton : key -> 'a -> 'a t
val bindings : 'a t -> (key * 'a) list
val enum : 'a t -> (key * 'a) BatEnum.t
val backwards : 'a t -> (key * 'a) BatEnum.t
val of_enum : (key * 'a) BatEnum.t -> 'a t
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
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 to_seq : 'a t -> (key * 'a) BatSeq.t
val to_rev_seq : 'a t -> (key * 'a) BatSeq.t
val to_seq_from : key -> 'a t -> (key * 'a) BatSeq.t
val add_seq : (key * 'a) BatSeq.t -> 'a t -> 'a t
val of_seq : (key * 'a) BatSeq.t -> 'a t
val print :
?first:string ->
?last:string ->
?sep:string ->
?kvsep:string ->
('a BatInnerIO.output -> key -> unit) ->
('a BatInnerIO.output -> 'c -> unit) ->
'a BatInnerIO.output -> 'c t -> unit
module Exceptionless :
sig
val find : key -> 'a t -> 'a option
val choose : 'a t -> (key * 'a) option
val any : 'a t -> (key * 'a) option
end
module Infix :
sig
val ( --> ) : 'a t -> key -> 'a
val ( <-- ) : 'a t -> key * 'a -> 'a t
end
module Labels :
sig
val add : key:key -> data:'a -> 'a t -> 'a t
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val map : f:('a -> 'b) -> 'a t -> 'b t
val mapi : f:(key:key -> data:'a -> 'b) -> 'a t -> 'b t
val filterv : f:('a -> bool) -> 'a t -> 'a t
val filter : f:(key -> 'a -> bool) -> 'a t -> 'a t
val fold :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val compare : cmp:('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : cmp:('a -> 'a -> bool) -> 'a t -> 'a t -> bool
end
end
module Int32 :
sig
type key = int32
type +!'a t
val empty : 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key -> 'a -> 'a t -> 'a t
val update_stdlib : key -> ('a option -> 'a option) -> 'a t -> 'a t
val update : key -> key -> 'a -> 'a t -> 'a t
val find : key -> 'a t -> 'a
val find_opt : key -> 'a t -> 'a option
val find_default : 'a -> key -> 'a t -> 'a
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 remove : key -> 'a t -> 'a t
val remove_exn : key -> 'a t -> 'a t
val modify : key -> ('a -> 'a) -> 'a t -> 'a t
val modify_def : 'a -> key -> ('a -> 'a) -> 'a t -> 'a t
val modify_opt : key -> ('a option -> 'a option) -> 'a t -> 'a t
val extract : key -> 'a t -> 'a * 'a t
val pop : 'a t -> (key * 'a) * 'a t
val mem : key -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val filterv : ('a -> bool) -> 'a t -> 'a t
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : 'a t -> key BatEnum.t
val values : 'a t -> 'a BatEnum.t
val min_binding : 'a t -> key * 'a
val min_binding_opt : 'a t -> (key * 'a) option
val pop_min_binding : 'a t -> (key * 'a) * 'a t
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val pop_max_binding : 'a t -> (key * 'a) * 'a t
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
val any : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val singleton : key -> 'a -> 'a t
val bindings : 'a t -> (key * 'a) list
val enum : 'a t -> (key * 'a) BatEnum.t
val backwards : 'a t -> (key * 'a) BatEnum.t
val of_enum : (key * 'a) BatEnum.t -> 'a t
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
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 to_seq : 'a t -> (key * 'a) BatSeq.t
val to_rev_seq : 'a t -> (key * 'a) BatSeq.t
val to_seq_from : key -> 'a t -> (key * 'a) BatSeq.t
val add_seq : (key * 'a) BatSeq.t -> 'a t -> 'a t
val of_seq : (key * 'a) BatSeq.t -> 'a t
val print :
?first:string ->
?last:string ->
?sep:string ->
?kvsep:string ->
('a BatInnerIO.output -> key -> unit) ->
('a BatInnerIO.output -> 'c -> unit) ->
'a BatInnerIO.output -> 'c t -> unit
module Exceptionless :
sig
val find : key -> 'a t -> 'a option
val choose : 'a t -> (key * 'a) option
val any : 'a t -> (key * 'a) option
end
module Infix :
sig
val ( --> ) : 'a t -> key -> 'a
val ( <-- ) : 'a t -> key * 'a -> 'a t
end
module Labels :
sig
val add : key:key -> data:'a -> 'a t -> 'a t
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val map : f:('a -> 'b) -> 'a t -> 'b t
val mapi : f:(key:key -> data:'a -> 'b) -> 'a t -> 'b t
val filterv : f:('a -> bool) -> 'a t -> 'a t
val filter : f:(key -> 'a -> bool) -> 'a t -> 'a t
val fold :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val compare : cmp:('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : cmp:('a -> 'a -> bool) -> 'a t -> 'a t -> bool
end
end
module Int64 :
sig
type key = int64
type +!'a t
val empty : 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key -> 'a -> 'a t -> 'a t
val update_stdlib : key -> ('a option -> 'a option) -> 'a t -> 'a t
val update : key -> key -> 'a -> 'a t -> 'a t
val find : key -> 'a t -> 'a
val find_opt : key -> 'a t -> 'a option
val find_default : 'a -> key -> 'a t -> 'a
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 remove : key -> 'a t -> 'a t
val remove_exn : key -> 'a t -> 'a t
val modify : key -> ('a -> 'a) -> 'a t -> 'a t
val modify_def : 'a -> key -> ('a -> 'a) -> 'a t -> 'a t
val modify_opt : key -> ('a option -> 'a option) -> 'a t -> 'a t
val extract : key -> 'a t -> 'a * 'a t
val pop : 'a t -> (key * 'a) * 'a t
val mem : key -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val filterv : ('a -> bool) -> 'a t -> 'a t
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : 'a t -> key BatEnum.t
val values : 'a t -> 'a BatEnum.t
val min_binding : 'a t -> key * 'a
val min_binding_opt : 'a t -> (key * 'a) option
val pop_min_binding : 'a t -> (key * 'a) * 'a t
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val pop_max_binding : 'a t -> (key * 'a) * 'a t
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
val any : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val singleton : key -> 'a -> 'a t
val bindings : 'a t -> (key * 'a) list
val enum : 'a t -> (key * 'a) BatEnum.t
val backwards : 'a t -> (key * 'a) BatEnum.t
val of_enum : (key * 'a) BatEnum.t -> 'a t
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
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 to_seq : 'a t -> (key * 'a) BatSeq.t
val to_rev_seq : 'a t -> (key * 'a) BatSeq.t
val to_seq_from : key -> 'a t -> (key * 'a) BatSeq.t
val add_seq : (key * 'a) BatSeq.t -> 'a t -> 'a t
val of_seq : (key * 'a) BatSeq.t -> 'a t
val print :
?first:string ->
?last:string ->
?sep:string ->
?kvsep:string ->
('a BatInnerIO.output -> key -> unit) ->
('a BatInnerIO.output -> 'c -> unit) ->
'a BatInnerIO.output -> 'c t -> unit
module Exceptionless :
sig
val find : key -> 'a t -> 'a option
val choose : 'a t -> (key * 'a) option
val any : 'a t -> (key * 'a) option
end
module Infix :
sig
val ( --> ) : 'a t -> key -> 'a
val ( <-- ) : 'a t -> key * 'a -> 'a t
end
module Labels :
sig
val add : key:key -> data:'a -> 'a t -> 'a t
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val map : f:('a -> 'b) -> 'a t -> 'b t
val mapi : f:(key:key -> data:'a -> 'b) -> 'a t -> 'b t
val filterv : f:('a -> bool) -> 'a t -> 'a t
val filter : f:(key -> 'a -> bool) -> 'a t -> 'a t
val fold :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val compare : cmp:('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : cmp:('a -> 'a -> bool) -> 'a t -> 'a t -> bool
end
end
module Nativeint :
sig
type key = nativeint
type +!'a t
val empty : 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key -> 'a -> 'a t -> 'a t
val update_stdlib : key -> ('a option -> 'a option) -> 'a t -> 'a t
val update : key -> key -> 'a -> 'a t -> 'a t
val find : key -> 'a t -> 'a
val find_opt : key -> 'a t -> 'a option
val find_default : 'a -> key -> 'a t -> 'a
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 remove : key -> 'a t -> 'a t
val remove_exn : key -> 'a t -> 'a t
val modify : key -> ('a -> 'a) -> 'a t -> 'a t
val modify_def : 'a -> key -> ('a -> 'a) -> 'a t -> 'a t
val modify_opt : key -> ('a option -> 'a option) -> 'a t -> 'a t
val extract : key -> 'a t -> 'a * 'a t
val pop : 'a t -> (key * 'a) * 'a t
val mem : key -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val filterv : ('a -> bool) -> 'a t -> 'a t
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : 'a t -> key BatEnum.t
val values : 'a t -> 'a BatEnum.t
val min_binding : 'a t -> key * 'a
val min_binding_opt : 'a t -> (key * 'a) option
val pop_min_binding : 'a t -> (key * 'a) * 'a t
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val pop_max_binding : 'a t -> (key * 'a) * 'a t
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
val any : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val singleton : key -> 'a -> 'a t
val bindings : 'a t -> (key * 'a) list
val enum : 'a t -> (key * 'a) BatEnum.t
val backwards : 'a t -> (key * 'a) BatEnum.t
val of_enum : (key * 'a) BatEnum.t -> 'a t
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
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 to_seq : 'a t -> (key * 'a) BatSeq.t
val to_rev_seq : 'a t -> (key * 'a) BatSeq.t
val to_seq_from : key -> 'a t -> (key * 'a) BatSeq.t
val add_seq : (key * 'a) BatSeq.t -> 'a t -> 'a t
val of_seq : (key * 'a) BatSeq.t -> 'a t
val print :
?first:string ->
?last:string ->
?sep:string ->
?kvsep:string ->
('a BatInnerIO.output -> key -> unit) ->
('a BatInnerIO.output -> 'c -> unit) ->
'a BatInnerIO.output -> 'c t -> unit
module Exceptionless :
sig
val find : key -> 'a t -> 'a option
val choose : 'a t -> (key * 'a) option
val any : 'a t -> (key * 'a) option
end
module Infix :
sig
val ( --> ) : 'a t -> key -> 'a
val ( <-- ) : 'a t -> key * 'a -> 'a t
end
module Labels :
sig
val add : key:key -> data:'a -> 'a t -> 'a t
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val map : f:('a -> 'b) -> 'a t -> 'b t
val mapi : f:(key:key -> data:'a -> 'b) -> 'a t -> 'b t
val filterv : f:('a -> bool) -> 'a t -> 'a t
val filter : f:(key -> 'a -> bool) -> 'a t -> 'a t
val fold :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val compare : cmp:('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : cmp:('a -> 'a -> bool) -> 'a t -> 'a t -> bool
end
end
module Float :
sig
type key = float
type +!'a t
val empty : 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key -> 'a -> 'a t -> 'a t
val update_stdlib : key -> ('a option -> 'a option) -> 'a t -> 'a t
val update : key -> key -> 'a -> 'a t -> 'a t
val find : key -> 'a t -> 'a
val find_opt : key -> 'a t -> 'a option
val find_default : 'a -> key -> 'a t -> 'a
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 remove : key -> 'a t -> 'a t
val remove_exn : key -> 'a t -> 'a t
val modify : key -> ('a -> 'a) -> 'a t -> 'a t
val modify_def : 'a -> key -> ('a -> 'a) -> 'a t -> 'a t
val modify_opt : key -> ('a option -> 'a option) -> 'a t -> 'a t
val extract : key -> 'a t -> 'a * 'a t
val pop : 'a t -> (key * 'a) * 'a t
val mem : key -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val filterv : ('a -> bool) -> 'a t -> 'a t
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : 'a t -> key BatEnum.t
val values : 'a t -> 'a BatEnum.t
val min_binding : 'a t -> key * 'a
val min_binding_opt : 'a t -> (key * 'a) option
val pop_min_binding : 'a t -> (key * 'a) * 'a t
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val pop_max_binding : 'a t -> (key * 'a) * 'a t
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
val any : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val singleton : key -> 'a -> 'a t
val bindings : 'a t -> (key * 'a) list
val enum : 'a t -> (key * 'a) BatEnum.t
val backwards : 'a t -> (key * 'a) BatEnum.t
val of_enum : (key * 'a) BatEnum.t -> 'a t
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
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 to_seq : 'a t -> (key * 'a) BatSeq.t
val to_rev_seq : 'a t -> (key * 'a) BatSeq.t
val to_seq_from : key -> 'a t -> (key * 'a) BatSeq.t
val add_seq : (key * 'a) BatSeq.t -> 'a t -> 'a t
val of_seq : (key * 'a) BatSeq.t -> 'a t
val print :
?first:string ->
?last:string ->
?sep:string ->
?kvsep:string ->
('a BatInnerIO.output -> key -> unit) ->
('a BatInnerIO.output -> 'c -> unit) ->
'a BatInnerIO.output -> 'c t -> unit
module Exceptionless :
sig
val find : key -> 'a t -> 'a option
val choose : 'a t -> (key * 'a) option
val any : 'a t -> (key * 'a) option
end
module Infix :
sig
val ( --> ) : 'a t -> key -> 'a
val ( <-- ) : 'a t -> key * 'a -> 'a t
end
module Labels :
sig
val add : key:key -> data:'a -> 'a t -> 'a t
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val map : f:('a -> 'b) -> 'a t -> 'b t
val mapi : f:(key:key -> data:'a -> 'b) -> 'a t -> 'b t
val filterv : f:('a -> bool) -> 'a t -> 'a t
val filter : f:(key -> 'a -> bool) -> 'a t -> 'a t
val fold :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val compare : cmp:('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : cmp:('a -> 'a -> bool) -> 'a t -> 'a t -> bool
end
end
module Char :
sig
type key = char
type +!'a t
val empty : 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key -> 'a -> 'a t -> 'a t
val update_stdlib : key -> ('a option -> 'a option) -> 'a t -> 'a t
val update : key -> key -> 'a -> 'a t -> 'a t
val find : key -> 'a t -> 'a
val find_opt : key -> 'a t -> 'a option
val find_default : 'a -> key -> 'a t -> 'a
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 remove : key -> 'a t -> 'a t
val remove_exn : key -> 'a t -> 'a t
val modify : key -> ('a -> 'a) -> 'a t -> 'a t
val modify_def : 'a -> key -> ('a -> 'a) -> 'a t -> 'a t
val modify_opt : key -> ('a option -> 'a option) -> 'a t -> 'a t
val extract : key -> 'a t -> 'a * 'a t
val pop : 'a t -> (key * 'a) * 'a t
val mem : key -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val filterv : ('a -> bool) -> 'a t -> 'a t
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : 'a t -> key BatEnum.t
val values : 'a t -> 'a BatEnum.t
val min_binding : 'a t -> key * 'a
val min_binding_opt : 'a t -> (key * 'a) option
val pop_min_binding : 'a t -> (key * 'a) * 'a t
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val pop_max_binding : 'a t -> (key * 'a) * 'a t
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
val any : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val singleton : key -> 'a -> 'a t
val bindings : 'a t -> (key * 'a) list
val enum : 'a t -> (key * 'a) BatEnum.t
val backwards : 'a t -> (key * 'a) BatEnum.t
val of_enum : (key * 'a) BatEnum.t -> 'a t
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
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 to_seq : 'a t -> (key * 'a) BatSeq.t
val to_rev_seq : 'a t -> (key * 'a) BatSeq.t
val to_seq_from : key -> 'a t -> (key * 'a) BatSeq.t
val add_seq : (key * 'a) BatSeq.t -> 'a t -> 'a t
val of_seq : (key * 'a) BatSeq.t -> 'a t
val print :
?first:string ->
?last:string ->
?sep:string ->
?kvsep:string ->
('a BatInnerIO.output -> key -> unit) ->
('a BatInnerIO.output -> 'c -> unit) ->
'a BatInnerIO.output -> 'c t -> unit
module Exceptionless :
sig
val find : key -> 'a t -> 'a option
val choose : 'a t -> (key * 'a) option
val any : 'a t -> (key * 'a) option
end
module Infix :
sig
val ( --> ) : 'a t -> key -> 'a
val ( <-- ) : 'a t -> key * 'a -> 'a t
end
module Labels :
sig
val add : key:key -> data:'a -> 'a t -> 'a t
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val map : f:('a -> 'b) -> 'a t -> 'b t
val mapi : f:(key:key -> data:'a -> 'b) -> 'a t -> 'b t
val filterv : f:('a -> bool) -> 'a t -> 'a t
val filter : f:(key -> 'a -> bool) -> 'a t -> 'a t
val fold :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val compare : cmp:('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : cmp:('a -> 'a -> bool) -> 'a t -> 'a t -> bool
end
end
module String :
sig
type key = string
type +!'a t
val empty : 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key -> 'a -> 'a t -> 'a t
val update_stdlib : key -> ('a option -> 'a option) -> 'a t -> 'a t
val update : key -> key -> 'a -> 'a t -> 'a t
val find : key -> 'a t -> 'a
val find_opt : key -> 'a t -> 'a option
val find_default : 'a -> key -> 'a t -> 'a
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 remove : key -> 'a t -> 'a t
val remove_exn : key -> 'a t -> 'a t
val modify : key -> ('a -> 'a) -> 'a t -> 'a t
val modify_def : 'a -> key -> ('a -> 'a) -> 'a t -> 'a t
val modify_opt : key -> ('a option -> 'a option) -> 'a t -> 'a t
val extract : key -> 'a t -> 'a * 'a t
val pop : 'a t -> (key * 'a) * 'a t
val mem : key -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val filterv : ('a -> bool) -> 'a t -> 'a t
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : 'a t -> key BatEnum.t
val values : 'a t -> 'a BatEnum.t
val min_binding : 'a t -> key * 'a
val min_binding_opt : 'a t -> (key * 'a) option
val pop_min_binding : 'a t -> (key * 'a) * 'a t
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val pop_max_binding : 'a t -> (key * 'a) * 'a t
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
val any : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val singleton : key -> 'a -> 'a t
val bindings : 'a t -> (key * 'a) list
val enum : 'a t -> (key * 'a) BatEnum.t
val backwards : 'a t -> (key * 'a) BatEnum.t
val of_enum : (key * 'a) BatEnum.t -> 'a t
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
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 to_seq : 'a t -> (key * 'a) BatSeq.t
val to_rev_seq : 'a t -> (key * 'a) BatSeq.t
val to_seq_from : key -> 'a t -> (key * 'a) BatSeq.t
val add_seq : (key * 'a) BatSeq.t -> 'a t -> 'a t
val of_seq : (key * 'a) BatSeq.t -> 'a t
val print :
?first:string ->
?last:string ->
?sep:string ->
?kvsep:string ->
('a BatInnerIO.output -> key -> unit) ->
('a BatInnerIO.output -> 'c -> unit) ->
'a BatInnerIO.output -> 'c t -> unit
module Exceptionless :
sig
val find : key -> 'a t -> 'a option
val choose : 'a t -> (key * 'a) option
val any : 'a t -> (key * 'a) option
end
module Infix :
sig
val ( --> ) : 'a t -> key -> 'a
val ( <-- ) : 'a t -> key * 'a -> 'a t
end
module Labels :
sig
val add : key:key -> data:'a -> 'a t -> 'a t
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val map : f:('a -> 'b) -> 'a t -> 'b t
val mapi : f:(key:key -> data:'a -> 'b) -> 'a t -> 'b t
val filterv : f:('a -> bool) -> 'a t -> 'a t
val filter : f:(key -> 'a -> bool) -> 'a t -> 'a t
val fold :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val compare : cmp:('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : cmp:('a -> 'a -> bool) -> 'a t -> 'a t -> bool
end
end
type (+'a, +'b) t
val empty : ('a, 'b) t
val is_empty : ('a, 'b) t -> bool
val singleton : 'a -> 'b -> ('a, 'b) t
val cardinal : ('a, 'b) t -> int
val add : 'a -> 'b -> ('a, 'b) t -> ('a, 'b) t
val update : 'a -> 'a -> 'b -> ('a, 'b) t -> ('a, 'b) t
val update_stdlib :
'a -> ('b option -> 'b option) -> ('a, 'b) t -> ('a, 'b) t
val find_opt : 'a -> ('a, 'b) t -> 'b option
val find_default : 'b -> 'a -> ('a, 'b) t -> 'b
val find_first : ('a -> bool) -> ('a, 'b) t -> 'a * 'b
val find_first_opt : ('a -> bool) -> ('a, 'b) t -> ('a * 'b) option
val find_last : ('a -> bool) -> ('a, 'b) t -> 'a * 'b
val find_last_opt : ('a -> bool) -> ('a, 'b) t -> ('a * 'b) option
val remove : 'a -> ('a, 'b) t -> ('a, 'b) t
val remove_exn : 'a -> ('a, 'b) t -> ('a, 'b) t
val mem : 'a -> ('a, 'b) t -> bool
val iter : ('a -> 'b -> unit) -> ('a, 'b) t -> unit
val map : ('b -> 'c) -> ('a, 'b) t -> ('a, 'c) t
val mapi : ('a -> 'b -> 'c) -> ('a, 'b) t -> ('a, 'c) t
val fold : ('b -> 'c -> 'c) -> ('a, 'b) t -> 'c -> 'c
val foldi : ('a -> 'b -> 'c -> 'c) -> ('a, 'b) t -> 'c -> 'c
val at_rank_exn : int -> ('key, 'a) t -> 'key * 'a
val filterv : ('a -> bool) -> ('key, 'a) t -> ('key, 'a) t
val filter : ('key -> 'a -> bool) -> ('key, 'a) t -> ('key, 'a) t
val filter_map : ('key -> 'a -> 'b option) -> ('key, 'a) t -> ('key, 'b) t
val choose_opt : ('key, 'a) t -> ('key * 'a) option
val split : 'key -> ('key, 'a) t -> ('key, 'a) t * 'a option * ('key, 'a) t
val min_binding : ('key, 'a) t -> 'key * 'a
val min_binding_opt : ('key, 'a) t -> ('key * 'a) option
val pop_min_binding : ('key, 'a) t -> ('key * 'a) * ('key, 'a) t
val max_binding : ('key, 'a) t -> 'key * 'a
val max_binding_opt : ('key, 'a) t -> ('key * 'a) option
val pop_max_binding : ('key, 'a) t -> ('key * 'a) * ('key, 'a) t
val enum : ('a, 'b) t -> ('a * 'b) BatEnum.t
val backwards : ('a, 'b) t -> ('a * 'b) BatEnum.t
val keys : ('a, 'b) t -> 'a BatEnum.t
val values : ('a, 'b) t -> 'b BatEnum.t
val of_enum : ('a * 'b) BatEnum.t -> ('a, 'b) t
val for_all : ('a -> 'b -> bool) -> ('a, 'b) t -> bool
val exists : ('a -> 'b -> bool) -> ('a, 'b) t -> bool
val partition : ('a -> 'b -> bool) -> ('a, 'b) t -> ('a, 'b) t * ('a, 'b) t
val add_carry : 'a -> 'b -> ('a, 'b) t -> ('a, 'b) t * 'b option
val modify : 'a -> ('b -> 'b) -> ('a, 'b) t -> ('a, 'b) t
val modify_def : 'b -> 'a -> ('b -> 'b) -> ('a, 'b) t -> ('a, 'b) t
val modify_opt : 'a -> ('b option -> 'b option) -> ('a, 'b) t -> ('a, 'b) t
val extract : 'a -> ('a, 'b) t -> 'b * ('a, 'b) t
val pop : ('a, 'b) t -> ('a * 'b) * ('a, 'b) t
val union : ('a, 'b) t -> ('a, 'b) t -> ('a, 'b) t
val union_stdlib :
('key -> 'a -> 'a -> 'a option) ->
('key, 'a) t -> ('key, 'a) t -> ('key, 'a) t
val to_seq : ('key, 'a) t -> ('key * 'a) BatSeq.t
val to_rev_seq : ('key, 'a) t -> ('key * 'a) BatSeq.t
val to_seq_from : 'key -> ('key, 'a) t -> ('key * 'a) BatSeq.t
val add_seq : ('key * 'a) BatSeq.t -> ('key, 'a) t -> ('key, 'a) t
val of_seq : ('key * 'a) BatSeq.t -> ('key, 'a) t
val diff : ('a, 'b) t -> ('a, 'b) t -> ('a, 'b) t
val intersect : ('b -> 'c -> 'd) -> ('a, 'b) t -> ('a, 'c) t -> ('a, 'd) t
val merge :
('key -> 'a option -> 'b option -> 'c option) ->
('key, 'a) t -> ('key, 'b) t -> ('key, 'c) t
val compare : ('b -> 'b -> int) -> ('a, 'b) t -> ('a, 'b) t -> int
val equal : ('b -> 'b -> bool) -> ('a, 'b) t -> ('a, 'b) t -> bool
module Exceptionless :
sig
val find : 'a -> ('a, 'b) t -> 'b option
val choose : ('a, 'b) t -> ('a * 'b) option
val any : ('a, 'b) t -> ('a * 'b) option
end
module Infix :
sig
val ( --> ) : ('a, 'b) t -> 'a -> 'b
val ( <-- ) : ('a, 'b) t -> 'a * 'b -> ('a, 'b) t
end
val ( --> ) : ('a, 'b) t -> 'a -> 'b
val ( <-- ) : ('a, 'b) t -> 'a * 'b -> ('a, 'b) t
val bindings : ('key, 'a) t -> ('key * 'a) list
val print :
?first:string ->
?last:string ->
?sep:string ->
?kvsep:string ->
('a BatInnerIO.output -> 'b -> unit) ->
('a BatInnerIO.output -> 'c -> unit) ->
'a BatInnerIO.output -> ('b, 'c) t -> unit
module type OrderedType = BatInterfaces.OrderedType
val find : 'a -> ('a, 'b) t -> 'b option
val choose : ('a, 'b) t -> ('a * 'b) option
val any : ('a, 'b) t -> ('a * 'b) option
module PMap :
sig
type ('a, 'b) t = ('a, 'b) BatMap.PMap.t
val empty : ('a, 'b) t
val is_empty : ('a, 'b) t -> bool
val create : ('a -> 'a -> int) -> ('a, 'b) t
val singleton : ?cmp:('a -> 'a -> int) -> 'a -> 'b -> ('a, 'b) t
val cardinal : ('a, 'b) t -> int
val add : 'a -> 'b -> ('a, 'b) t -> ('a, 'b) t
val update : 'a -> 'a -> 'b -> ('a, 'b) t -> ('a, 'b) t
val update_stdlib :
'a -> ('b option -> 'b option) -> ('a, 'b) t -> ('a, 'b) t
val find_default : 'b -> 'a -> ('a, 'b) t -> 'b
val find_first : ('a -> bool) -> ('a, 'b) t -> 'a * 'b
val find_first_opt : ('a -> bool) -> ('a, 'b) t -> ('a * 'b) option
val find_last : ('a -> bool) -> ('a, 'b) t -> 'a * 'b
val find_last_opt : ('a -> bool) -> ('a, 'b) t -> ('a * 'b) option
val remove : 'a -> ('a, 'b) t -> ('a, 'b) t
val remove_exn : 'a -> ('a, 'b) t -> ('a, 'b) t
val mem : 'a -> ('a, 'b) t -> bool
val iter : ('a -> 'b -> unit) -> ('a, 'b) t -> unit
val map : ('b -> 'c) -> ('a, 'b) t -> ('a, 'c) t
val mapi : ('a -> 'b -> 'c) -> ('a, 'b) t -> ('a, 'c) t
val fold : ('b -> 'c -> 'c) -> ('a, 'b) t -> 'c -> 'c
val foldi : ('a -> 'b -> 'c -> 'c) -> ('a, 'b) t -> 'c -> 'c
val at_rank_exn : int -> ('a, 'b) t -> 'a * 'b
val filterv : ('a -> bool) -> ('key, 'a) t -> ('key, 'a) t
val filter : ('key -> 'a -> bool) -> ('key, 'a) t -> ('key, 'a) t
val filter_map :
('key -> 'a -> 'b option) -> ('key, 'a) t -> ('key, 'b) t
val choose_opt : ('key, 'a) t -> ('key * 'a) option
val split :
'key -> ('key, 'a) t -> ('key, 'a) t * 'a option * ('key, 'a) t
val min_binding : ('key, 'a) t -> 'key * 'a
val min_binding_opt : ('key, 'a) t -> ('key * 'a) option
val pop_min_binding : ('key, 'a) t -> ('key * 'a) * ('key, 'a) t
val max_binding : ('key, 'a) t -> 'key * 'a
val max_binding_opt : ('key, 'a) t -> ('key * 'a) option
val pop_max_binding : ('key, 'a) t -> ('key * 'a) * ('key, 'a) t
val enum : ('a, 'b) t -> ('a * 'b) BatEnum.t
val backwards : ('a, 'b) t -> ('a * 'b) BatEnum.t
val keys : ('a, 'b) t -> 'a BatEnum.t
val values : ('a, 'b) t -> 'b BatEnum.t
val of_enum :
?cmp:('a -> 'a -> int) -> ('a * 'b) BatEnum.t -> ('a, 'b) t
val for_all : ('a -> 'b -> bool) -> ('a, 'b) t -> bool
val exists : ('a -> 'b -> bool) -> ('a, 'b) t -> bool
val partition :
('a -> 'b -> bool) -> ('a, 'b) t -> ('a, 'b) t * ('a, 'b) t
val add_carry : 'a -> 'b -> ('a, 'b) t -> ('a, 'b) t * 'b option
val modify : 'a -> ('b -> 'b) -> ('a, 'b) t -> ('a, 'b) t
val modify_def : 'b -> 'a -> ('b -> 'b) -> ('a, 'b) t -> ('a, 'b) t
val modify_opt :
'a -> ('b option -> 'b option) -> ('a, 'b) t -> ('a, 'b) t
val extract : 'a -> ('a, 'b) t -> 'b * ('a, 'b) t
val pop : ('a, 'b) t -> ('a * 'b) * ('a, 'b) t
val union : ('a, 'b) t -> ('a, 'b) t -> ('a, 'b) t
val diff : ('a, 'b) t -> ('a, 'b) t -> ('a, 'b) t
val intersect :
('b -> 'c -> 'd) -> ('a, 'b) t -> ('a, 'c) t -> ('a, 'd) t
val merge :
('key -> 'a option -> 'b option -> 'c option) ->
('key, 'a) t -> ('key, 'b) t -> ('key, 'c) t
val merge_unsafe :
('key -> 'a option -> 'b option -> 'c option) ->
('key, 'a) t -> ('key, 'b) t -> ('key, 'c) t
val union_stdlib :
('key -> 'a -> 'a -> 'a option) ->
('key, 'a) t -> ('key, 'a) t -> ('key, 'a) t
val to_seq : ('key, 'a) t -> ('key * 'a) BatSeq.t
val to_rev_seq : ('key, 'a) t -> ('key * 'a) BatSeq.t
val to_seq_from : 'key -> ('key, 'a) t -> ('key * 'a) BatSeq.t
val add_seq : ('key * 'a) BatSeq.t -> ('key, 'a) t -> ('key, 'a) t
val of_seq :
?cmp:('key -> 'key -> int) -> ('key * 'a) BatSeq.t -> ('key, 'a) t
val compare : ('b -> 'b -> int) -> ('a, 'b) t -> ('a, 'b) t -> int
val equal : ('b -> 'b -> bool) -> ('a, 'b) t -> ('a, 'b) t -> bool
module Exceptionless = BatMap.PMap.Exceptionless
module Infix = BatMap.PMap.Infix
val ( --> ) : ('a, 'b) t -> 'a -> 'b
val ( <-- ) : ('a, 'b) t -> 'a * 'b -> ('a, 'b) t
val bindings : ('key, 'a) t -> ('key * 'a) list
val print :
?first:string ->
?last:string ->
?sep:string ->
?kvsep:string ->
('a BatInnerIO.output -> 'b -> unit) ->
('a BatInnerIO.output -> 'c -> unit) ->
'a BatInnerIO.output -> ('b, 'c) t -> unit
val get_cmp : ('a, 'b) t -> 'a -> 'a -> int
val find : 'a -> ('a, 'b) BatMap.PMap.t -> 'b option
val choose : ('a, 'b) BatMap.PMap.t -> ('a * 'b) option
val any : ('a, 'b) BatMap.PMap.t -> ('a * 'b) option
end
end