Module BatSet

module BatSet: sig .. end

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.

Note OCaml, Batteries Included, provides two implementations of sets: polymorphic sets (module PSet) and functorized sets (this module). Module Set offers a more complex and slightly poorer set of features but stronger type-safety. Module PSet is easier to use and has a few more powerful features but makes it easier to shoot yourself in the foot. In case of doubt, use Set.

This module is built upon Stdlib's Set module, but provides the complete interface.
Author(s): Xavier Leroy (Base module), David Teller

module type OrderedType = BatInterfaces.OrderedType

module type S = sig .. end

module StringSet: S  with type elt = String.t

module IStringSet: S  with type elt = String.t

module NumStringSet: S  with type elt = String.t

module RopeSet: S  with type elt = BatRope.t

module IRopeSet: S  with type elt = BatRope.t

module IntSet: S  with type elt = BatInt.t

module Make: 
functor (Ord : OrderedType) -> S  with type elt = Ord.t