functor (M : Hashtbl.HashedType) ->
sig
module HT :
sig
type key = M.t
type 'a t = 'a Hashtbl.Make(M).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
type set = {
id : int;
mutable parent : DisjointSet.Make.set option;
mutable rank : int;
}
type t = {
set_map : DisjointSet.Make.set DisjointSet.Make.HT.t;
mutable size : int;
}
val create : int -> DisjointSet.Make.t
val copy : DisjointSet.Make.t -> DisjointSet.Make.t
val find_impl : DisjointSet.Make.set -> DisjointSet.Make.set
val find :
DisjointSet.Make.t -> DisjointSet.Make.HT.key -> DisjointSet.Make.set
val eq : DisjointSet.Make.set -> DisjointSet.Make.set -> bool
val union :
DisjointSet.Make.set -> DisjointSet.Make.set -> DisjointSet.Make.set
val same_set :
DisjointSet.Make.t ->
DisjointSet.Make.HT.key -> DisjointSet.Make.HT.key -> bool
module SetMap :
sig
type key = set
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
end
val reverse_map :
DisjointSet.Make.t ->
'a ->
(DisjointSet.Make.HT.key -> 'a -> 'a) -> DisjointSet.Make.HT.key -> 'a
val clear : DisjointSet.Make.t -> unit
end