Linked_queue is a wrapper around OCaml's standard Queue module that follows Core idioms and adds some functions.
Differences from the standard module:
add, and takes the queue first.
take, takes the queue first, and returns an
option rather than raising
dequeue_exn is available if you want to raise
iter takes a labeled argument.
transfer's arguments are labeled.
Checks whether the provided element is there, using polymorphic compare if
is not provided
fold t ~init ~f returns
f (... f (f (f init e1) e2) e3 ...) en, where
are the elements of
true if and only if there exists an element for which the provided
function evaluates to
true. This is a short-circuiting operation.
true if and only if the provided function evaluates to
true for all
elements. This is a short-circuiting operation.
Returns the number of elements for which the provided function evaluates to true.
Returns as an
option the first element for which
f evaluates to true.
Returns the first evaluation of
f that returns
Some, and returns
None if there
is no such element.
Returns a minimum (resp maximum) element from the collection using the provided
cmp function, or
None if the collection is empty. In case of a tie, the first
element encountered while traversing the collection is returned. The implementation
fold so it has the same complexity as
create () returns an empty queue.
enqueue t x adds
x to the end of
dequeue t returns
t is empty, otherwise it removes and returns the front
peek t returns
t is empty, otherwise it returns
Some x where
the front of
clear t discards all elements from
filter_inplace t ~f removes all elements of
t that don't satisfy
of_list list returns a queue
t with the elements of
list in the same order as
the elements of
list (i.e. the first element of
t is the first element of the
partial_iter t ~f iterates through t until f returns `Stop