summaryrefslogtreecommitdiff
path: root/lib/hashset.mli
diff options
context:
space:
mode:
authorGravatar Benjamin Barenblat <bbaren@debian.org>2018-12-29 14:31:27 -0500
committerGravatar Benjamin Barenblat <bbaren@debian.org>2018-12-29 14:31:27 -0500
commit9043add656177eeac1491a73d2f3ab92bec0013c (patch)
tree2b0092c84bfbf718eca10c81f60b2640dc8cab05 /lib/hashset.mli
parenta4c7f8bd98be2a200489325ff7c5061cf80ab4f3 (diff)
Imported Upstream version 8.8.2upstream/8.8.2
Diffstat (limited to 'lib/hashset.mli')
-rw-r--r--lib/hashset.mli56
1 files changed, 0 insertions, 56 deletions
diff --git a/lib/hashset.mli b/lib/hashset.mli
deleted file mode 100644
index 733c8962..00000000
--- a/lib/hashset.mli
+++ /dev/null
@@ -1,56 +0,0 @@
-(************************************************************************)
-(* v * The Coq Proof Assistant / The Coq Development Team *)
-(* <O___,, * INRIA - CNRS - LIX - LRI - PPS - Copyright 1999-2016 *)
-(* \VV/ **************************************************************)
-(* // * This file is distributed under the terms of the *)
-(* * GNU Lesser General Public License Version 2.1 *)
-(************************************************************************)
-
-(** Adapted from Damien Doligez, projet Para, INRIA Rocquencourt,
- OCaml stdlib. *)
-
-(** The following functor is a specialized version of [Weak.Make].
- Here, the responsibility of computing the hash function is now
- given to the caller, which makes possible the interleaving of the
- hash key computation and the hash-consing. *)
-
-module type EqType = sig
- type t
- val eq : t -> t -> bool
-end
-
-type statistics = {
- num_bindings: int;
- num_buckets: int;
- max_bucket_length: int;
- bucket_histogram: int array
-}
-
-module type S = sig
- type elt
- (** Type of hashsets elements. *)
- type t
- (** Type of hashsets. *)
- val create : int -> t
- (** [create n] creates a fresh hashset with initial size [n]. *)
- val clear : t -> unit
- (** Clear the contents of a hashset. *)
- val repr : int -> elt -> t -> elt
- (** [repr key constr set] uses [key] to look for [constr]
- in the hashet [set]. If [constr] is in [set], returns the
- specific representation that is stored in [set]. Otherwise,
- [constr] is stored in [set] and will be used as the canonical
- representation of this value in the future. *)
- val stats : t -> statistics
- (** Recover statistics on the table. *)
-end
-
-module Make (E : EqType) : S with type elt = E.t
-
-module Combine : sig
- val combine : int -> int -> int
- val combinesmall : int -> int -> int
- val combine3 : int -> int -> int -> int
- val combine4 : int -> int -> int -> int -> int
- val combine5 : int -> int -> int -> int -> int -> int
-end