(*
 * Finite sets over an ordered type.
 *
 * ----------------------------------------------------------------
 *
 * @begin[license]
 * Copyright (C) 2000 Jason Hickey, Caltech
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program 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.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 *
 * Author: Jason Hickey
 * @email{jyh@cs.caltech.edu}
 * @end[license]
 *)

(*
 * Signature for the module that defines
 * the elements in the set.  The elements
 * are totally ordered by the compare function.
 *)
module type EltSig =
sig
   type elt
   val compare : elt -> elt -> int
end

(*
 * Finite sets, and operations on those sets.
 *)
module type SetSig =
sig
   type t
   type elt

   val empty : t
   val mem : elt -> t -> bool
   val insert : elt -> t -> t
   val delete : elt -> t -> t
end

(*
 * Make a set.
 *)
module Make (Ord : EltSig)
: SetSig with type elt = Ord.elt

(*!
 * @docoff
 *
 * -*-
 * Local Variables:
 * Caml-master: "compile"
 * End:
 * -*-
 *)