CCSimple_queue
Functional queues (fifo)
Simple implementation of functional queues
type 'a printer = Stdlib.Format.formatter -> 'a -> unit
val empty : 'a t
val is_empty : 'a t -> bool
val peek : 'a t -> 'a option
First 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 ... end
val length : 'a t -> int
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 of_list : 'a list -> '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.