Heap is an ordered linear structure where the ordering is ascending or descending. "head" inspects the first element in the ordering, "tail" takes the remaining structure after head, and "insert" places elements within the ordering. PriorityQueue is available as an alternate interface. According to Okasaki the time complexity of the heap functions in this Heap implementation (based on the "pairing" heap) have resisted time complexity analysis.
Constructor | Description |
|
|
Instance member | Description |
Full Usage:
this.Head
Returns: 'T
|
|
|
|
Full Usage:
this.IsDescending
Returns: bool
|
|
Full Usage:
this.IsEmpty
Returns: bool
|
|
Full Usage:
this.Length
Returns: int
|
|
|
|
|
|
|
|
Full Usage:
this.TryHead
Returns: 'T option
|
|
|
|
|
|
|
|
|
|
Static member | Description |
|
|