Poorman's hashset by Hashtbl
val create : ?random:bool -> int -> 'a tval add : 'a t -> 'a -> unitval remove : 'a t -> 'a -> unitval mem : 'a t -> 'a -> boolval find : 'a t -> 'a -> 'aval find_opt : 'a t -> 'a -> 'a optionfind and find_opt finds the 'same' element in the set. Good for hash consing
val find_or_add : 'a t -> 'a -> 'aval iter : ('a -> unit) -> 'a t -> unitval fold : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'bval elements : 'a t -> intval clear : 'a t -> unitval of_list : int -> 'a list -> 'a tval to_list : 'a t -> 'a listmodule Make (A : Hashtbl.HashedType) : sig ... end