1 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 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562
|
@BEGIN_FROM_4_07_0@
include Ephemeron
@END_FROM_4_07_0@
@BEGIN_BEFORE_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 -> Stdcompat__hashtbl.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.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.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.statistics
end
@BEGIN_FROM_4_04_0@
module K1 = struct
type ('k, 'd) t = ('k, 'd) Ephemeron.K1.t
let create = Ephemeron.K1.create
let get_key = Ephemeron.K1.get_key
let get_key_copy = Ephemeron.K1.get_key_copy
let set_key = Ephemeron.K1.set_key
let unset_key = Ephemeron.K1.unset_key
let check_key = Ephemeron.K1.check_key
let blit_key = Ephemeron.K1.blit_key
let get_data = Ephemeron.K1.get_data
let get_data_copy = Ephemeron.K1.get_data_copy
let set_data = Ephemeron.K1.set_data
let unset_data = Ephemeron.K1.unset_data
let check_data = Ephemeron.K1.check_data
let blit_data = Ephemeron.K1.blit_data
module Make (H : Hashtbl.HashedType) = struct
include Ephemeron.K1.Make (H)
@BEGIN_BEFORE_4_07_0@
@BEGIN_WITH_MAGIC@
let to_seq = Stdcompat__hashtbl_ext.to_seq
let to_seq_keys = Stdcompat__hashtbl_ext.to_seq_keys
let to_seq_values = Stdcompat__hashtbl_ext.to_seq_values
@END_WITH_MAGIC@
@BEGIN_WITHOUT_MAGIC@
let to_seq tbl = Stdcompat__hashtbl_ext.to_seq fold tbl
let to_seq_keys tbl = Stdcompat__hashtbl_ext.to_seq_keys fold tbl
let to_seq_values tbl = Stdcompat__hashtbl_ext.to_seq_values fold tbl
@END_WITHOUT_MAGIC@
let add_seq tbl g = Stdcompat__hashtbl_ext.add_seq add tbl g
let replace_seq tbl g = Stdcompat__hashtbl_ext.add_seq replace tbl g
let of_seq g = Stdcompat__hashtbl_ext.of_seq ~create ~replace g
@END_BEFORE_4_07_0@
@BEGIN_BEFORE_4_05_0@
let find_opt tbl key =
Stdcompat__tools.option_find (find tbl) key
@END_BEFORE_4_05_0@
end
module MakeSeeded (H : Hashtbl.SeededHashedType) = struct
include Ephemeron.K1.MakeSeeded (H)
@BEGIN_BEFORE_4_07_0@
@BEGIN_WITH_MAGIC@
let to_seq = Stdcompat__hashtbl_ext.to_seq
let to_seq_keys = Stdcompat__hashtbl_ext.to_seq_keys
let to_seq_values = Stdcompat__hashtbl_ext.to_seq_values
@END_WITH_MAGIC@
@BEGIN_WITHOUT_MAGIC@
let to_seq tbl = Stdcompat__hashtbl_ext.to_seq fold tbl
let to_seq_keys tbl = Stdcompat__hashtbl_ext.to_seq_keys fold tbl
let to_seq_values tbl = Stdcompat__hashtbl_ext.to_seq_values fold tbl
@END_WITHOUT_MAGIC@
let add_seq tbl g = Stdcompat__hashtbl_ext.add_seq add tbl g
let replace_seq tbl g = Stdcompat__hashtbl_ext.add_seq replace tbl g
let of_seq g = Stdcompat__hashtbl_ext.of_seq ~create ~replace g
@END_BEFORE_4_07_0@
@BEGIN_BEFORE_4_05_0@
let find_opt tbl key =
Stdcompat__tools.option_find (find tbl) key
@END_BEFORE_4_05_0@
end
end
module K2 = struct
type ('k1, 'k2, 'd) t = ('k1, 'k2, 'd) Ephemeron.K2.t
let create = Ephemeron.K2.create
let get_key1 = Ephemeron.K2.get_key1
let get_key1_copy = Ephemeron.K2.get_key1_copy
let set_key1 = Ephemeron.K2.set_key1
let unset_key1 = Ephemeron.K2.unset_key1
let check_key1 = Ephemeron.K2.check_key1
let get_key2 = Ephemeron.K2.get_key2
let get_key2_copy = Ephemeron.K2.get_key2_copy
let set_key2 = Ephemeron.K2.set_key2
let unset_key2 = Ephemeron.K2.unset_key2
let check_key2 = Ephemeron.K2.check_key2
let blit_key1 = Ephemeron.K2.blit_key1
let blit_key2 = Ephemeron.K2.blit_key2
let blit_key12 = Ephemeron.K2.blit_key12
let get_data = Ephemeron.K2.get_data
let get_data_copy = Ephemeron.K2.get_data_copy
let set_data = Ephemeron.K2.set_data
let unset_data = Ephemeron.K2.unset_data
let check_data = Ephemeron.K2.check_data
let blit_data = Ephemeron.K2.blit_data
module Make (H1 : Hashtbl.HashedType) (H2 : Hashtbl.HashedType) = struct
include Ephemeron.K2.Make (H1) (H2)
@BEGIN_BEFORE_4_07_0@
@BEGIN_WITH_MAGIC@
let to_seq = Stdcompat__hashtbl_ext.to_seq
let to_seq_keys = Stdcompat__hashtbl_ext.to_seq_keys
let to_seq_values = Stdcompat__hashtbl_ext.to_seq_values
@END_WITH_MAGIC@
@BEGIN_WITHOUT_MAGIC@
let to_seq tbl = Stdcompat__hashtbl_ext.to_seq fold tbl
let to_seq_keys tbl = Stdcompat__hashtbl_ext.to_seq_keys fold tbl
let to_seq_values tbl = Stdcompat__hashtbl_ext.to_seq_values fold tbl
@END_WITHOUT_MAGIC@
let add_seq tbl g = Stdcompat__hashtbl_ext.add_seq add tbl g
let replace_seq tbl g = Stdcompat__hashtbl_ext.add_seq replace tbl g
let of_seq g = Stdcompat__hashtbl_ext.of_seq ~create ~replace g
@END_BEFORE_4_07_0@
@BEGIN_BEFORE_4_05_0@
let find_opt tbl key =
Stdcompat__tools.option_find (find tbl) key
@END_BEFORE_4_05_0@
end
module MakeSeeded (H1 : Hashtbl.SeededHashedType)
(H2 : Hashtbl.SeededHashedType) = struct
include Ephemeron.K2.MakeSeeded (H1) (H2)
@BEGIN_BEFORE_4_07_0@
@BEGIN_WITH_MAGIC@
let to_seq = Stdcompat__hashtbl_ext.to_seq
let to_seq_keys = Stdcompat__hashtbl_ext.to_seq_keys
let to_seq_values = Stdcompat__hashtbl_ext.to_seq_values
@END_WITH_MAGIC@
@BEGIN_WITHOUT_MAGIC@
let to_seq tbl = Stdcompat__hashtbl_ext.to_seq fold tbl
let to_seq_keys tbl = Stdcompat__hashtbl_ext.to_seq_keys fold tbl
let to_seq_values tbl = Stdcompat__hashtbl_ext.to_seq_values fold tbl
@END_WITHOUT_MAGIC@
let add_seq tbl g = Stdcompat__hashtbl_ext.add_seq add tbl g
let replace_seq tbl g = Stdcompat__hashtbl_ext.add_seq replace tbl g
let of_seq g = Stdcompat__hashtbl_ext.of_seq ~create ~replace g
@END_BEFORE_4_07_0@
@BEGIN_BEFORE_4_05_0@
let find_opt tbl key =
Stdcompat__tools.option_find (find tbl) key
@END_BEFORE_4_05_0@
end
end
module Kn = struct
type ('k, 'd) t = ('k, 'd) Ephemeron.Kn.t
let create = Ephemeron.Kn.create
let get_key = Ephemeron.Kn.get_key
let get_key_copy = Ephemeron.Kn.get_key_copy
let set_key = Ephemeron.Kn.set_key
let unset_key = Ephemeron.Kn.unset_key
let check_key = Ephemeron.Kn.check_key
let blit_key = Ephemeron.Kn.blit_key
let get_data = Ephemeron.Kn.get_data
let get_data_copy = Ephemeron.Kn.get_data_copy
let set_data = Ephemeron.Kn.set_data
let unset_data = Ephemeron.Kn.unset_data
let check_data = Ephemeron.Kn.check_data
let blit_data = Ephemeron.Kn.blit_data
module Make (H : Hashtbl.HashedType) = struct
include Ephemeron.Kn.Make (H)
@BEGIN_BEFORE_4_07_0@
@BEGIN_WITH_MAGIC@
let to_seq = Stdcompat__hashtbl_ext.to_seq
let to_seq_keys = Stdcompat__hashtbl_ext.to_seq_keys
let to_seq_values = Stdcompat__hashtbl_ext.to_seq_values
@END_WITH_MAGIC@
@BEGIN_WITHOUT_MAGIC@
let to_seq tbl = Stdcompat__hashtbl_ext.to_seq fold tbl
let to_seq_keys tbl = Stdcompat__hashtbl_ext.to_seq_keys fold tbl
let to_seq_values tbl = Stdcompat__hashtbl_ext.to_seq_values fold tbl
@END_WITHOUT_MAGIC@
let add_seq tbl g = Stdcompat__hashtbl_ext.add_seq add tbl g
let replace_seq tbl g = Stdcompat__hashtbl_ext.add_seq replace tbl g
let of_seq g = Stdcompat__hashtbl_ext.of_seq ~create ~replace g
@END_BEFORE_4_07_0@
@BEGIN_BEFORE_4_05_0@
let find_opt tbl key =
Stdcompat__tools.option_find (find tbl) key
@END_BEFORE_4_05_0@
end
module MakeSeeded (H : Hashtbl.SeededHashedType) = struct
include Ephemeron.Kn.MakeSeeded (H)
@BEGIN_BEFORE_4_07_0@
@BEGIN_WITH_MAGIC@
let to_seq = Stdcompat__hashtbl_ext.to_seq
let to_seq_keys = Stdcompat__hashtbl_ext.to_seq_keys
let to_seq_values = Stdcompat__hashtbl_ext.to_seq_values
@END_WITH_MAGIC@
@BEGIN_WITHOUT_MAGIC@
let to_seq tbl = Stdcompat__hashtbl_ext.to_seq fold tbl
let to_seq_keys tbl = Stdcompat__hashtbl_ext.to_seq_keys fold tbl
let to_seq_values tbl = Stdcompat__hashtbl_ext.to_seq_values fold tbl
@END_WITHOUT_MAGIC@
let add_seq tbl g = Stdcompat__hashtbl_ext.add_seq add tbl g
let replace_seq tbl g = Stdcompat__hashtbl_ext.add_seq replace tbl g
let of_seq g = Stdcompat__hashtbl_ext.of_seq ~create ~replace g
@END_BEFORE_4_07_0@
@BEGIN_BEFORE_4_05_0@
let find_opt tbl key =
Stdcompat__tools.option_find (find tbl) key
@END_BEFORE_4_05_0@
end
end
module GenHashTable = struct
type equal = Ephemeron.GenHashTable.equal =
| ETrue
| EFalse
| EDead
module MakeSeeded (H :
sig
type t
(** keys *)
type 'a container
(** contains keys and the associated data *)
val hash: int -> t -> int
(** same as {!Hashtbl.SeededHashedType} *)
val equal: 'a container -> t -> equal
(** equality predicate used to compare a key with the one in a
container. Can return [EDead] if the keys in the container are
dead *)
val create: t -> 'a -> 'a container
(** [create key data] creates a container from
some initials keys and one data *)
val get_key: 'a container -> t option
(** [get_key cont] returns the keys if they are all alive *)
val get_data: 'a container -> 'a option
(** [get_data cont] returns the data if it is alive *)
val set_key_data: 'a container -> t -> 'a -> unit
(** [set_key_data cont] modifies the key and data *)
val check_key: 'a container -> bool
(** [check_key cont] checks if all the keys contained in the data
are alive *)
end) = struct
include Ephemeron.GenHashTable.MakeSeeded (H)
@BEGIN_BEFORE_4_07_0@
@BEGIN_WITH_MAGIC@
let to_seq = Stdcompat__hashtbl_ext.to_seq
let to_seq_keys = Stdcompat__hashtbl_ext.to_seq_keys
let to_seq_values = Stdcompat__hashtbl_ext.to_seq_values
@END_WITH_MAGIC@
@BEGIN_WITHOUT_MAGIC@
let to_seq tbl = Stdcompat__hashtbl_ext.to_seq fold tbl
let to_seq_keys tbl = Stdcompat__hashtbl_ext.to_seq_keys fold tbl
let to_seq_values tbl = Stdcompat__hashtbl_ext.to_seq_values fold tbl
@END_WITHOUT_MAGIC@
let add_seq tbl g = Stdcompat__hashtbl_ext.add_seq add tbl g
let replace_seq tbl g = Stdcompat__hashtbl_ext.add_seq replace tbl g
let of_seq g = Stdcompat__hashtbl_ext.of_seq ~create ~replace g
@END_BEFORE_4_07_0@
@BEGIN_BEFORE_4_05_0@
let find_opt tbl key =
Stdcompat__tools.option_find (find tbl) key
@END_BEFORE_4_05_0@
end
end
@END_FROM_4_04_0@
@BEGIN_BEFORE_4_04_0@
let not_implemented () =
failwith "Stdcompat.Ephemeron is not implemented yet. Please fill an issue: https://github.com/thierry-martinez/stdcompat/issues ."
module K1 =struct
type ('k, 'd) t
let create _ = not_implemented ()
let get_key _ = not_implemented ()
let get_key_copy _ = not_implemented ()
let set_key _ = not_implemented ()
let unset_key _ = not_implemented ()
let check_key _ = not_implemented ()
let blit_key _ = not_implemented ()
let get_data _ = not_implemented ()
let get_data_copy _ = not_implemented ()
let set_data _ = not_implemented ()
let unset_data _ = not_implemented ()
let check_data _ = not_implemented ()
let blit_data _ = not_implemented ()
module Make (H : Hashtbl.HashedType) = struct
include Stdcompat__hashtbl.Make (H)
let clean _ = not_implemented ()
let stats_alive _ = not_implemented ()
end
module MakeSeeded (H : Stdcompat__hashtbl.SeededHashedType) = struct
include Stdcompat__hashtbl.MakeSeeded (H)
let clean _ = not_implemented ()
let stats_alive _ = not_implemented ()
end
end
module K2 = struct
type ('k1, 'k2, 'd) t
let create _ = not_implemented ()
let get_key1 _ = not_implemented ()
let get_key1_copy _ = not_implemented ()
let set_key1 _ = not_implemented ()
let unset_key1 _ = not_implemented ()
let check_key1 _ = not_implemented ()
let get_key2 _ = not_implemented ()
let get_key2_copy _ = not_implemented ()
let set_key2 _ = not_implemented ()
let unset_key2 _ = not_implemented ()
let check_key2 _ = not_implemented ()
let blit_key1 _ = not_implemented ()
let blit_key2 _ = not_implemented ()
let blit_key12 _ = not_implemented ()
let get_data _ = not_implemented ()
let get_data_copy _ = not_implemented ()
let set_data _ = not_implemented ()
let unset_data _ = not_implemented ()
let check_data _ = not_implemented ()
let blit_data _ = not_implemented ()
module Make (H1 : Hashtbl.HashedType) (H2 : Hashtbl.HashedType) = struct
include Stdcompat__hashtbl.Make (struct
type t = H1.t * H2.t
let equal (x1, x2) (y1, y2) = H1.equal x1 y1 && H2.equal x2 y2
let hash (x, y) = Hashtbl.hash (H1.hash x, H2.hash y)
end)
let clean _ = not_implemented ()
let stats_alive _ = not_implemented ()
end
module MakeSeeded (H1 : Stdcompat__hashtbl.SeededHashedType)
(H2 : Stdcompat__hashtbl.SeededHashedType) = struct
include Stdcompat__hashtbl.MakeSeeded (struct
type t = H1.t * H2.t
let equal (x1, x2) (y1, y2) = H1.equal x1 y1 && H2.equal x2 y2
let hash seed (x, y) = Hashtbl.hash (H1.hash seed x, H2.hash seed y)
end)
let clean _ = not_implemented ()
let stats_alive _ = not_implemented ()
end
end
module Kn = struct
type ('k, 'd) t
let create _ = not_implemented ()
let get_key _ = not_implemented ()
let get_key_copy _ = not_implemented ()
let set_key _ = not_implemented ()
let unset_key _ = not_implemented ()
let check_key _ = not_implemented ()
let blit_key _ = not_implemented ()
let get_data _ = not_implemented ()
let get_data_copy _ = not_implemented ()
let set_data _ = not_implemented ()
let unset_data _ = not_implemented ()
let check_data _ = not_implemented ()
let blit_data _ = not_implemented ()
module Make (H : Hashtbl.HashedType) = struct
include Stdcompat__hashtbl.Make (struct
type t = H.t array
let equal x y =
let rec check i =
i >= Array.length x ||
H.equal x.(i) y.(i) && check (succ i) in
Array.length x = Array.length y && check 0
let hash x = Hashtbl.hash (Array.map H.hash x)
end)
let clean _ = not_implemented ()
let stats_alive _ = not_implemented ()
end
module MakeSeeded (H : Stdcompat__hashtbl.SeededHashedType) = struct
include Stdcompat__hashtbl.MakeSeeded (struct
type t = H.t array
let equal x y =
let rec check i =
i >= Array.length x ||
H.equal x.(i) y.(i) && check (succ i) in
Array.length x = Array.length y && check 0
let hash seed x = Hashtbl.hash (Array.map (H.hash seed) x)
end)
let clean _ = not_implemented ()
let stats_alive _ = not_implemented ()
end
end
module GenHashTable = struct
type equal =
| ETrue
| EFalse
| EDead
module MakeSeeded (H :
sig
type t
(** keys *)
type 'a container
(** contains keys and the associated data *)
val hash: int -> t -> int
(** same as {!Hashtbl.SeededHashedType} *)
val equal: 'a container -> t -> equal
(** equality predicate used to compare a key with the one in a
container. Can return [EDead] if the keys in the container are
dead *)
val create: t -> 'a -> 'a container
(** [create key data] creates a container from
some initials keys and one data *)
val get_key: 'a container -> t option
(** [get_key cont] returns the keys if they are all alive *)
val get_data: 'a container -> 'a option
(** [get_data cont] returns the data if it is alive *)
val set_key_data: 'a container -> t -> 'a -> unit
(** [set_key_data cont] modifies the key and data *)
val check_key: 'a container -> bool
(** [check_key cont] checks if all the keys contained in the data
are alive *)
end) = struct
include Stdcompat__hashtbl.MakeSeeded (struct
type t = H.t
let equal _ _ = false
let hash = H.hash
end)
let clean _ = not_implemented ()
let stats_alive _ = not_implemented ()
end
end
@END_BEFORE_4_04_0@
@END_BEFORE_4_07_0@
|