Simple implementation of functional queues
val empty : 'a t
val is_empty : 'a t ‑> bool
Same as pop, but fails on empty queues.
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 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