DList<'T> Type
DList is an ordered linear structure implementing the List signature (head, tail, cons), end-insertion (conj), and O(1) append. Ordering is by insertion history. DList is an implementation of [John Hughes' append list](http://dl.acm.org/citation.cfm?id=8475).
Instance members
| Instance member | Description |
|
O(1). Returns a new DList with the element added to the end.
|
|
O(1). Returns a new DList with the element added to the front.
|
Full Usage:
this.Head
Returns: 'T
|
O(log n). Returns the first element.
|
Full Usage:
this.IsEmpty
Returns: bool
|
O(1). Returns true if the DList has no elements.
|
Full Usage:
this.Length
Returns: int
|
O(1). Returns the count of elememts.
|
|
O(log n). Returns a new DList of the elements trailing the first element.
|
|
Full Usage:
this.TryHead
Returns: 'T option
|
O(log n). Returns option first element
|
|
O(log n). Returns option DList of the elements trailing the first element.
|
|
O(log n). Returns option first element and tail.
|
|
O(log n). Returns the first element and tail.
|