O(1) - Returns the number of elements in the collection.

O(1) - Returns an empty heap.

O(log n) - Returns the element at the front. Throws if empty.

O(1) - Returns a new heap with the element inserted.

O(1) - Returns true if a call to head of tryHead would return the maximum element in the collection. Returns false if the element at the head is the minimum.

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

O(1) - Returns the number of elements in the collection.

O(log n) - Returns a new heap with the elements of both heaps. The two heaps must have the same isDescending value.

O(n) - Returns heap from the sequence.

O(log n) - Returns a new heap with the front (head) element removed. Throws if empty.

O(n * log n) - Returns and ordered list of the elements in the heap.

O(n * log n) - Returns and ordered sequence of the elements in the heap.

O(log n) - Returns Some x where x is the element at the front. Returns None if the collection is empty.

O(log n) - Returns Some h where h is the merged heap, is both original heaps have the same isDescending value. Returns None if isDescending is different in the heaps supplied.

O(log n) - Returns Some h where h is the heap with the front (head) element removed. Returns None if the collection is empty.

O(log n) - Returns Some (h, t) where h is the head and t is the tail. Returns None if the collection is empty.

O(log n) - Returns the head element and tail. Throws if empty.