Module SetpSource

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.

Sourcemodule type PolyOrderedType = sig ... end

Input signature of the functor Set.Make.

Sourcemodule type S = sig ... end

Output signature of the functor Set.Make.

Sourcemodule Make (Ord : PolyOrderedType) : S with type 'a elt = 'a Ord.t

Functor building an implementation of the set structure given a totally ordered type.