|
| Heap * | blender::BLI_heap_new_ex (unsigned int reserve_num) ATTR_WARN_UNUSED_RESULT |
| Heap * | blender::BLI_heap_new () ATTR_WARN_UNUSED_RESULT |
| void | blender::BLI_heap_clear (Heap *heap, HeapFreeFP ptrfreefp) ATTR_NONNULL(1) |
| void | blender::BLI_heap_free (Heap *heap, HeapFreeFP ptrfreefp) ATTR_NONNULL(1) |
| HeapNode * | blender::BLI_heap_insert (Heap *heap, float value, void *ptr) ATTR_NONNULL(1) |
| void | blender::BLI_heap_insert_or_update (Heap *heap, HeapNode **node_p, float value, void *ptr) ATTR_NONNULL(1 |
| void void | blender::BLI_heap_remove (Heap *heap, HeapNode *node) ATTR_NONNULL(1 |
| void void bool | blender::BLI_heap_is_empty (const Heap *heap) ATTR_NONNULL(1) |
| unsigned int | blender::BLI_heap_len (const Heap *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1) |
| HeapNode * | blender::BLI_heap_top (const Heap *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1) |
| float | blender::BLI_heap_top_value (const Heap *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1) |
| void * | blender::BLI_heap_pop_min (Heap *heap) ATTR_NONNULL(1) |
| void | blender::BLI_heap_node_value_update (Heap *heap, HeapNode *node, float value) ATTR_NONNULL(1 |
| void void | blender::BLI_heap_node_value_update_ptr (Heap *heap, HeapNode *node, float value, void *ptr) ATTR_NONNULL(1 |
| void void float | blender::BLI_heap_node_value (const HeapNode *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1) |
| void * | blender::BLI_heap_node_ptr (const HeapNode *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1) |
| bool | blender::BLI_heap_is_valid (const Heap *heap) |
A min-heap / priority queue ADT.
Definition in file BLI_heap.hh.