sig
module type S =
sig
module Set : Utilsigs.OrderedContainer
module Map : Utilsigs.OrderedMap
module Hashmap : Hashtbl.S
module Hashset : Hashset.S
module MSet : Utilsigs.OrderedContainer
module FList : Utilsigs.BasicType
end
module Make :
functor (T : Utilsigs.BasicType) ->
sig
module Set :
sig
type t
val hash : t -> int
val to_string : t -> string
val pp : Format.formatter -> t -> unit
type elt = T.t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val max_elt : t -> elt
val choose : t -> elt
val split : elt -> t -> t * bool * t
val of_list : elt list -> t
val to_list : t -> elt list
val endomap : (elt -> elt) -> t -> t
val map_to : ('b -> 'a -> 'a) -> 'a -> (elt -> 'b) -> t -> 'a
val opt_map_to :
('b -> 'a -> 'a) -> 'a -> (elt -> 'b option) -> t -> 'a
val map_to_list : (elt -> 'a) -> t -> 'a list
val weave :
(elt -> 'a -> 'a list) ->
(elt -> 'a -> 'b) -> ('b list -> 'b) -> t -> 'a -> 'b
val find : (elt -> bool) -> t -> elt
val find_opt : (elt -> bool) -> t -> elt option
val find_map : (elt -> 'a option) -> t -> 'a option
val union_of_list : t list -> t
val subsets : t -> t list
val fixpoint : (t -> t) -> t -> t
val del_first : (elt -> bool) -> t -> t
val disjoint : t -> t -> bool
val mk_unifier :
bool ->
bool ->
('a, 'b, elt) Unification.cps_unifier ->
('a, 'b, t) Unification.cps_unifier
end
module Map :
sig
type key = T.t
type +'a t
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 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 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 max_binding : 'a t -> key * 'a
val choose : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val pp :
(Format.formatter -> 'a -> unit) ->
Format.formatter -> 'a t -> unit
val to_string : ('a -> string) -> 'a t -> string
val hash : ('a -> int) -> 'a t -> int
val of_list : (key * 'a) list -> 'a t
val to_list : 'a t -> (key * 'a) list
val endomap : (key * 'a -> key * 'b) -> 'a t -> 'b t
val union : 'a t -> 'a t -> 'a t
val find_map : (key -> 'a -> bool) -> 'a t -> (key * 'a) option
val fixpoint :
('a -> 'a -> bool) -> ('a t -> 'a t) -> 'a t -> 'a t
val submap : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val add_bindings : (key * 'a) list -> 'a t -> 'a t
end
module Hashmap :
sig
type key = T.t
type 'a t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Hashtbl.statistics
end
module Hashset :
sig
type elt = T.t
type t
val create : int -> t
val clear : t -> unit
val copy : t -> t
val add : t -> elt -> unit
val remove : t -> elt -> unit
val mem : t -> elt -> bool
val cardinal : t -> int
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val exists : (elt -> bool) -> t -> bool
val for_all : (elt -> bool) -> t -> bool
val left_union : t -> t -> t
val is_empty : t -> bool
val filter : (elt -> bool) -> t -> unit
val to_string : t -> string
val of_list : elt list -> t
val to_list : t -> elt list
val map_to : ('b -> 'a -> 'a) -> 'a -> (elt -> 'b) -> t -> 'a
end
module MSet :
sig
type t
val hash : t -> int
val to_string : t -> string
val pp : Format.formatter -> t -> unit
type elt = T.t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val max_elt : t -> elt
val choose : t -> elt
val split : elt -> t -> t * bool * t
val of_list : elt list -> t
val to_list : t -> elt list
val endomap : (elt -> elt) -> t -> t
val map_to : ('b -> 'a -> 'a) -> 'a -> (elt -> 'b) -> t -> 'a
val opt_map_to :
('b -> 'a -> 'a) -> 'a -> (elt -> 'b option) -> t -> 'a
val map_to_list : (elt -> 'a) -> t -> 'a list
val weave :
(elt -> 'a -> 'a list) ->
(elt -> 'a -> 'b) -> ('b list -> 'b) -> t -> 'a -> 'b
val find : (elt -> bool) -> t -> elt
val find_opt : (elt -> bool) -> t -> elt option
val find_map : (elt -> 'a option) -> t -> 'a option
val union_of_list : t list -> t
val subsets : t -> t list
val fixpoint : (t -> t) -> t -> t
val del_first : (elt -> bool) -> t -> t
val disjoint : t -> t -> bool
val mk_unifier :
bool ->
bool ->
('a, 'b, elt) Unification.cps_unifier ->
('a, 'b, t) Unification.cps_unifier
end
module FList :
sig
type t = T.t list
val compare : t -> t -> int
val equal : t -> t -> bool
val hash : t -> int
val to_string : t -> string
val pp : Format.formatter -> t -> unit
end
end
end