sig
module type Fold =
sig type t type data val init : t val f : t -> data -> t end
module type Fold_sexpable =
sig
type t
type data
val init : t
val f : t -> data -> t
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
end
module Cons :
functor (T : sig type t end) ->
sig
type t = T.t list
type data = T.t
val init : t
val f : t -> data -> t
end
module Cons_sexpable :
functor (T : Core.Std.Sexpable) ->
sig
type t = T.sexpable list
type data = T.sexpable
val init : t
val f : t -> data -> t
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
end
module Multiply :
sig
type t = int
type data = int
val init : t
val f : t -> data -> t
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
end
module Add :
sig
type t = int
type data = int
val init : t
val f : t -> data -> t
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
end
module type Fold_map =
sig
type in_value
type out_value
type 'a t
val empty : 'a t
val singleton : 'a -> in_value -> 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key:'a -> data:in_value -> 'a t -> 'a t
val find : 'a t -> 'a -> out_value
val remove : 'a t -> 'a -> 'a t
val set : key:'a -> data:out_value -> 'a t -> 'a t
val mem : 'a t -> 'a -> bool
val iter : f:(key:'a -> data:out_value -> unit) -> 'a t -> unit
val fold :
f:(key:'a -> data:out_value -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val filter : f:(key:'a -> data:out_value -> bool) -> 'a t -> 'a t
val keys : 'a t -> 'a list
val data : 'a t -> out_value list
val to_alist : 'a t -> ('a * out_value) list
val of_list : ('a * in_value) list -> 'a t
val for_all : f:(out_value -> bool) -> 'a t -> bool
val exists : f:(out_value -> bool) -> 'a t -> bool
val to_map : 'a t -> ('a, out_value) Core.Std.Map.t
val of_map : ('a, out_value) Core.Std.Map.t -> 'a t
end
module type Fold_map_sexpable =
sig
type in_value
type out_value
type 'a t
val empty : 'a t
val singleton : 'a -> in_value -> 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key:'a -> data:in_value -> 'a t -> 'a t
val find : 'a t -> 'a -> out_value
val remove : 'a t -> 'a -> 'a t
val set : key:'a -> data:out_value -> 'a t -> 'a t
val mem : 'a t -> 'a -> bool
val iter : f:(key:'a -> data:out_value -> unit) -> 'a t -> unit
val fold :
f:(key:'a -> data:out_value -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val filter : f:(key:'a -> data:out_value -> bool) -> 'a t -> 'a t
val keys : 'a t -> 'a list
val data : 'a t -> out_value list
val to_alist : 'a t -> ('a * out_value) list
val of_list : ('a * in_value) list -> 'a t
val for_all : f:(out_value -> bool) -> 'a t -> bool
val exists : f:(out_value -> bool) -> 'a t -> bool
val to_map : 'a t -> ('a, out_value) Core.Std.Map.t
val of_map : ('a, out_value) Core.Std.Map.t -> 'a t
type 'a sexpable = 'a t
val sexp_of_t : ('a -> Sexplib.Sexp.t) -> 'a sexpable -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a sexpable
end
module Make :
functor (Fold : Fold) ->
sig
type in_value = Fold.data
type out_value = Fold.t
type 'a t = 'a Fold_map.Make(Fold).t
val empty : 'a t
val singleton : 'a -> in_value -> 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key:'a -> data:in_value -> 'a t -> 'a t
val find : 'a t -> 'a -> out_value
val remove : 'a t -> 'a -> 'a t
val set : key:'a -> data:out_value -> 'a t -> 'a t
val mem : 'a t -> 'a -> bool
val iter : f:(key:'a -> data:out_value -> unit) -> 'a t -> unit
val fold :
f:(key:'a -> data:out_value -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val filter : f:(key:'a -> data:out_value -> bool) -> 'a t -> 'a t
val keys : 'a t -> 'a list
val data : 'a t -> out_value list
val to_alist : 'a t -> ('a * out_value) list
val of_list : ('a * in_value) list -> 'a t
val for_all : f:(out_value -> bool) -> 'a t -> bool
val exists : f:(out_value -> bool) -> 'a t -> bool
val to_map : 'a t -> ('a, out_value) Core.Std.Map.t
val of_map : ('a, out_value) Core.Std.Map.t -> 'a t
end
module Make_sexpable :
functor (Fold_sexpable : Fold_sexpable) ->
sig
type in_value = Fold_sexpable.data
type out_value = Fold_sexpable.t
type 'a t = 'a Fold_map.Make_sexpable(Fold_sexpable).t
val empty : 'a t
val singleton : 'a -> in_value -> 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key:'a -> data:in_value -> 'a t -> 'a t
val find : 'a t -> 'a -> out_value
val remove : 'a t -> 'a -> 'a t
val set : key:'a -> data:out_value -> 'a t -> 'a t
val mem : 'a t -> 'a -> bool
val iter : f:(key:'a -> data:out_value -> unit) -> 'a t -> unit
val fold :
f:(key:'a -> data:out_value -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val filter : f:(key:'a -> data:out_value -> bool) -> 'a t -> 'a t
val keys : 'a t -> 'a list
val data : 'a t -> out_value list
val to_alist : 'a t -> ('a * out_value) list
val of_list : ('a * in_value) list -> 'a t
val for_all : f:(out_value -> bool) -> 'a t -> bool
val exists : f:(out_value -> bool) -> 'a t -> bool
val to_map : 'a t -> ('a, out_value) Core.Std.Map.t
val of_map : ('a, out_value) Core.Std.Map.t -> 'a t
type 'a sexpable = 'a t
val sexp_of_t :
('a -> Sexplib.Sexp.t) -> 'a sexpable -> Sexplib.Sexp.t
val t_of_sexp :
(Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a sexpable
end
end