Lines Matching refs:red

44 The algorithms taking _NodePtr are red black tree algorithms.  Those
46 points to a proper red black tree (unless otherwise specified).
71 // Determintes if the subtree rooted at __x is a proper red black subtree.  If
90     // If this is red, neither child can be red
106 // Determintes if the red black tree rooted at __root is a proper red black tree.
108 //    red black tree, else returns false.
369     // There is no need to rebalance if we removed a red, or if we removed
379         // If __x is red (in which case it can't be null), then it can absorb
382         //   is either red with no children, else null, otherwise __y would have
392             //     of 1 on the __w side (__w must be a non-null black or a red
428                     else  // __w has a red child
432                             // __w left child is non-null and red
440                         // __w has a right red child, left child may be null
480                     else  // __w has a red child
484                             // __w right child is non-null and red
492                         // __w has a left red child, right child may be null
1173 //    This is no longer a red-black tree