1Ephemeron.K1.Make(3) OCamldoc Ephemeron.K1.Make(3)
2
3
4
6 Ephemeron.K1.Make - Functor building an implementation of a weak hash
7 table
8
10 Module Ephemeron.K1.Make
11
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 Hashtbl.HashedType
25
26
27
28
29
30
31
32
33
34 === Propose the same interface as usual hash table. However since the
35 bindings are weak, even if mem h k is true, a subsequent find h k may
36 raise Not_found because the garbage collector can run between the two.
37 Moreover, the table shouldn't be modified during a call to iter. Use
38 filter_map_inplace in this case. ===
39
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
602018-04-14 source: Ephemeron.K1.Make(3)