64 #define heap_sift(h, i, cmp)						\  argument
71 		    cmp((h)->data[_r], (h)->data[_r + 1]))		\
74 		if (cmp((h)->data[_r], (h)->data[_j]))			\
80 #define heap_sift_down(h, i, cmp)					\  argument
84 		if (cmp((h)->data[i], (h)->data[p]))			\
91 #define heap_add(h, d, cmp)						\  argument
98 		heap_sift_down(h, _i, cmp);				\
99 		heap_sift(h, _i, cmp);					\
104 #define heap_pop(h, d, cmp)						\  argument
111 		heap_sift(h, 0, cmp);					\
485 #define RB_INSERT(root, new, member, cmp)				\  argument
495 		res = cmp(new, this);					\
510 #define RB_SEARCH(root, search, member, cmp)				\  argument
518 		res = cmp(&(search), this);				\
530 #define RB_GREATER(root, search, member, cmp)				\  argument
538 		res = cmp(&(search), this);				\