module Make: functor (Sym : Symbol) -> sig end
Functor building an implementation of the alphabet structure
given a totally ordered symbol type.
type t
Type of the alphabet.
type elt
Type of the symbols.
val empty : t
The empty alphabet.
val is_empty : t -> bool
is_empty x
returns true
if x
has 0 elements,
otherwise false
.
val rank : elt -> int
rank x
returns the rank of symbol x
.
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 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 to_string : t -> string
to_string x
returns a string
representation of the
alphabet x
.
val elt_to_string : elt -> string
elt_to_string x
returns a string
representation of
a single symbol x
of the alphabet.
val from_list : elt list -> t
from_list l
returns a new alphabet containing all
symbols that are listed in l
.