Module BatMap

module BatMap: sig .. end

This module implements applicative association tables, also known as finite maps or dictionaries, given a total ordering function over the keys. All operations over maps are purely applicative (no side-effects). The implementation uses balanced binary trees, and therefore searching and insertion take time logarithmic in the size of the map.
Author(s): Xavier Leroy (Base module), David Rajchenbach-Teller

module type S = sig .. end

module StringMap: S  with type key = String.t

module IStringMap: S  with type key = String.t

module NumStringMap: S  with type key = String.t

module RopeMap: S  with type key = BatRope.t

module IRopeMap: S  with type key = BatRope.t

module IntMap: S  with type key = BatInt.t

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