hfscommon/headers/RedBlackTree.h

449     /* Iteratively search down the tree for the insertion point,      */\
452     /* the tree, assuming a sufficiently deep tree.                   */\
459 			/* This iteration does not move down the tree, due to the */\
532     /* Iterate down the tree, but always transform 2-nodes to 3- or   */\
705 a_prefix##new(a_tree_type *tree) {					\
706     rb_new(a_type, a_field, tree);					\
709 a_prefix##first(a_tree_type *tree) {					\
711     rb_first(a_type, a_field, tree, ret);				\
715 a_prefix##last(a_tree_type *tree) {					\
717     rb_last(a_type, a_field, tree, ret);				\
721 a_prefix##next(a_tree_type *tree, a_type *node) {			\
723     rb_next(a_type, a_field, a_cmp, tree, node, ret);			\
727 a_prefix##prev(a_tree_type *tree, a_type *node) {			\
729     rb_prev(a_type, a_field, a_cmp, tree, node, ret);			\
733 a_prefix##search(a_tree_type *tree, a_type *key) {			\
735     rb_search(a_type, a_field, a_cmp, tree, key, ret);			\
739 a_prefix##nsearch(a_tree_type *tree, a_type *key) {			\
741     rb_nsearch(a_type, a_field, a_cmp, tree, key, ret);			\
745 a_prefix##psearch(a_tree_type *tree, a_type *key) {			\
747     rb_psearch(a_type, a_field, a_cmp, tree, key, ret);			\
751 a_prefix##insert(a_tree_type *tree, a_type *node) {			\
752     rb_insert(a_type, a_field, a_cmp, tree, node);			\
755 a_prefix##remove(a_tree_type *tree, a_type *node) {			\
756     rb_remove(a_type, a_field, a_cmp, tree, node);			\
765  * Since the iterators cache a path down the tree, any tree modification may
781  * Note that this idiom is not advised if every iteration modifies the tree,
788     /* Compute the maximum possible tree depth (3X the black height). */\
817 /* Only use if modifying the tree during iteration. */
881     /* Compute the maximum possible tree depth (3X the black height). */\
905 /* Only use if modifying the tree during iteration. */