package colibri2

You can search for identifiers within the package.

in-package search v0.2.0

Package contains no libraries

Association tables over ordered types

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.

module type S = sig ... end

module Make (Ord : Map_intf.OrderedType) : S with type key = Ord.t

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