Queue Module
Functions and values
| Function or value | Description |
|
O(1). Returns a new queue with the element added to the end. (enqueue)
|
|
O(1). Returns queue of no elements.
|
Full Usage:
Queue.fold arg1 arg2 arg3
Parameters:
'State -> 'T -> 'State
arg1 : 'State
arg2 : Queue<'T>
Returns: 'State
|
O(n). Applies a function to each element of the queue, threading an accumulator argument through the computation, left to right.
|
Full Usage:
Queue.foldBack arg1 arg2 arg3
Parameters:
'T -> 'State -> 'State
arg1 : Queue<'T>
arg2 : 'State
Returns: 'State
|
O(n). Applies a function to each element of the queue, threading an accumulator argument through the computation, right to left.
|
|
O(1). Returns the first element. (peek)
|
|
O(1). Returns true if the queue has no elements.
|
|
O(1). Returns the count of elememts.
|
|
O(1). Returns a queue of the list
|
|
O(n). Returns a queue of the seq.
|
|
O(n). Returns queue reversed.
|
|
O(1) amortized, O(n) worst-case. Returns a new queue of the elements trailing the first element. (dequeue)
|
|
O(n). Views the given queue as a sequence.
|
|
O(1). Returns option first element.
|
|
O(1) amortized, O(n) worst-case. Returns option queue of the elements trailing the first element
|
|
O(1) amortized, O(n) worst-case. Returns option first element and tail.
|
|
O(1) amortized, O(n) worst-case. Returns the first element and tail.
|