126 struct pqueue {  struct
127 	using entry_traits = pqueue_entry_traits<queue_t, entry_t>;  argument
130 	pack_child(entry_t e, const entry_t child)  in pack_child()
139 	unpack_child(entry_t e)  in unpack_child()
149 	merge_parent_is_subtree_b(queue_t que, entry_t subtree_a, entry_t subtree_b)  in merge_parent_is_subtree_b()
158 	merge_pair_inline(queue_t que, entry_t subtree_a, entry_t subtree_b)  in merge_pair_inline()
189 	merge_pair(queue_t que, entry_t subtree_a, entry_t subtree_b)  in merge_pair()
196 	meld_pair(queue_t que, entry_t elt)  in meld_pair()
237 	list_clear(entry_t e)  in list_clear()
243 	list_remove(entry_t elt)  in list_remove()
262 	sift_down(queue_t que, entry_t elt)  in sift_down()
287 	sift_up(queue_t que, entry_t elt)  in sift_up()
300 	remove_non_root(queue_t que, entry_t elt)  in remove_non_root()
333 		entry_t head = que->pq_root;
334 		entry_t tail = head;
337 			entry_t child_list = unpack_child(head);
345 			entry_t elt = head;
355 	insert(queue_t que, entry_t elt, bool clear = true)  in insert()
365 	remove_root(queue_t que, entry_t old_root)  in remove_root()
379 	remove(queue_t que, entry_t elt)  in remove()
413 #define PRIORITY_QUEUE_MAKE_IMPL(pqueue_t, queue_t, entry_t)                    \  argument
415 using pqueue_t = pqueue<queue_t, entry_t>;                                      \  argument