MoreLabels.Map - no description

       Module Map
        : sigend

       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.

       For instance:
              moduleIntPairs=structtypet=int*intletcompare(x0,y0)(x1,y1)=matchStdlib.comparex0x1with0->Stdlib.comparey0y1|c->cendmodulePairsMap=Map.Make(IntPairs)letm=PairsMap.(empty|>add(0,1)"hello"|>add(1,0)"world")

       This creates a new module PairsMap , with a new type 'aPairsMap.t of maps from int*int to 'a . In this
       example, m contains string values so its type is stringPairsMap.t .

       moduletypeOrderedType=sigend

       Input signature of the functor MoreLabels.Map.Make .

       moduletypeS=sigend

       Output signature of the functor MoreLabels.Map.Make .

       moduleMake:(Ord:OrderedType)->sigend

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

OCamldoc                                           2025-06-12                                 MoreLabels.Map(3o)

       Module   MoreLabels.Map

       MoreLabels.Map - no description