Creates a new #DzlHeap. A heap is a tree-like structure stored in an array that is not fully sorted, but head is guaranteed to be either the max, or min value based on @compare_func. This is also known as a priority queue.
the size of each element in the heap
a function to compare to elements
A newly allocated #DzlHeap
ConstructionException GTK+ fails to create the object.
See Implementation
Creates a new #DzlHeap. A heap is a tree-like structure stored in an array that is not fully sorted, but head is guaranteed to be either the max, or min value based on @compare_func. This is also known as a priority queue.