Queue<'T> (fantomas)

Queue<'T> Type

Namespace: Fantomas.Core
Assembly: Fantomas.Core.dll
Base Type: obj
All Interfaces: IReadOnlyCollection<'T> , IEnumerable<'T> , IEnumerable

append only collection optimized for quick append of block of data and query operations data - list of blocks in reverse order

Constructor Description

Constructor	Description
`Queue(data, length)` Full Usage: `Queue(data, length)` Parameters: data : `'T array list` length : `int` Returns: `Queue<'T>`	data : `'T array list` length : `int` Returns: `Queue<'T>`


                
                  
                    
                      Queue(data, length)

Full Usage: Queue(data, length)

Parameters:

data : 'T array list

length : int

Returns: Queue<'T>

Instance member	Description
`this.Append` Full Usage: `this.Append` Parameters: xs : `'T list` Returns: `Queue<'T>`	xs : `'T list` Returns: `Queue<'T>`
`this.Head` Full Usage: `this.Head` Returns: `'T`	Returns: `'T`
`this.IsEmpty` Full Usage: `this.IsEmpty` Returns: `bool`	Returns: `bool`
`this.Length` Full Usage: `this.Length` Returns: `int`	Returns: `int`
`this.Rev` Full Usage: `this.Rev` Returns: `'T seq`	Returns: `'T seq`
`this.SkipExists` Full Usage: `this.SkipExists` Parameters: n : `int` f : `'T -> bool` p : `'T array -> bool` Returns: `bool`	Equivalent of q \|> Queue.toSeq \|> Seq.skip n \|> Seq.skipWhile p \|> Seq.exists f, optimized for speed n : `int` f : `'T -> bool` p : `'T array -> bool` Returns: `bool`
`this.Tail` Full Usage: `this.Tail` Returns: `Queue<'T>`	Returns: `Queue<'T>`
`this.TryHead` Full Usage: `this.TryHead` Returns: `'T option`	Returns: `'T option`