
O(1). Returns a empty heap.

isDescending
:
bool

Returns:
Heap<'T>


O(1) worst case. Returns the min or max element.

xs
:
Heap<'T>

Returns:
'T


O(log n) amortized time. Returns a new heap with the element inserted.

x
:
'T

xs
:
Heap<'T>

Returns:
Heap<'T>


O(1). Returns true if the heap has max element at head.

xs
:
Heap<'T>

Returns:
bool


O(1). Returns true if the heap has no elements.

xs
:
Heap<'T>

Returns:
bool


O(n). Returns the count of elememts.

xs
:
Heap<'T>

Returns:
int


O(log n) amortized time. Returns heap from merging two heaps, both must have same descending.

xs
:
Heap<'T>

ys
:
Heap<'T>

Returns:
Heap<'T>


O(n log n). Returns heap, bool isDescending, from the sequence.

isDescending
:
bool

s
:
seq<'T>

Returns:
Heap<'T>


O(n). Returns heap reversed.

xs
:
Heap<'T>

Returns:
Heap<'T>


O(log n) amortized time. Returns a new heap of the elements trailing the head.

xs
:
Heap<'T>

Returns:
Heap<'T>


O(n). Views the given heap as a sequence.

xs
:
Heap<'T>

Returns:
seq<'T>


O(1) worst case. Returns option first min or max element.

xs
:
Heap<'T>

Returns:
'T option


O(log n) amortized time. Returns heap option from merging two heaps.

xs
:
Heap<'T>

ys
:
Heap<'T>

Returns:
Heap<'T> option


O(log n) amortized time. Returns option heap of the elements trailing the head.

xs
:
Heap<'T>

Returns:
Heap<'T> option


O(log n) amortized time. Returns option head element and tail.

xs
:
Heap<'T>

Returns:
('T * Heap<'T>) option


O(log n) amortized time. Returns the head element and tail.

xs
:
Heap<'T>

Returns:
'T * Heap<'T>
