FSharpx.Collections


BinaryRandomAccessList<'T> Type

Constructors

Constructor Description

BinaryRandomAccessList(randomAccessList)

Full Usage: BinaryRandomAccessList(randomAccessList)

Parameters:
Returns: BinaryRandomAccessList<'T>
randomAccessList : TreeBRALDigit<'T> list
Returns: BinaryRandomAccessList<'T>

Instance members

Instance member Description

this.Cons(x)

Full Usage: this.Cons(x)

Parameters:
    x : 'T

Returns: BinaryRandomAccessList<'T>

O(log n), worst case. Returns a new random access list with the element added to the beginning.

x : 'T
Returns: BinaryRandomAccessList<'T>

this.Head

Full Usage: this.Head

Returns: 'T

O(log n), worst case. Returns the first element.

Returns: 'T

this.IsEmpty

Full Usage: this.IsEmpty

Returns: bool

O(1). Returns true if the random access list has no elements.

Returns: bool

this.Length()

Full Usage: this.Length()

Returns: int

O(log n). Returns the count of elements.

Returns: int

this.Lookup(i)

Full Usage: this.Lookup(i)

Parameters:
    i : int

Returns: 'T

O(log n), worst case. Returns element by index.

i : int
Returns: 'T

this.Rev()

Full Usage: this.Rev()

Returns: BinaryRandomAccessList<'T>

O(n). Returns random access list reversed.

Returns: BinaryRandomAccessList<'T>

this.Tail

Full Usage: this.Tail

Returns: BinaryRandomAccessList<'T>

O(log n), worst case. Returns a new random access list of the elements trailing the first element.

Returns: BinaryRandomAccessList<'T>

this.TryGetHead

Full Usage: this.TryGetHead

Returns: 'T option

O(log n), worst case. Returns option first element.

Returns: 'T option

this.TryGetTail

Full Usage: this.TryGetTail

Returns: BinaryRandomAccessList<'T> option

O(log n), worst case. Returns a option random access list of the elements trailing the first element.

Returns: BinaryRandomAccessList<'T> option

this.TryLookup(i)

Full Usage: this.TryLookup(i)

Parameters:
    i : int

Returns: 'T option

O(log n), worst case. Returns option element by index.

i : int
Returns: 'T option

this.TryUncons

Full Usage: this.TryUncons

Returns: ('T * BinaryRandomAccessList<'T>) option

O(log n), worst case. Returns the option first element and tail.

Returns: ('T * BinaryRandomAccessList<'T>) option

this.TryUpdate(i) (y)

Full Usage: this.TryUpdate(i) (y)

Parameters:
    i : int
    y : 'T

Returns: BinaryRandomAccessList<'T> option

O(log n), worst case. Returns option random access list with element updated by index.

i : int
y : 'T
Returns: BinaryRandomAccessList<'T> option

this.Uncons

Full Usage: this.Uncons

Returns: 'T * BinaryRandomAccessList<'T>

O(log n), worst case. Returns the first element and tail.

Returns: 'T * BinaryRandomAccessList<'T>

this.Update(i) (y)

Full Usage: this.Update(i) (y)

Parameters:
    i : int
    y : 'T

Returns: BinaryRandomAccessList<'T>

O(log n), worst case. Returns random access list with element updated by index.

i : int
y : 'T
Returns: BinaryRandomAccessList<'T>

this.randomAccessList

Full Usage: this.randomAccessList

Returns: TreeBRALDigit<'T> list
Returns: TreeBRALDigit<'T> list

Static members

Static member Description

BinaryRandomAccessList.tryUpdate i y

Full Usage: BinaryRandomAccessList.tryUpdate i y

Parameters:
    i : int
    y : 'T

Returns: TreeBRALDigit<'T> list -> TreeBRALDigit<'T> list option
i : int
y : 'T
Returns: TreeBRALDigit<'T> list -> TreeBRALDigit<'T> list option

BinaryRandomAccessList.tryUpdateTree

Full Usage: BinaryRandomAccessList.tryUpdateTree

Returns: int * 'T * TreeBRAL<'T> -> TreeBRAL<'T> option
Returns: int * 'T * TreeBRAL<'T> -> TreeBRAL<'T> option

BinaryRandomAccessList.update i y

Full Usage: BinaryRandomAccessList.update i y

Parameters:
    i : int
    y : 'T

Returns: TreeBRALDigit<'T> list -> TreeBRALDigit<'T> list
i : int
y : 'T
Returns: TreeBRALDigit<'T> list -> TreeBRALDigit<'T> list

BinaryRandomAccessList.updateTree

Full Usage: BinaryRandomAccessList.updateTree

Returns: int * 'T * TreeBRAL<'T> -> TreeBRAL<'T>
Returns: int * 'T * TreeBRAL<'T> -> TreeBRAL<'T>