aboutsummaryrefslogtreecommitdiffstats
path: root/include/litmus/bheap.h
diff options
context:
space:
mode:
Diffstat (limited to 'include/litmus/bheap.h')
-rw-r--r--include/litmus/bheap.h11
1 files changed, 2 insertions, 9 deletions
diff --git a/include/litmus/bheap.h b/include/litmus/bheap.h
index 4fded5724b28..72dec0cc0240 100644
--- a/include/litmus/bheap.h
+++ b/include/litmus/bheap.h
@@ -24,8 +24,6 @@ struct bheap {
24 * This speeds up repeated peek operations. 24 * This speeds up repeated peek operations.
25 */ 25 */
26 struct bheap_node* min; 26 struct bheap_node* min;
27
28// unsigned int size;
29}; 27};
30 28
31typedef int (*bheap_prio_t)(struct bheap_node* a, struct bheap_node* b); 29typedef int (*bheap_prio_t)(struct bheap_node* a, struct bheap_node* b);
@@ -43,14 +41,9 @@ static inline int bheap_empty(struct bheap* heap)
43 return heap->head == NULL && heap->min == NULL; 41 return heap->head == NULL && heap->min == NULL;
44} 42}
45 43
46//static inline unsigned int bheap_size(struct bheap* heap) 44typedef void (*bheap_for_each_t)(struct bheap_node* node, void* args);
47//{
48// return heap->size;
49//}
50
51typedef void (*bheap_for_all_t)(struct bheap_node* node, void* args);
52 45
53void bheap_for_all(struct bheap* heap, bheap_for_all_t fn, void* args); 46void bheap_for_each(struct bheap* heap, bheap_for_each_t fn, void* args);
54 47
55/* insert (and reinitialize) a node into the heap */ 48/* insert (and reinitialize) a node into the heap */
56void bheap_insert(bheap_prio_t higher_prio, 49void bheap_insert(bheap_prio_t higher_prio,