X-Git-Url: http://git.nguyen.vg/gitweb/?a=blobdiff_plain;f=ptset.mli;fp=ptset.mli;h=0000000000000000000000000000000000000000;hb=4b52da1a20a4fe031930bb96d2ca46bec06dc529;hp=27b63325d2b885621cf4a8d78f59272c76c0e693;hpb=a223af3254fb51c279cfbccdc18c59484fdca74e;p=SXSI%2Fxpathcomp.git

diff --git a/ptset.mli b/ptset.mli
deleted file mode 100644
index 27b6332..0000000
--- a/ptset.mli
+++ /dev/null
@@ -1,91 +0,0 @@
-(**************************************************************************)
-(*                                                                        *)
-(*  Copyright (C) Jean-Christophe Filliatre                               *)
-(*                                                                        *)
-(*  This software is free software; you can redistribute it and/or        *)
-(*  modify it under the terms of the GNU Library General Public           *)
-(*  License version 2.1, with the special exception on linking            *)
-(*  described in file LICENSE.                                            *)
-(*                                                                        *)
-(*  This software is distributed in the hope that it will be useful,      *)
-(*  but WITHOUT ANY WARRANTY; without even the implied warranty of        *)
-(*  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.                  *)
-(*                                                                        *)
-(**************************************************************************)
-
-(*i $Id: ptset.mli,v 1.10 2008-07-21 14:53:06 filliatr Exp $ i*)
-
-(*s Sets of integers implemented as Patricia trees.  The following
-    signature is exactly [Set.S with type elt = int], with the same
-    specifications. This is a purely functional data-structure. The
-    performances are similar to those of the standard library's module
-    [Set]. The representation is unique and thus structural comparison
-    can be performed on Patricia trees. *)
-
-module type S = 
-sig
-
-  type elt
-
-  type 'a node
-  module rec Node : sig
-    include  Hcons.S with type data = Data.t
-  end
-  and Data : sig 
-    include 
-      Hashtbl.HashedType with type t = Node.t node
-  end
-  type data = Data.t
-  type t = Node.t
-
-  val empty : t
-  val is_empty : t -> bool
-  val mem : elt -> t -> bool
-  val add : elt -> t -> t
-  val singleton : elt -> t
-  val remove : elt -> t -> t
-  val union : t -> t -> t
-  val inter : t -> t -> t
-  val diff : t -> t -> t
-  val compare : t -> t -> int
-  val equal : t -> t -> bool
-  val subset : t -> t -> bool
-  val iter : (elt -> unit) -> t -> unit
-  val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
-  val for_all : (elt -> bool) -> t -> bool
-  val exists : (elt -> bool) -> t -> bool
-  val filter : (elt -> bool) -> t -> t
-  val partition : (elt -> bool) -> t -> t * t
-  val cardinal : t -> int
-  val elements : t -> elt list
-  val min_elt : t -> elt
-  val max_elt : t -> elt
-  val choose : t -> elt
-  val split : elt -> t -> t * bool * t
-    (*s Additional functions not appearing in the signature [Set.S] from ocaml
-      standard library. *)
-    
-  (* [intersect u v] determines if sets [u] and [v] have a non-empty 
-     intersection. *) 
-    
-val intersect : t -> t -> bool
-
-val is_singleton : t -> bool
-val mem_union : t -> t -> t
-val hash : t -> int
-val uid : t -> Uid.t
-val uncons : t -> elt * t
-val from_list : elt list -> t 
-val make : data -> t
-val node : t -> data
-
-val with_id : Uid.t -> t
-end
-
-
-module Int : sig 
-  include S with type elt = int
-  val print : Format.formatter -> t -> unit
-end
-
-module Make ( H : Hcons.SA ) : S with type elt = H.t