62 #define heap_sift(h, i, cmp)						\  argument
69 		    cmp((h)->data[_r], (h)->data[_r + 1]))		\
72 		if (cmp((h)->data[_r], (h)->data[_j]))			\
78 #define heap_sift_down(h, i, cmp)					\  argument
82 		if (cmp((h)->data[i], (h)->data[p]))			\
89 #define heap_add(h, d, cmp)						\  argument
96 		heap_sift_down(h, _i, cmp);				\
97 		heap_sift(h, _i, cmp);					\
102 #define heap_pop(h, d, cmp)						\  argument
109 		heap_sift(h, 0, cmp);					\
480 #define RB_INSERT(root, new, member, cmp)				\  argument
490 		res = cmp(new, this);					\
505 #define RB_SEARCH(root, search, member, cmp)				\  argument
513 		res = cmp(&(search), this);				\
525 #define RB_GREATER(root, search, member, cmp)				\  argument
533 		res = cmp(&(search), this);				\