Functional Heap implementation based on pairing-heap algorithm and immutable data structures. See more info at http://en.wikipedia.org/wiki/Pairing_heap.
t_of_sexp is not supported, because of the difficulty involved in recreating the
Checks whether the provided element is there, using polymorphic compare if
is not provided
fold t ~init ~f returns
f (... f (f (f init e1) e2) e3 ...) en, where
are the elements of
true if and only if there exists an element for which the provided
function evaluates to
true. This is a short-circuiting operation.
true if and only if the provided function evaluates to
true for all
elements. This is a short-circuiting operation.
Returns the number of elements for which the provided function evaluates to true.
Returns as an
option the first element for which
f evaluates to true.
Returns the first evaluation of
f that returns
Some, and returns
None if there
is no such element.
Returns a minimum (resp maximum) element from the collection using the provided
cmp function, or
None if the collection is empty. In case of a tie, the first
element encountered while traversing the collection is returned. The implementation
fold so it has the same complexity as
The comparison function in
max_elt are independent of that used to
order the heap. Since the provided
cmp may be different from the one used to
create the heap, it is necessary for these functions to traverse the entire heap. If
you want to access the smallest element of the heap according to the heap's comparison
function, you should use
The elements of
to_list t are not in any particular order. You need to sort the
list afterwards if you want to get a sorted list.
create ~cmp returns a new min-heap that uses ordering function
The top of the heap is the smallest element as determined by the provided comparison function.
This returns the top (i.e. smallest) element of the heap. Complexity O(1).