1Ephemeron.K2.MakeSeeded(3) OCaml library Ephemeron.K2.MakeSeeded(3)
2
3
4
6 Ephemeron.K2.MakeSeeded - Functor building an implementation of a weak
7 hash table.
8
10 Module Ephemeron.K2.MakeSeeded
11
13 Module MakeSeeded
14 : functor (H1 : Hashtbl.SeededHashedType) (H2 : Hashtbl.SeededHashedâ
15 Type) -> sig end
16
17
18 Functor building an implementation of a weak hash table. The seed is
19 similar to the one of Hashtbl.MakeSeeded .
20
21
22 Parameters:
23
24 "H1"
25
26 Stdlib.Hashtbl.SeededHashedType
27
28
29
30 "H2"
31
32 Stdlib.Hashtbl.SeededHashedType
33
34
35
36
37
38
39
40 type key
41
42
43
44
45 type 'a t
46
47
48
49
50
51 val create : ?random:bool -> int -> 'a t
52
53
54
55
56 val clear : 'a t -> unit
57
58
59
60
61 val reset : 'a t -> unit
62
63
64
65
66 val copy : 'a t -> 'a t
67
68
69
70
71 val add : 'a t -> key -> 'a -> unit
72
73
74
75
76 val remove : 'a t -> key -> unit
77
78
79
80
81 val find : 'a t -> key -> 'a
82
83
84
85
86 val find_opt : 'a t -> key -> 'a option
87
88
89
90
91 val find_all : 'a t -> key -> 'a list
92
93
94
95
96 val replace : 'a t -> key -> 'a -> unit
97
98
99
100
101 val mem : 'a t -> key -> bool
102
103
104
105
106 val length : 'a t -> int
107
108
109
110
111 val stats : 'a t -> Hashtbl.statistics
112
113
114
115
116 val add_seq : 'a t -> (key * 'a) Seq.t -> unit
117
118
119
120
121 val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
122
123
124
125
126 val of_seq : (key * 'a) Seq.t -> 'a t
127
128
129
130
131 val clean : 'a t -> unit
132
133 remove all dead bindings. Done automatically during automatic resizing.
134
135
136
137 val stats_alive : 'a t -> Hashtbl.statistics
138
139 same as Hashtbl.SeededS.stats but only count the alive bindings
140
141
142
143
144
145OCamldoc 2023-07-20 Ephemeron.K2.MakeSeeded(3)