blob: 2041b2ec20070900acda1bf80fed9f12b13caf59 (
plain)
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
|
(************************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * INRIA - CNRS - LIX - LRI - PPS - Copyright 1999-2012 *)
(* \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 equal : t -> t -> bool
end
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. *)
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
end
|
