Binary heaps efficient data structure for priority heaps. The basic operations gts_heap_insert() and gts_heap_remove_top() are performed in O(log n) time. Calling gts_heap_freeze(), inserting elements using gts_heap_insert() and calling gts_heap_thaw() allows to build the binary heap in O(n) time. An opaque data structure describing a binary heap. @compare_func: @Returns: @heap: @p: @heap: @Returns: @heap: @Returns: @heap: @heap: @heap: @func: @user_data: @heap: @Returns: @heap: