Extended binary heaps efficient data structure for priority heaps allowing removal of elements. This data structure is similar to the binary heap implementation but adds the two operations gts_eheap_decrease_key() and gts_eheap_remove(). Contrary to the binary heap implementation, keys are stored in a #GtsEHeapPair structure and comparisons between keys are performed directly (thus saving a call to a comparison function). This structure consequently provides generally faster operations at the expense of memory use. If your comparison function is simple and you don't need the extra functionalities, it is usually better to use a #GtsHeap. @data: @key: @pos: @item: @data: @Returns: @key_func: @data: @Returns: @heap: @p: @Returns: @heap: @p: @key: @Returns: @heap: @key: @Returns: @heap: @key: @Returns: @heap: @p: @Returns: @heap: @p: @new_key: @heap: @p: @Returns: @heap: @randomized: @heap: @heap: @heap: @heap: @func: @data: @heap: @Returns: @heap: