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
|
(************************************************************************)
(* * The Coq Proof Assistant / The Coq Development Team *)
(* v * Copyright INRIA, CNRS and contributors *)
(* <O___,, * (see version control and CREDITS file for authors & dates) *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(* * (see LICENSE file for the text of the license) *)
(************************************************************************)
module type OrderedType =
sig
type t
val compare : t -> t -> int
end
module type S = Set.S
module Make(M : OrderedType) : S
with type elt = M.t
and type t = Set.Make(M).t
module type HashedType =
sig
type t
val hash : t -> int
end
module Hashcons (M : OrderedType) (_ : HashedType with type t = M.t) : Hashcons.S with
type t = Set.Make(M).t
and type u = M.t -> M.t
(** Create hash-consing for sets. The hashing function provided must be
compatible with the comparison function. *)
|
