CCSimple_queueFunctional queues (fifo)
Simple implementation of functional queues
type 'a printer = Stdlib.Format.formatter -> 'a -> unitval empty : 'a tval is_empty : 'a t -> boolval peek : 'a t -> 'a optionFirst element of the queue.
Append two queues. Elements from the second one come after elements of the first one. Linear in the size of the second queue.
module Infix : sig ... endval length : 'a t -> intNumber of elements in the queue (linear in time).
val fold : ('b -> 'a -> 'b) -> 'b -> 'a t -> 'bval iter : ('a -> unit) -> 'a t -> unitval to_list : 'a t -> 'a listval of_list : 'a list -> 'a tval to_seq : 'a t -> 'a Stdlib.Seq.tRenamed from to_std_seq since 3.0.
val add_seq : 'a t -> 'a Stdlib.Seq.t -> 'a tRenamed from add_std_seq since 3.0.
val of_seq : 'a Stdlib.Seq.t -> 'a tRenamed from of_std_seq since 3.0.