|
Blender V5.3
|
#include <algorithm>#include <cstdlib>#include "MEM_guardedalloc.h"#include "BLI_heap.hh"#include "BLI_utildefines.hh"#include "BLI_strict_flags.hh"Go to the source code of this file.
Classes | |
| struct | blender::HeapNode |
| struct | blender::HeapNode_Chunk |
| struct | blender::Heap |
Namespaces | |
| namespace | blender |
| BMesh Iterators. | |
Macros | |
| #define | HEAP_CHUNK_DEFAULT_NUM uint(MEM_SIZE_OPTIMAL((1 << 16) - sizeof(HeapNode_Chunk)) / sizeof(HeapNode)) |
Internal Functions | |
| #define | HEAP_PARENT(i) |
| #define | HEAP_LEFT(i) |
| #define | HEAP_RIGHT(i) |
| #define | HEAP_COMPARE(a, b) |
| BLI_INLINE void | blender::heap_swap (Heap *heap, const uint i, const uint j) |
| static void | blender::heap_down (Heap *heap, uint i) |
| static void | blender::heap_up (Heap *heap, uint i) |
A min-heap / priority queue ADT.
Definition in file BLI_heap.cc.
| #define HEAP_CHUNK_DEFAULT_NUM uint(MEM_SIZE_OPTIMAL((1 << 16) - sizeof(HeapNode_Chunk)) / sizeof(HeapNode)) |
Number of nodes to include per #HeapNode_Chunk when no reserved size is passed, or we allocate past the reserved number.
Definition at line 45 of file BLI_heap.cc.
Referenced by blender::BLI_heap_new_ex(), and blender::heap_node_alloc().
| #define HEAP_COMPARE | ( | a, | |
| b ) |
Definition at line 68 of file BLI_heap.cc.
Referenced by blender::heap_down(), blender::heap_is_minheap(), and blender::heap_up().
| #define HEAP_LEFT | ( | i | ) |
Definition at line 66 of file BLI_heap.cc.
Referenced by blender::heap_down(), and blender::heap_is_minheap().
| #define HEAP_PARENT | ( | i | ) |
Definition at line 65 of file BLI_heap.cc.
Referenced by blender::BLI_heap_remove(), blender::heap_up(), and blender::heapsimple_up().
| #define HEAP_RIGHT | ( | i | ) |
Definition at line 67 of file BLI_heap.cc.
Referenced by blender::heap_down(), and blender::heap_is_minheap().