SkewBinaryRandomAccessList<'T> Type
Constructors
| Constructor | Description |
Full Usage:
SkewBinaryRandomAccessList(randomAccessList)
Parameters:
(int * TreeSBRAL<'T>) list
Returns: SkewBinaryRandomAccessList<'T>
|
|
Instance members
| Instance member | Description |
|
O(1), worst case. Returns a new random access list with the element added to the beginning.
|
Full Usage:
this.Head
Returns: 'T
|
O(1), worst case. Returns the first element.
|
Full Usage:
this.IsEmpty
Returns: bool
|
O(1). Returns true if the random access list has no elements.
|
Full Usage:
this.Length()
Returns: int
|
O(log n) Returns the count of elements.
|
Full Usage:
this.Lookup(i)
Parameters:
int
Returns: 'T
|
O(log n), worst case. Returns element by index.
|
|
O(n). Returns random access list reversed.
|
|
O(1), worst case. Returns a new random access list of the elements trailing the first element.
|
Full Usage:
this.TryGetHead
Returns: 'T option
|
O(1), worst case. Returns option first element.
|
|
O(1), worst case. Returns a option random access list of the elements trailing the first element.
|
Full Usage:
this.TryLookup(i)
Parameters:
int
Returns: 'T option
|
O(log n), worst case. Returns option element by index.
|
|
O(1), worst case. Returns the option first element and tail.
|
Full Usage:
this.TryUpdate(i) (y)
Parameters:
int
y : 'T
Returns: SkewBinaryRandomAccessList<'T> option
|
O(log n), worst case. Returns option random access list with element updated by index.
|
|
O(1), worst case. Returns the first element and tail.
|
|
O(log n), worst case. Returns random access list with element updated by index.
|
|
|
Static members
| Static member | Description |
|
|
|
|
|
|
|
|