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 side-
21       effects).  The implementation uses balanced binary trees, and therefore
22       searching and insertion take time logarithmic in the size of the map.
23
24
25
26
27
28
29       module type OrderedType = sig end
30
31
32       Input signature of the functor Map.Make .
33
34
35
36       module type S = sig end
37
38
39       Output signature of the functor Map.Make .
40
41
42
43       module Make : functor (Ord : OrderedType) -> sig end
44
45
46       Functor building an implementation of the map structure given a totally
47       ordered type.
48
49
50
51
52
53
54OCamldoc                          2007-05-24                            Map(3)