fsprojects/FSharpx.Collections


BinaryRandomAccessList<'T>

Namespace: FSharpx.Collections.Experimental

Constructors

ConstructorDescription
new(randomAccessList)
Signature: (randomAccessList:Digit<'T> list) -> BinaryRandomAccessList<'T>

CompiledName: .ctor

Instance members

Instance memberDescription
Cons(x)
Signature: x:'T -> BinaryRandomAccessList<'T>

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

Head
Signature: 'T

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

CompiledName: get_Head

IsEmpty
Signature: bool

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

CompiledName: get_IsEmpty

Length()
Signature: unit -> int

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

Lookup(i)
Signature: i:int -> 'T

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

randomAccessList
Signature: Digit<'T> list

CompiledName: get_randomAccessList

Rev()
Signature: unit -> BinaryRandomAccessList<'T>

O(n). Returns random access list reversed.

Tail
Signature: BinaryRandomAccessList<'T>

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

CompiledName: get_Tail

TryGetHead
Signature: 'T option

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

CompiledName: get_TryGetHead

TryGetTail
Signature: BinaryRandomAccessList<'T> option

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

CompiledName: get_TryGetTail

TryLookup(i)
Signature: i:int -> 'T option

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

TryUncons
Signature: ('T * BinaryRandomAccessList<'T>) option

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

CompiledName: get_TryUncons

TryUpdate(i y)
Signature: i:int -> y:'T -> BinaryRandomAccessList<'T> option

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

Uncons
Signature: 'T * BinaryRandomAccessList<'T>

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

CompiledName: get_Uncons

Update(i y)
Signature: i:int -> y:'T -> BinaryRandomAccessList<'T>

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

Static members

Static memberDescription
tryUpdate(i y)
Signature: i:int -> y:'T -> Digit<'T> list -> Digit<'T> list option
tryUpdateTree
Signature: int * 'T * TreeBRAL<'T> -> TreeBRAL<'T> option

CompiledName: get_tryUpdateTree

update(i y)
Signature: i:int -> y:'T -> Digit<'T> list -> Digit<'T> list
updateTree
Signature: int * 'T * TreeBRAL<'T> -> TreeBRAL<'T>

CompiledName: get_updateTree

Fork me on GitHub