PairingHeap Module
Functions and values
| Function or value | Description |
|
O(1) Returns a empty heap.
|
|
O(1) worst case. Returns the min or max element.
|
Full Usage:
PairingHeap.insert x xs
Parameters:
'T
xs : PairingHeap<'T>
Returns: PairingHeap<'T>
|
O(1) amortized time. Returns a new heap with the element inserted.
|
|
O(1). Returns true if the heap has max element at head.
|
|
O(1) Returns true if the heap has no elements.
|
|
O(n). Returns the count of elements.
|
Full Usage:
PairingHeap.merge xs ys
Parameters:
PairingHeap<'T>
ys : PairingHeap<'T>
Returns: PairingHeap<'T>
|
O(1) amortized time. Returns heap from merging two heaps, both must have same descending.
|
Full Usage:
PairingHeap.ofSeq maximalist s
Parameters:
bool
s : seq<'a>
Returns: PairingHeap<'a>
|
O(n). Returns heap from the sequence.
|
|
O(log n) amortized time. Returns a new heap of the elements trailing the head.
|
|
O(1) worst case. Returns option first min or max element.
|
Full Usage:
PairingHeap.tryGetTail xs
Parameters:
PairingHeap<'T>
Returns: PairingHeap<'T> option
|
O(log n) amortized time. Returns option heap of the elements trailing the head.
|
Full Usage:
PairingHeap.tryMerge xs ys
Parameters:
PairingHeap<'T>
ys : PairingHeap<'T>
Returns: PairingHeap<'T> option
|
O(1) amortized time. Returns heap option from merging two heaps.
|
Full Usage:
PairingHeap.tryUncons xs
Parameters:
PairingHeap<'T>
Returns: ('T * PairingHeap<'T>) option
|
O(log n) amortized time. Returns option head element and tail.
|
|
O(log n) amortized time. Returns the head element and tail.
|
Active patterns
| Active pattern | Description |
Full Usage:
PairingHeap.(|Cons|Nil|) h
Parameters:
PairingHeap<'T>
Returns: Choice<('T * PairingHeap<'T>), unit>
|
|