(***********************************************************************)
(*
- Time-stamp: <Last modified on 2013-03-04 23:03:05 CET by Kim Nguyen>
+ Time-stamp: <Last modified on 2013-03-09 17:53:53 CET by Kim Nguyen>
*)
(** Implementation of sets of Qualified Names that can be finite
include FiniteCofinite.S with type elt = QName.t
include Common_sig.Printable with type t := t
+val star : t
+val text : t
+val node : t
module Weak :
sig
include FiniteCofinite.S with type elt = QName.t
include Common_sig.Printable with type t := t
+ val star : t
+ val text : t
+ val node : t
end