SkewBinaryRandomAccessList (FSharpx.Collections)

SkewBinaryRandomAccessList Module

Namespace: FSharpx.Collections.Experimental
Assembly: FSharpx.Collections.Experimental.dll

Functions and values

Active patterns

Active pattern Description

Active pattern	Description
`SkewBinaryRandomAccessList.(\|Cons\|Nil\|) l` Full Usage: `SkewBinaryRandomAccessList.(\|Cons\|Nil\|) l` Parameters: l : `SkewBinaryRandomAccessList<'T>` Returns: `Choice<('T * SkewBinaryRandomAccessList<'T>), unit>`	l : `SkewBinaryRandomAccessList<'T>` Returns: `Choice<('T * SkewBinaryRandomAccessList<'T>), unit>`


                
                  
                    
                      SkewBinaryRandomAccessList.(|Cons|Nil|) l

Full Usage: SkewBinaryRandomAccessList.(|Cons|Nil|) l

Parameters:

l : SkewBinaryRandomAccessList<'T>

Returns: Choice<('T * SkewBinaryRandomAccessList<'T>), unit>

l : SkewBinaryRandomAccessList<'T>

Returns: Choice<('T * SkewBinaryRandomAccessList<'T>), unit>

Function or value	Description
`SkewBinaryRandomAccessList.cons x xs` Full Usage: `SkewBinaryRandomAccessList.cons x xs` Parameters: x : `'T` xs : `SkewBinaryRandomAccessList<'T>` Returns: `SkewBinaryRandomAccessList<'T>`	O(1), worst case. Returns a new random access list with the element added to the beginning. x : `'T` xs : `SkewBinaryRandomAccessList<'T>` Returns: `SkewBinaryRandomAccessList<'T>`
`SkewBinaryRandomAccessList.empty ()` Full Usage: `SkewBinaryRandomAccessList.empty ()` Parameters: () : `unit` Returns: `SkewBinaryRandomAccessList<'T>`	returns a empty random access list. () : `unit` Returns: `SkewBinaryRandomAccessList<'T>`
`SkewBinaryRandomAccessList.head xs` Full Usage: `SkewBinaryRandomAccessList.head xs` Parameters: xs : `SkewBinaryRandomAccessList<'T>` Returns: `'T`	O(1), worst case. Returns the first element. xs : `SkewBinaryRandomAccessList<'T>` Returns: `'T`
`SkewBinaryRandomAccessList.isEmpty xs` Full Usage: `SkewBinaryRandomAccessList.isEmpty xs` Parameters: xs : `SkewBinaryRandomAccessList<'T>` Returns: `bool`	O(1). Returns true if the random access list has no elements. xs : `SkewBinaryRandomAccessList<'T>` Returns: `bool`
`SkewBinaryRandomAccessList.length xs` Full Usage: `SkewBinaryRandomAccessList.length xs` Parameters: xs : `SkewBinaryRandomAccessList<'T>` Returns: `int`	O(log n). Returns the count of elements. xs : `SkewBinaryRandomAccessList<'T>` Returns: `int`
`SkewBinaryRandomAccessList.lookup i xs` Full Usage: `SkewBinaryRandomAccessList.lookup i xs` Parameters: i : `int` xs : `SkewBinaryRandomAccessList<'T>` Returns: `'T`	O(log n), worst case. Returns element by index. i : `int` xs : `SkewBinaryRandomAccessList<'T>` Returns: `'T`
`SkewBinaryRandomAccessList.ofSeq s` Full Usage: `SkewBinaryRandomAccessList.ofSeq s` Parameters: s : `seq<'a>` Returns: `SkewBinaryRandomAccessList<'a>`	O(n) Returns random access list from the sequence. s : `seq<'a>` Returns: `SkewBinaryRandomAccessList<'a>`
`SkewBinaryRandomAccessList.rev xs` Full Usage: `SkewBinaryRandomAccessList.rev xs` Parameters: xs : `SkewBinaryRandomAccessList<'T>` Returns: `SkewBinaryRandomAccessList<'T>`	O(n). Returns random access list reversed. xs : `SkewBinaryRandomAccessList<'T>` Returns: `SkewBinaryRandomAccessList<'T>`
`SkewBinaryRandomAccessList.tail xs` Full Usage: `SkewBinaryRandomAccessList.tail xs` Parameters: xs : `SkewBinaryRandomAccessList<'T>` Returns: `SkewBinaryRandomAccessList<'T>`	O(1), worst case. Returns a new random access list of the elements trailing the first element. xs : `SkewBinaryRandomAccessList<'T>` Returns: `SkewBinaryRandomAccessList<'T>`
`SkewBinaryRandomAccessList.tryGetHead xs` Full Usage: `SkewBinaryRandomAccessList.tryGetHead xs` Parameters: xs : `SkewBinaryRandomAccessList<'T>` Returns: `'T option`	O(1), worst case. Returns option first element. xs : `SkewBinaryRandomAccessList<'T>` Returns: `'T option`
`SkewBinaryRandomAccessList.tryGetTail xs` Full Usage: `SkewBinaryRandomAccessList.tryGetTail xs` Parameters: xs : `SkewBinaryRandomAccessList<'T>` Returns: `SkewBinaryRandomAccessList<'T> option`	O(1), worst case. Returns a option random access list of the elements trailing the first element. xs : `SkewBinaryRandomAccessList<'T>` Returns: `SkewBinaryRandomAccessList<'T> option`
`SkewBinaryRandomAccessList.tryLookup i xs` Full Usage: `SkewBinaryRandomAccessList.tryLookup i xs` Parameters: i : `int` xs : `SkewBinaryRandomAccessList<'T>` Returns: `'T option`	O(log n), worst case. Returns option element by index. i : `int` xs : `SkewBinaryRandomAccessList<'T>` Returns: `'T option`
`SkewBinaryRandomAccessList.tryUncons xs` Full Usage: `SkewBinaryRandomAccessList.tryUncons xs` Parameters: xs : `SkewBinaryRandomAccessList<'T>` Returns: `('T * SkewBinaryRandomAccessList<'T>) option`	O(1), worst case. Returns the option first element and tail. xs : `SkewBinaryRandomAccessList<'T>` Returns: `('T * SkewBinaryRandomAccessList<'T>) option`
`SkewBinaryRandomAccessList.tryUpdate i y xs` Full Usage: `SkewBinaryRandomAccessList.tryUpdate i y xs` Parameters: i : `int` y : `'T` xs : `SkewBinaryRandomAccessList<'T>` Returns: `SkewBinaryRandomAccessList<'T> option`	O(log n), worst case. Returns option random access list with element updated by index. i : `int` y : `'T` xs : `SkewBinaryRandomAccessList<'T>` Returns: `SkewBinaryRandomAccessList<'T> option`
`SkewBinaryRandomAccessList.uncons xs` Full Usage: `SkewBinaryRandomAccessList.uncons xs` Parameters: xs : `SkewBinaryRandomAccessList<'T>` Returns: `'T * SkewBinaryRandomAccessList<'T>`	O(1), worst case. Returns the first element and tail. xs : `SkewBinaryRandomAccessList<'T>` Returns: `'T * SkewBinaryRandomAccessList<'T>`
`SkewBinaryRandomAccessList.update i y xs` Full Usage: `SkewBinaryRandomAccessList.update i y xs` Parameters: i : `int` y : `'T` xs : `SkewBinaryRandomAccessList<'T>` Returns: `SkewBinaryRandomAccessList<'T>`	O(log n), worst case. Returns random access list with element updated by index. i : `int` y : `'T` xs : `SkewBinaryRandomAccessList<'T>` Returns: `SkewBinaryRandomAccessList<'T>`