Module Ptset


module Ptset: sig .. end
Sets over ordered types.

This module implements the set data structure, given a total ordering function over the set elements. All operations over sets are purely applicative (no side-effects). The implementation uses balanced binary trees, and is therefore reasonably efficient: insertion and membership take time logarithmic in the size of the set, for instance.



Input signature of the functor Set.Make.
module type S = sig .. end
module Make: 
functor (X : sig
type t 
val id : t -> int
val name : string
val pretty : Format.formatter -> t -> unit
end) -> S with type elt = X.t