package zelus

  1. Overview
  2. Docs

The data-structure to represent a state

type 'a t =
  1. | Empty
  2. | Cons of 'a * 'a t
  3. | Par of 'a t * 'a t
  4. | Seq of 'a t * 'a t
val singleton : 'a -> 'a t
val cons : 'a -> 'a t -> 'a t
val seq : 'a t -> 'a t -> 'a t
val par : 'a t -> 'a t -> 'a t
val empty : 'a t
val is_empty : 'a t -> bool
val fold : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val list : 'a list -> 'a t -> 'a list
val cons_list : 'a list -> 'a t -> 'a t
val map : ('a -> 'b) -> 'a t -> 'b t
val iter : ('a -> 'b) -> 'a t -> unit
val partition : ('a -> bool) -> 'a t -> 'a t * 'a t
val fprint_t : (Stdlib.Format.formatter -> 'a -> unit) -> Stdlib.Format.formatter -> 'a t -> unit
OCaml

Innovation. Community. Security.