fsprojects/FSharpx.Collections


Queue

Namespace: FSharpx.Collections

Functions and values

Function or valueDescription
conj arg1 arg2
Signature: 'T -> Queue<'T> -> Queue<'T>
Type parameters: 'T

O(1). Returns a new queue with the element added to the end. (enqueue)

empty
Signature: Queue<'T>
Type parameters: 'T

O(1). Returns queue of no elements.

fold arg1 arg2 arg3
Signature: ('State -> 'T -> 'State) -> 'State -> Queue<'T> -> 'State
Type parameters: 'State, 'T

O(n). Applies a function to each element of the queue, threading an accumulator argument through the computation, left to right.

foldBack arg1 arg2 arg3
Signature: ('T -> 'State -> 'State) -> Queue<'T> -> 'State -> 'State
Type parameters: 'T, 'State

O(n). Applies a function to each element of the queue, threading an accumulator argument through the computation, right to left.

head arg1
Signature: Queue<'T> -> 'T
Type parameters: 'T

O(1). Returns the first element. (peek)

isEmpty arg1
Signature: Queue<'T> -> bool
Type parameters: 'T

O(1). Returns true if the queue has no elements.

length arg1
Signature: Queue<'T> -> int
Type parameters: 'T

O(1). Returns the count of elememts.

ofList arg1
Signature: 'T list -> Queue<'T>
Type parameters: 'T

O(1). Returns a queue of the list

ofSeq arg1
Signature: seq<'T> -> Queue<'T>
Type parameters: 'T

O(n). Returns a queue of the seq.

rev arg1
Signature: Queue<'T> -> Queue<'T>
Type parameters: 'T

O(n). Returns queue reversed.

tail arg1
Signature: Queue<'T> -> Queue<'T>
Type parameters: 'T

O(1) amortized, O(n) worst-case. Returns a new queue of the elements trailing the first element. (dequeue)

toSeq arg1
Signature: Queue<'T> -> seq<'T>
Type parameters: 'T

O(n). Views the given queue as a sequence.

tryHead arg1
Signature: Queue<'T> -> 'T option
Type parameters: 'T

O(1). Returns option first element.

tryTail arg1
Signature: Queue<'T> -> Queue<'T> option
Type parameters: 'T

O(1) amortized, O(n) worst-case. Returns option queue of the elements trailing the first element

tryUncons arg1
Signature: Queue<'T> -> ('T * Queue<'T>) option
Type parameters: 'T

O(1) amortized, O(n) worst-case. Returns option first element and tail.

uncons arg1
Signature: Queue<'T> -> 'T * Queue<'T>
Type parameters: 'T

O(1) amortized, O(n) worst-case. Returns the first element and tail.

Active patterns

Active patternDescription
( |Cons|Nil| ) arg1
Signature: Queue<'T> -> Choice<('T * Queue<'T>),unit>
Type parameters: 'T

CompiledName: |Cons|Nil|

Fork me on GitHub