min_heap_char
void __min_heap_init_inline(min_heap_char *heap, void *data, size_t size)
__min_heap_init_inline(container_of(&(_heap)->nr, min_heap_char, nr), _data, _size)
void *__min_heap_peek_inline(struct min_heap_char *heap)
__min_heap_peek_inline(container_of(&(_heap)->nr, min_heap_char, nr)))
bool __min_heap_full_inline(min_heap_char *heap)
__min_heap_full_inline(container_of(&(_heap)->nr, min_heap_char, nr))
void __min_heap_sift_down_inline(min_heap_char *heap, size_t pos, size_t elem_size,
__min_heap_sift_down_inline(container_of(&(_heap)->nr, min_heap_char, nr), _pos, \
void __min_heap_sift_up_inline(min_heap_char *heap, size_t elem_size, size_t idx,
__min_heap_sift_up_inline(container_of(&(_heap)->nr, min_heap_char, nr), \
void __min_heapify_all_inline(min_heap_char *heap, size_t elem_size,
__min_heapify_all_inline(container_of(&(_heap)->nr, min_heap_char, nr), \
bool __min_heap_pop_inline(min_heap_char *heap, size_t elem_size,
__min_heap_pop_inline(container_of(&(_heap)->nr, min_heap_char, nr), \
void __min_heap_pop_push_inline(min_heap_char *heap, const void *element, size_t elem_size,
typedef DEFINE_MIN_HEAP(char, min_heap_char) min_heap_char;
__min_heap_pop_push_inline(container_of(&(_heap)->nr, min_heap_char, nr), _element, \
bool __min_heap_push_inline(min_heap_char *heap, const void *element, size_t elem_size,
__min_heap_push_inline(container_of(&(_heap)->nr, min_heap_char, nr), _element, \
bool __min_heap_del_inline(min_heap_char *heap, size_t elem_size, size_t idx,
__min_heap_del_inline(container_of(&(_heap)->nr, min_heap_char, nr), \
void __min_heap_init(min_heap_char *heap, void *data, size_t size);
void *__min_heap_peek(struct min_heap_char *heap);
bool __min_heap_full(min_heap_char *heap);
void __min_heap_sift_down(min_heap_char *heap, size_t pos, size_t elem_size,
void __min_heap_sift_up(min_heap_char *heap, size_t elem_size, size_t idx,
void __min_heapify_all(min_heap_char *heap, size_t elem_size,
bool __min_heap_pop(min_heap_char *heap, size_t elem_size,
void __min_heap_pop_push(min_heap_char *heap, const void *element, size_t elem_size,
bool __min_heap_push(min_heap_char *heap, const void *element, size_t elem_size,
bool __min_heap_del(min_heap_char *heap, size_t elem_size, size_t idx,
__min_heap_init(container_of(&(_heap)->nr, min_heap_char, nr), _data, _size)
(__minheap_cast(_heap) __min_heap_peek(container_of(&(_heap)->nr, min_heap_char, nr)))
__min_heap_full(container_of(&(_heap)->nr, min_heap_char, nr))
__min_heap_sift_down(container_of(&(_heap)->nr, min_heap_char, nr), _pos, \
__min_heap_sift_up(container_of(&(_heap)->nr, min_heap_char, nr), \
__min_heapify_all(container_of(&(_heap)->nr, min_heap_char, nr), \
__min_heap_pop(container_of(&(_heap)->nr, min_heap_char, nr), \
__min_heap_pop_push(container_of(&(_heap)->nr, min_heap_char, nr), _element, \
__min_heap_push(container_of(&(_heap)->nr, min_heap_char, nr), _element, \
__min_heap_del(container_of(&(_heap)->nr, min_heap_char, nr), \
void *__min_heap_peek(struct min_heap_char *heap)
bool __min_heap_full(min_heap_char *heap)
void __min_heap_sift_down(min_heap_char *heap, size_t pos, size_t elem_size,
void __min_heap_sift_up(min_heap_char *heap, size_t elem_size, size_t idx,
void __min_heapify_all(min_heap_char *heap, size_t elem_size,
bool __min_heap_pop(min_heap_char *heap, size_t elem_size,
void __min_heap_init(min_heap_char *heap, void *data, size_t size)
void __min_heap_pop_push(min_heap_char *heap, const void *element, size_t elem_size,
bool __min_heap_push(min_heap_char *heap, const void *element, size_t elem_size,
bool __min_heap_del(min_heap_char *heap, size_t elem_size, size_t idx,