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

NAME

6       Hashtbl.HashedType - The input signature of the functor Hashtbl.Make.
7

Module type

9       Module type   Hashtbl.HashedType
10

Documentation

12       Module type HashedType
13        = sig end
14
15
16       The input signature of the functor Hashtbl.Make .
17
18
19
20
21
22
23       type t
24
25
26       The type of the hashtable keys.
27
28
29
30
31       val equal : t -> t -> bool
32
33       The equality predicate used to compare keys.
34
35
36
37
38       val hash : t -> int
39
40       A  hashing function on keys. It must be such that if two keys are equal
41       according to equal , then they have identical hash values  as  computed
42       by  hash .  Examples: suitable ( equal , hash ) pairs for arbitrary key
43       types include ( (=) , Hashtbl.hash ) for comparing  objects  by  struc‐
44       ture,  (  (fun  x  y -> compare x y = 0) , Hashtbl.hash ) for comparing
45       objects by structure and handling Pervasives.nan correctly, and (  (==)
46       ,  Hashtbl.hash  )  for comparing objects by addresses (e.g. for cyclic
47       keys).
48
49
50
51
52
53
54OCamldoc                          2017-03-22             Hashtbl.HashedType(3)