`Miou_queue`

Raised when `dequeue`

is applied to an empty queue.

`val create : unit -> 'a t`

Return a new queue, initially empty.

`val enqueue : 'a t -> 'a -> unit`

`enqueue q x`

adds the element `x`

at the end of the queue `q`

.

`val dequeue : 'a t -> 'a`

`dequeue q`

removes and returns the first element in queue `q`

, or raises `Empty`

if the queue is empty.

`val is_empty : 'a t -> bool`

Return `true`

if the given queue is empty, `false`

otherwise.

`val iter : f:('a -> unit) -> 'a t -> unit`

`iter ~f q`

applies `f`

in turn to all elements of `q`

, from the least recently entered to the most recently entered. The queue itself is unchanged.

`val drop : f:('a -> unit) -> 'a t -> unit`

`drop ~f q`

applies `f`

in turn to all elements of `q`

**and** discard all elements of `q`

.

`val length : 'a t -> int`

Return the number of elements in a queue.

`val to_list : 'a t -> 'a list`

`to_list q`

returns a list of `q`

's elements.