One position of the heap array. More...
Data Fields | |
| GNUNET_CONTAINER_HeapCostType | key |
| Cost of the node, transformed by key_mask() for the heap's order. | |
| struct GNUNET_CONTAINER_HeapNode * | node |
| Node stored in this slot. | |
One position of the heap array.
The key is stored here, not in the node, so that comparisons while restoring the heap order do not have to follow a pointer for every key.
Definition at line 106 of file container_heap.c.
| GNUNET_CONTAINER_HeapCostType HeapSlot::key |
Cost of the node, transformed by key_mask() for the heap's order.
Definition at line 111 of file container_heap.c.
Referenced by GNUNET_CONTAINER_heap_insert(), GNUNET_CONTAINER_heap_iterate(), GNUNET_CONTAINER_heap_node_get_cost(), GNUNET_CONTAINER_heap_peek2(), GNUNET_CONTAINER_heap_update_cost(), reposition(), sift_down(), and sift_up().
| struct GNUNET_CONTAINER_HeapNode* HeapSlot::node |
Node stored in this slot.
Definition at line 116 of file container_heap.c.
Referenced by 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(), and place().