Module Ptmap

module Ptmap: sig .. end

Maps over integers implemented as Patricia trees.

This implementation follows Chris Okasaki and Andrew Gill's paper Fast Mergeable Integer Maps.

The following signature is similar to Map.S with type key = int. The documentation is only given for function that differs from Map.S with type key = int.

The module Ptset is based on the same data-structure.

module type S = sig .. end

include Ptmap.S