Lines Matching refs:black

63 The algorithms taking _NodePtr are red black tree algorithms.  Those
65 points to a proper red black tree (unless otherwise specified).
90 // Determines if the subtree rooted at __x is a proper red black subtree.  If
91 //    __x is a proper subtree, returns the black height (null counts as 1).  If
122     return __h + __x->__is_black_;  // return black height of this node
125 // Determines if the red black tree rooted at __root is a proper red black tree.
127 //    red black tree, else returns false.
139     // root must be black
413         // __x has an implicit black color (transferred from the removed __y)
416         //    to be black anyway, and if it is doubly black, then the double
419         //    the implicit black just by setting its color to black.
420         // Since __y was black and only had one child (which __x points to), __x
422         //   different black heights under left and right pointers.
428             //  Else __x isn't root, and is "doubly black", even though it may
430             //     see a black height >= 2 on the __x side and a black height
431             //     of 1 on the __w side (__w must be a non-null black or a red
432             //     with a non-null black child).
1585 //    This is no longer a red-black tree