Simple implementation of functional queues
type 'a iter = ( 'a -> unit ) -> unit
type 'a printer = Stdlib.Format.formatter -> 'a -> unit
type 'a gen = unit -> 'a option
Queue containing elements of type 'a
val is_empty : 'a t -> bool
val push : 'a -> 'a t -> 'a t
Push element at the end of the queue.
val snoc : 'a t -> 'a -> 'a t
val peek : 'a t -> 'a option
First element of the queue.
val peek_exn : 'a t -> 'a
val pop : 'a t -> ('a * 'a t) option
Get and remove the first element.
val pop_exn : 'a t -> 'a * 'a t
Same as pop
, but fails on empty queues.
Remove first element. If the queue is empty, do nothing.
val append : 'a t -> 'a t -> 'a t
Append two queues. Elements from the second one come after elements of the first one. Linear in the size of the second queue.
val map : ( 'a -> 'b ) -> 'a t -> 'b t
Reverse the queue. Constant time.
val equal : ( 'a -> 'a -> bool ) -> 'a t -> 'a t -> bool
module Infix : sig ... end
include module type of Infix
val (>|=) : 'a t -> ( 'a -> 'b ) -> 'b t
val (@) : 'a t -> 'a t -> 'a t
val (<::) : 'a t -> 'a -> 'a t
Number of elements in the queue (linear in time).
val fold : ( 'b -> 'a -> 'b ) -> 'b -> 'a t -> 'b
val iter : ( 'a -> unit ) -> 'a t -> unit
val to_list : 'a t -> 'a list
val add_list : 'a t -> 'a list -> 'a t
val of_list : 'a list -> 'a t
val to_iter : 'a t -> 'a iter
val add_iter : 'a t -> 'a iter -> 'a t
val of_iter : 'a iter -> 'a t
val to_seq : 'a t -> 'a Stdlib.Seq.t
Renamed from to_std_seq
since 3.0.
val add_seq : 'a t -> 'a Stdlib.Seq.t -> 'a t
Renamed from add_std_seq
since 3.0.
val of_seq : 'a Stdlib.Seq.t -> 'a t
Renamed from of_std_seq
since 3.0.
val of_gen : 'a gen -> 'a t
val add_gen : 'a t -> 'a gen -> 'a t
val to_gen : 'a t -> 'a gen
IO