Handle to a heap. More...
Data Fields | |
| struct HeapSlot * | slots |
| Array of capacity slots, of which the first size are in use. | |
| unsigned int | size |
| Number of elements in the heap. | |
| unsigned int | capacity |
| Number of slots allocated in slots, at least MIN_CAPACITY. | |
| unsigned int | walk_pos |
| Index of the slot the random walk visits next, or NO_WALK. | |
| enum GNUNET_CONTAINER_HeapOrder | order |
| How is the heap sorted? | |
Handle to a heap.
Definition at line 123 of file container_heap.c.
| struct HeapSlot* GNUNET_CONTAINER_Heap::slots |
Array of capacity slots, of which the first size are in use.
Definition at line 128 of file container_heap.c.
Referenced by GNUNET_CONTAINER_heap_create(), GNUNET_CONTAINER_heap_destroy(), GNUNET_CONTAINER_heap_iterate(), GNUNET_CONTAINER_heap_node_get_cost(), GNUNET_CONTAINER_heap_peek(), GNUNET_CONTAINER_heap_peek2(), GNUNET_CONTAINER_heap_remove_node(), GNUNET_CONTAINER_heap_remove_root(), GNUNET_CONTAINER_heap_update_cost(), GNUNET_CONTAINER_heap_walk_get_next(), place(), remove_slot(), reposition(), resize(), sift_down(), and sift_up().
| unsigned int GNUNET_CONTAINER_Heap::size |
Number of elements in the heap.
Definition at line 133 of file container_heap.c.
Referenced by GNUNET_CONTAINER_heap_destroy(), GNUNET_CONTAINER_heap_get_size(), GNUNET_CONTAINER_heap_insert(), GNUNET_CONTAINER_heap_iterate(), GNUNET_CONTAINER_heap_peek(), GNUNET_CONTAINER_heap_peek2(), GNUNET_CONTAINER_heap_remove_node(), GNUNET_CONTAINER_heap_remove_root(), GNUNET_CONTAINER_heap_update_cost(), GNUNET_CONTAINER_heap_walk_get_next(), remove_slot(), resize(), and sift_down().
| unsigned int GNUNET_CONTAINER_Heap::capacity |
Number of slots allocated in slots, at least MIN_CAPACITY.
Definition at line 138 of file container_heap.c.
Referenced by GNUNET_CONTAINER_heap_create(), GNUNET_CONTAINER_heap_insert(), remove_slot(), and resize().
| unsigned int GNUNET_CONTAINER_Heap::walk_pos |
Index of the slot the random walk visits next, or NO_WALK.
An index that is no longer below size also restarts the walk.
Definition at line 144 of file container_heap.c.
Referenced by GNUNET_CONTAINER_heap_create(), and GNUNET_CONTAINER_heap_walk_get_next().
| enum GNUNET_CONTAINER_HeapOrder GNUNET_CONTAINER_Heap::order |
How is the heap sorted?
Definition at line 149 of file container_heap.c.
Referenced by GNUNET_CONTAINER_heap_create(), and key_mask().