stdcompat__ephemeron_s.ml1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381module type S = sig module type S = sig type key type !'a t (* type 'a t *) val create : int -> 'a t val clear : 'a t -> unit val reset : 'a t -> unit val copy : 'a t -> 'a t val add : 'a t -> key -> 'a -> unit val remove : 'a t -> key -> unit val find : 'a t -> key -> 'a val find_opt : 'a t -> key -> 'a option val find_all : 'a t -> key -> 'a list val replace : 'a t -> key -> 'a -> unit val mem : 'a t -> key -> bool val iter : (key -> 'a -> unit) -> 'a t -> unit val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b val length : 'a t -> int val stats : 'a t -> Hashtbl.statistics val to_seq : 'a t -> (key * 'a) Seq.t val to_seq_keys : 'a t -> key Seq.t val to_seq_values : 'a t -> 'a Seq.t val add_seq : 'a t -> (key * 'a) Seq.t -> unit val replace_seq : 'a t -> (key * 'a) Seq.t -> unit val of_seq : (key * 'a) Seq.t -> 'a t val clean : 'a t -> unit val stats_alive : 'a t -> Hashtbl.statistics end (* module type S = sig type key type 'a t val create : int -> 'a t val clear : 'a t -> unit val reset : 'a t -> unit val copy : 'a t -> 'a t val add : 'a t -> key -> 'a -> unit val remove : 'a t -> key -> unit val find : 'a t -> key -> 'a val find_opt : 'a t -> key -> 'a option val find_all : 'a t -> key -> 'a list val replace : 'a t -> key -> 'a -> unit val mem : 'a t -> key -> bool val iter : (key -> 'a -> unit) -> 'a t -> unit val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b val length : 'a t -> int val stats : 'a t -> Stdcompat__hashtbl_ext.statistics val to_seq : 'a t -> (key * 'a) Stdcompat__seq.t val to_seq_keys : 'a t -> key Stdcompat__seq.t val to_seq_values : 'a t -> 'a Stdcompat__seq.t val add_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val replace_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val of_seq : (key * 'a) Stdcompat__seq.t -> 'a t val clean : 'a t -> unit val stats_alive : 'a t -> Stdcompat__hashtbl_ext.statistics end *) (** @since 4.07.0: module type S = sig type key type !'a t val create : int -> 'a t val clear : 'a t -> unit val reset : 'a t -> unit val copy : 'a t -> 'a t val add : 'a t -> key -> 'a -> unit val remove : 'a t -> key -> unit val find : 'a t -> key -> 'a val find_opt : 'a t -> key -> 'a option val find_all : 'a t -> key -> 'a list val replace : 'a t -> key -> 'a -> unit val mem : 'a t -> key -> bool val iter : (key -> 'a -> unit) -> 'a t -> unit val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b val length : 'a t -> int val stats : 'a t -> Hashtbl.statistics val to_seq : 'a t -> (key * 'a) Seq.t val to_seq_keys : 'a t -> key Seq.t val to_seq_values : 'a t -> 'a Seq.t val add_seq : 'a t -> (key * 'a) Seq.t -> unit val replace_seq : 'a t -> (key * 'a) Seq.t -> unit val of_seq : (key * 'a) Seq.t -> 'a t val clean : 'a t -> unit val stats_alive : 'a t -> Hashtbl.statistics end *) module type SeededS = sig type key type !'a t (* type 'a t *) val create : ?random:bool -> int -> 'a t val clear : 'a t -> unit val reset : 'a t -> unit val copy : 'a t -> 'a t val add : 'a t -> key -> 'a -> unit val remove : 'a t -> key -> unit val find : 'a t -> key -> 'a val find_opt : 'a t -> key -> 'a option val find_all : 'a t -> key -> 'a list val replace : 'a t -> key -> 'a -> unit val mem : 'a t -> key -> bool val iter : (key -> 'a -> unit) -> 'a t -> unit val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b val length : 'a t -> int val stats : 'a t -> Hashtbl.statistics val to_seq : 'a t -> (key * 'a) Seq.t val to_seq_keys : 'a t -> key Seq.t val to_seq_values : 'a t -> 'a Seq.t val add_seq : 'a t -> (key * 'a) Seq.t -> unit val replace_seq : 'a t -> (key * 'a) Seq.t -> unit val of_seq : (key * 'a) Seq.t -> 'a t val clean : 'a t -> unit val stats_alive : 'a t -> Hashtbl.statistics end (* module type SeededS = sig type key type 'a t val create : ?random:bool -> int -> 'a t val clear : 'a t -> unit val reset : 'a t -> unit val copy : 'a t -> 'a t val add : 'a t -> key -> 'a -> unit val remove : 'a t -> key -> unit val find : 'a t -> key -> 'a val find_opt : 'a t -> key -> 'a option val find_all : 'a t -> key -> 'a list val replace : 'a t -> key -> 'a -> unit val mem : 'a t -> key -> bool val iter : (key -> 'a -> unit) -> 'a t -> unit val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b val length : 'a t -> int val stats : 'a t -> Stdcompat__hashtbl_ext.statistics val to_seq : 'a t -> (key * 'a) Stdcompat__seq.t val to_seq_keys : 'a t -> key Stdcompat__seq.t val to_seq_values : 'a t -> 'a Stdcompat__seq.t val add_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val replace_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val of_seq : (key * 'a) Stdcompat__seq.t -> 'a t val clean : 'a t -> unit val stats_alive : 'a t -> Stdcompat__hashtbl_ext.statistics end *) (** @since 4.07.0: module type SeededS = sig type key type !'a t val create : ?random:bool -> int -> 'a t val clear : 'a t -> unit val reset : 'a t -> unit val copy : 'a t -> 'a t val add : 'a t -> key -> 'a -> unit val remove : 'a t -> key -> unit val find : 'a t -> key -> 'a val find_opt : 'a t -> key -> 'a option val find_all : 'a t -> key -> 'a list val replace : 'a t -> key -> 'a -> unit val mem : 'a t -> key -> bool val iter : (key -> 'a -> unit) -> 'a t -> unit val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b val length : 'a t -> int val stats : 'a t -> Hashtbl.statistics val to_seq : 'a t -> (key * 'a) Seq.t val to_seq_keys : 'a t -> key Seq.t val to_seq_values : 'a t -> 'a Seq.t val add_seq : 'a t -> (key * 'a) Seq.t -> unit val replace_seq : 'a t -> (key * 'a) Seq.t -> unit val of_seq : (key * 'a) Seq.t -> 'a t val clean : 'a t -> unit val stats_alive : 'a t -> Hashtbl.statistics end *) module K1 = Ephemeron.K1 (* module K1 : sig type ('k, 'd) t val create : unit -> ('k, 'd) t val get_key : ('k, 'd) t -> 'k option val get_key_copy : ('k, 'd) t -> 'k option val set_key : ('k, 'd) t -> 'k -> unit val unset_key : ('k, 'd) t -> unit val check_key : ('k, 'd) t -> bool val blit_key : ('k, 'a) t -> ('k, 'b) t -> unit val get_data : ('k, 'd) t -> 'd option val get_data_copy : ('k, 'd) t -> 'd option val set_data : ('k, 'd) t -> 'd -> unit val unset_data : ('k, 'd) t -> unit val check_data : ('k, 'd) t -> bool val blit_data : ('a, 'd) t -> ('b, 'd) t -> unit module Make : functor (H : Hashtbl.HashedType) -> sig type key = H.t type 'a t val create : int -> 'a t val clear : 'a t -> unit val reset : 'a t -> unit val copy : 'a t -> 'a t val add : 'a t -> key -> 'a -> unit val remove : 'a t -> key -> unit val find : 'a t -> key -> 'a val find_opt : 'a t -> key -> 'a option val find_all : 'a t -> key -> 'a list val replace : 'a t -> key -> 'a -> unit val mem : 'a t -> key -> bool val iter : (key -> 'a -> unit) -> 'a t -> unit val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b val length : 'a t -> int val stats : 'a t -> Stdcompat__hashtbl_ext.statistics val to_seq : 'a t -> (key * 'a) Stdcompat__seq.t val to_seq_keys : 'a t -> key Stdcompat__seq.t val to_seq_values : 'a t -> 'a Stdcompat__seq.t val add_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val replace_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val of_seq : (key * 'a) Stdcompat__seq.t -> 'a t val clean : 'a t -> unit val stats_alive : 'a t -> Stdcompat__hashtbl_ext.statistics end module MakeSeeded : functor (H : Stdcompat__hashtbl.SeededHashedType) -> sig type key = H.t type 'a t val create : ?random:bool -> int -> 'a t val clear : 'a t -> unit val reset : 'a t -> unit val copy : 'a t -> 'a t val add : 'a t -> key -> 'a -> unit val remove : 'a t -> key -> unit val find : 'a t -> key -> 'a val find_opt : 'a t -> key -> 'a option val find_all : 'a t -> key -> 'a list val replace : 'a t -> key -> 'a -> unit val mem : 'a t -> key -> bool val iter : (key -> 'a -> unit) -> 'a t -> unit val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b val length : 'a t -> int val stats : 'a t -> Stdcompat__hashtbl_ext.statistics val to_seq : 'a t -> (key * 'a) Stdcompat__seq.t val to_seq_keys : 'a t -> key Stdcompat__seq.t val to_seq_values : 'a t -> 'a Stdcompat__seq.t val add_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val replace_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val of_seq : (key * 'a) Stdcompat__seq.t -> 'a t val clean : 'a t -> unit val stats_alive : 'a t -> Stdcompat__hashtbl_ext.statistics end end *) (** @since 4.07.0: module K1 = Ephemeron.K1 *) module K2 = Ephemeron.K2 (* module K2 : sig type ('k1, 'k2, 'd) t val create : unit -> ('k1, 'k2, 'd) t val get_key1 : ('k1, 'k2, 'd) t -> 'k1 option val get_key1_copy : ('k1, 'k2, 'd) t -> 'k1 option val set_key1 : ('k1, 'k2, 'd) t -> 'k1 -> unit val unset_key1 : ('k1, 'k2, 'd) t -> unit val check_key1 : ('k1, 'k2, 'd) t -> bool val get_key2 : ('k1, 'k2, 'd) t -> 'k2 option val get_key2_copy : ('k1, 'k2, 'd) t -> 'k2 option val set_key2 : ('k1, 'k2, 'd) t -> 'k2 -> unit val unset_key2 : ('k1, 'k2, 'd) t -> unit val check_key2 : ('k1, 'k2, 'd) t -> bool val blit_key1 : ('k1, 'a, 'b) t -> ('k1, 'c, 'd) t -> unit val blit_key2 : ('a, 'k2, 'b) t -> ('c, 'k2, 'd) t -> unit val blit_key12 : ('k1, 'k2, 'a) t -> ('k1, 'k2, 'b) t -> unit val get_data : ('k1, 'k2, 'd) t -> 'd option val get_data_copy : ('k1, 'k2, 'd) t -> 'd option val set_data : ('k1, 'k2, 'd) t -> 'd -> unit val unset_data : ('k1, 'k2, 'd) t -> unit val check_data : ('k1, 'k2, 'd) t -> bool val blit_data : ('k1, 'k2, 'd) t -> ('k1, 'k2, 'd) t -> unit module Make : functor (H1 : Hashtbl.HashedType) -> functor (H2 : Hashtbl.HashedType) -> sig type key = (H1.t * H2.t) type 'a t val create : int -> 'a t val clear : 'a t -> unit val reset : 'a t -> unit val copy : 'a t -> 'a t val add : 'a t -> key -> 'a -> unit val remove : 'a t -> key -> unit val find : 'a t -> key -> 'a val find_opt : 'a t -> key -> 'a option val find_all : 'a t -> key -> 'a list val replace : 'a t -> key -> 'a -> unit val mem : 'a t -> key -> bool val iter : (key -> 'a -> unit) -> 'a t -> unit val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b val length : 'a t -> int val stats : 'a t -> Stdcompat__hashtbl_ext.statistics val to_seq : 'a t -> (key * 'a) Stdcompat__seq.t val to_seq_keys : 'a t -> key Stdcompat__seq.t val to_seq_values : 'a t -> 'a Stdcompat__seq.t val add_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val replace_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val of_seq : (key * 'a) Stdcompat__seq.t -> 'a t val clean : 'a t -> unit val stats_alive : 'a t -> Stdcompat__hashtbl_ext.statistics end module MakeSeeded : functor (H1 : Stdcompat__hashtbl.SeededHashedType) -> functor (H2 : Stdcompat__hashtbl.SeededHashedType) -> sig type key = (H1.t * H2.t) type 'a t val create : ?random:bool -> int -> 'a t val clear : 'a t -> unit val reset : 'a t -> unit val copy : 'a t -> 'a t val add : 'a t -> key -> 'a -> unit val remove : 'a t -> key -> unit val find : 'a t -> key -> 'a val find_opt : 'a t -> key -> 'a option val find_all : 'a t -> key -> 'a list val replace : 'a t -> key -> 'a -> unit val mem : 'a t -> key -> bool val iter : (key -> 'a -> unit) -> 'a t -> unit val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b val length : 'a t -> int val stats : 'a t -> Stdcompat__hashtbl_ext.statistics val to_seq : 'a t -> (key * 'a) Stdcompat__seq.t val to_seq_keys : 'a t -> key Stdcompat__seq.t val to_seq_values : 'a t -> 'a Stdcompat__seq.t val add_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val replace_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val of_seq : (key * 'a) Stdcompat__seq.t -> 'a t val clean : 'a t -> unit val stats_alive : 'a t -> Stdcompat__hashtbl_ext.statistics end end *) (** @since 4.07.0: module K2 = Ephemeron.K2 *) module Kn = Ephemeron.Kn (* module Kn : sig type ('k, 'd) t val create : int -> ('k, 'd) t val get_key : ('k, 'd) t -> int -> 'k option val get_key_copy : ('k, 'd) t -> int -> 'k option val set_key : ('k, 'd) t -> int -> 'k -> unit val unset_key : ('k, 'd) t -> int -> unit val check_key : ('k, 'd) t -> int -> bool val blit_key : ('k, 'a) t -> int -> ('k, 'b) t -> int -> int -> unit val get_data : ('k, 'd) t -> 'd option val get_data_copy : ('k, 'd) t -> 'd option val set_data : ('k, 'd) t -> 'd -> unit val unset_data : ('k, 'd) t -> unit val check_data : ('k, 'd) t -> bool val blit_data : ('k, 'd) t -> ('k, 'd) t -> unit module Make : functor (H : Hashtbl.HashedType) -> sig type key = H.t array type 'a t val create : int -> 'a t val clear : 'a t -> unit val reset : 'a t -> unit val copy : 'a t -> 'a t val add : 'a t -> key -> 'a -> unit val remove : 'a t -> key -> unit val find : 'a t -> key -> 'a val find_opt : 'a t -> key -> 'a option val find_all : 'a t -> key -> 'a list val replace : 'a t -> key -> 'a -> unit val mem : 'a t -> key -> bool val iter : (key -> 'a -> unit) -> 'a t -> unit val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b val length : 'a t -> int val stats : 'a t -> Stdcompat__hashtbl_ext.statistics val to_seq : 'a t -> (key * 'a) Stdcompat__seq.t val to_seq_keys : 'a t -> key Stdcompat__seq.t val to_seq_values : 'a t -> 'a Stdcompat__seq.t val add_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val replace_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val of_seq : (key * 'a) Stdcompat__seq.t -> 'a t val clean : 'a t -> unit val stats_alive : 'a t -> Stdcompat__hashtbl_ext.statistics end module MakeSeeded : functor (H : Stdcompat__hashtbl.SeededHashedType) -> sig type key = H.t array type 'a t val create : ?random:bool -> int -> 'a t val clear : 'a t -> unit val reset : 'a t -> unit val copy : 'a t -> 'a t val add : 'a t -> key -> 'a -> unit val remove : 'a t -> key -> unit val find : 'a t -> key -> 'a val find_opt : 'a t -> key -> 'a option val find_all : 'a t -> key -> 'a list val replace : 'a t -> key -> 'a -> unit val mem : 'a t -> key -> bool val iter : (key -> 'a -> unit) -> 'a t -> unit val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b val length : 'a t -> int val stats : 'a t -> Stdcompat__hashtbl_ext.statistics val to_seq : 'a t -> (key * 'a) Stdcompat__seq.t val to_seq_keys : 'a t -> key Stdcompat__seq.t val to_seq_values : 'a t -> 'a Stdcompat__seq.t val add_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val replace_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val of_seq : (key * 'a) Stdcompat__seq.t -> 'a t val clean : 'a t -> unit val stats_alive : 'a t -> Stdcompat__hashtbl_ext.statistics end end *) (** @since 4.07.0: module Kn = Ephemeron.Kn *) module GenHashTable = Ephemeron.GenHashTable (* module GenHashTable : sig type equal = | ETrue | EFalse | EDead module MakeSeeded : functor (H : sig type t type 'a container val hash : int -> t -> int val equal : 'a container -> t -> equal val create : t -> 'a -> 'a container val get_key : 'a container -> t option val get_data : 'a container -> 'a option val set_key_data : 'a container -> t -> 'a -> unit val check_key : 'a container -> bool end) -> sig type key = H.t type 'a t val create : ?random:bool -> int -> 'a t val clear : 'a t -> unit val reset : 'a t -> unit val copy : 'a t -> 'a t val add : 'a t -> key -> 'a -> unit val remove : 'a t -> key -> unit val find : 'a t -> key -> 'a val find_opt : 'a t -> key -> 'a option val find_all : 'a t -> key -> 'a list val replace : 'a t -> key -> 'a -> unit val mem : 'a t -> key -> bool val iter : (key -> 'a -> unit) -> 'a t -> unit val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b val length : 'a t -> int val stats : 'a t -> Stdcompat__hashtbl_ext.statistics val to_seq : 'a t -> (key * 'a) Stdcompat__seq.t val to_seq_keys : 'a t -> key Stdcompat__seq.t val to_seq_values : 'a t -> 'a Stdcompat__seq.t val add_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val replace_seq : 'a t -> (key * 'a) Stdcompat__seq.t -> unit val of_seq : (key * 'a) Stdcompat__seq.t -> 'a t val clean : 'a t -> unit val stats_alive : 'a t -> Stdcompat__hashtbl_ext.statistics end end *) (** @since 4.07.0: module GenHashTable = Ephemeron.GenHashTable *) end