val rev_map : (elt -> elt) -> t -> t
val length : t -> int
val mem : elt -> t -> bool
-
+ val stats : unit -> unit
+ val init : unit -> unit
end
module Make (H : Hcons.SA) : S with type elt = H.t =
let equal = Node.equal
let uid x= x.Node.id
let nil = Node.make Nil
-
+ let stats = Node.stats
+ let init = Node.init
(* doing sorted insertion allows to make better use of hash consing *)
let rec sorted_cons e l =
match l.Node.node with