Module CCHeap.Make

Empty heap.

Is the heap empty?

Merge two heaps.

Insert a value in the heap.

Synonym to insert.

Filter values, only retaining the ones that satisfy the predicate. Linear time at least.

Find minimal element.

Like find_min but can fail.

• Raises Empty: if the heap is empty.

Extract and return the minimum element, and the new heap (without this element), or None if the heap is empty.

Like take, but can fail.

• Raises Empty: if the heap is empty.

Delete one occurrence of a value if it exist in the heap. delete_one eq x h, use eq to find one x in h and delete it. If h do not contain x then it return h.

• Since: 2.0

Delete all occurrences of a value in the heap. delete_all eq x h, use eq to find all x in h and delete them. If h do not contain x then it return h. The difference with filter is that delete_all stops as soon as it enters a subtree whose root is bigger than the element.

• Since: 2.0

Iterate on elements.

Fold on all values.

Number of elements (linear complexity).

Return the elements of the heap, in no particular order.

Return the elements in increasing order.

• Since: 1.1

Add the elements of the list to the heap. An element occurring several times will be added that many times to the heap.

• Since: 0.16

of_list l is add_list empty l. Complexity: O(n log n).

• Since: 0.16

Build a heap from a given sequence. Complexity: O(n log n).

Return a sequence of the elements of the heap.

Iterate on the elements, in increasing order.

• Since: 1.1

• Since: 0.16

Build a heap from a given klist. Complexity: O(n log n).

Return a klist of the elements of the heap.

• Since: 0.16

Build a heap from a given gen. Complexity: O(n log n).

Return a gen of the elements of the heap.

Return a ktree of the elements of the heap.