1Map(3)                           OCaml library                          Map(3)
2
3
4

NAME

6       Map - Association tables over ordered types.
7

Module

9       Module   Map
10

Documentation

12       Module Map
13        : sig end
14
15
16       Association tables over ordered types.
17
18       This  module  implements  applicative association tables, also known as
19       finite maps or dictionaries, given a total ordering function  over  the
20       keys.    All   operations   over   maps   are  purely  applicative  (no
21       side-effects).  The implementation  uses  balanced  binary  trees,  and
22       therefore  searching and insertion take time logarithmic in the size of
23       the map.
24
25
26
27
28
29
30       module type OrderedType = sig end
31
32
33       Input signature of the functor Map.Make .
34
35
36
37       module type S = sig end
38
39
40       Output signature of the functor Map.Make .
41
42
43
44       module Make : functor (Ord : OrderedType) -> sig end
45
46
47       Functor building an implementation of the map structure given a totally
48       ordered type.
49
50
51
52
53
54
55OCamldoc                          2017-03-22                            Map(3)