59 #define heap_sift(h, i, cmp)						\  argument
66 		    cmp((h)->data[_r], (h)->data[_r + 1]))		\
69 		if (cmp((h)->data[_r], (h)->data[_j]))			\
75 #define heap_sift_down(h, i, cmp)					\  argument
79 		if (cmp((h)->data[i], (h)->data[p]))			\
86 #define heap_add(h, d, cmp)						\  argument
93 		heap_sift_down(h, _i, cmp);				\
94 		heap_sift(h, _i, cmp);					\
99 #define heap_pop(h, d, cmp)						\  argument
106 		heap_sift(h, 0, cmp);					\
473 #define RB_INSERT(root, new, member, cmp)				\  argument
483 		res = cmp(new, this);					\
498 #define RB_SEARCH(root, search, member, cmp)				\  argument
506 		res = cmp(&(search), this);				\
518 #define RB_GREATER(root, search, member, cmp)				\  argument
526 		res = cmp(&(search), this);				\