1Ephemeron.Kn.Make(3)             OCaml library            Ephemeron.Kn.Make(3)
2
3
4

NAME

6       Ephemeron.Kn.Make  -  Functor building an implementation of a weak hash
7       table
8

Module

10       Module   Ephemeron.Kn.Make
11

Documentation

13       Module Make
14        : functor (H : Hashtbl.HashedType) -> sig end
15
16
17       Functor building an implementation of a weak hash table
18
19
20       Parameters:
21
22       "H"
23
24       Stdlib.Hashtbl.HashedType
25
26
27
28
29
30
31
32
33
34       Propose the same interface as usual hash table. However since the bind‐
35       ings are weak, even if mem h k is true, a subsequent find h k may raise
36       Not_found because the garbage collector can run between the two.
37
38       Moreover, the table shouldn't be modified during a call to iter .   Use
39       filter_map_inplace in this case.
40
41       include Hashtbl.S
42
43
44
45
46       val clean : 'a t -> unit
47
48       remove all dead bindings. Done automatically during automatic resizing.
49
50
51
52       val stats_alive : 'a t -> Hashtbl.statistics
53
54       same as Hashtbl.SeededS.stats but only count the alive bindings
55
56
57
58
59
60OCamldoc                          2022-02-04              Ephemeron.Kn.Make(3)
Impressum