1Hashtbl.Make(3)                  OCaml library                 Hashtbl.Make(3)
2
3
4

NAME

6       Hashtbl.Make  -  Functor  building  an  implementation of the hashtable
7       structure.
8

Module

10       Module   Hashtbl.Make
11

Documentation

13       Module Make
14        : functor (H : HashedType) -> sig end
15
16
17       Functor building an implementation of  the  hashtable  structure.   The
18       functor  Hashtbl.Make returns a structure containing a type key of keys
19       and a type 'a t of hash tables associating data of type 'a to  keys  of
20       type  key  .   The operations perform similarly to those of the generic
21       interface, but use the hashing and equality functions specified in  the
22       functor argument H instead of generic equality and hashing.
23
24
25
26       Parameters:
27
28       "H"
29
30       Hashtbl.HashedType
31
32
33
34
35
36
37
38       type key
39
40
41
42
43       type 'a t
44
45
46
47
48
49       val create : int -> 'a t
50
51
52
53
54       val clear : 'a t -> unit
55
56
57
58
59       val copy : 'a t -> 'a t
60
61
62
63
64       val add : 'a t -> key -> 'a -> unit
65
66
67
68
69       val remove : 'a t -> key -> unit
70
71
72
73
74       val find : 'a t -> key -> 'a
75
76
77
78
79       val find_all : 'a t -> key -> 'a list
80
81
82
83
84       val replace : 'a t -> key -> 'a -> unit
85
86
87
88
89       val mem : 'a t -> key -> bool
90
91
92
93
94       val iter : (key -> 'a -> unit) -> 'a t -> unit
95
96
97
98
99       val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
100
101
102
103
104       val length : 'a t -> int
105
106
107
108
109
110
111OCamldoc                          2007-05-24                   Hashtbl.Make(3)