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.
module type OrderedType =
Input signature of the functor
module type S =
Output signature of the functor
Functor building an implementation of the set structure given a totally ordered type.