Searched refs:heap (Results 1 – 5 of 5) sorted by relevance
44 check_heap(struct min_heap *heap) in check_heap() argument47 for (i = 1; i < heap->n; ++i) { in check_heap()57 struct min_heap heap; in test_heap_randomized() local62 min_heap_ctor_(&heap); in test_heap_randomized()67 min_heap_push_(&heap, inserted[i]); in test_heap_randomized()69 check_heap(&heap); in test_heap_randomized()74 min_heap_erase_(&heap, inserted[i]); in test_heap_randomized()76 check_heap(&heap); in test_heap_randomized()80 last_e = min_heap_pop_(&heap); in test_heap_randomized()82 e = min_heap_pop_(&heap); in test_heap_randomized()[all …]
53 o Fix a bug when removing a timeout from the heap. [Patch from Marko Kreen]212 …o use a min heap instead of a red-black tree for timeouts; as a result finding the min is a O(1) o…
106 event on the heap. Unfortunately, with event_new(), there was no519 is stored in the timeout heap or in one of the common_timeout queues,538 The timeout heap code is now optimized to perform fewer comparisons
260 The heap-based priority queue timer implementation for Libevent 1.4 is good359 heap-allocated the buffer.
1087 o Fix a bug when removing a timeout from the heap. [Patch from Marko Kreen]