DList is an ordered linear structure implementing the List signature (head, tail, cons), end-insertion (add), 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 member | Description |
Full Usage:
this.Head
Returns: 'T
|
|
Full Usage:
this.IsEmpty
Returns: bool
|
|
Full Usage:
this[index]
Parameters:
int
Returns: 'T
|
|
Full Usage:
this.Length
Returns: int
|
|
|
|
Full Usage:
this.TryHead
Returns: 'T option
|
|
|
|
|
|
|
|
|
|
Static member | Description |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Full Usage:
DList.fold f state l
Parameters:
'State -> 'T -> 'State
state : 'State
l : DList<'T>
Returns: 'State
|
|
Full Usage:
DList.foldBack f l state
Parameters:
'T -> 'State -> 'State
l : DList<'T>
state : 'State
Returns: 'State
|
|
|
|
|
|
|
|
|
|
|
|