Lines Matching defs:Red
26 // A red-black tree, which is a form of a balanced binary tree. It
35 // The data type T that is stored in this red-black tree must be only
51 // Note that when complex types are stored in this red/black tree, it
63 // This red-black tree is designed to be _augmented_; subclasses can
69 // The design of this red-black tree comes from Cormen, Leiserson,
109 // Constructs a new red-black tree without allocating an arena.
122 // Constructs a new red-black tree, allocating temporary objects
134 // Constructs a new red-black tree, allocating temporary objects
247 Red = 1,
257 // Constructor. Newly-created nodes are colored red.
262 , m_color(Red)
306 // augmenting the red-black tree with additional per-node summary
409 // Helper for maintaining the augmented red-black tree.
420 // Red-Black tree operations
493 x->setColor(Red);
501 while (x != m_root && x->parent()->color() == Red) {
504 if (y && y->color() == Red) {
509 x->parent()->parent()->setColor(Red);
524 x->parent()->parent()->setColor(Red);
531 if (y && y->color() == Red) {
536 x->parent()->parent()->setColor(Red);
551 x->parent()->parent()->setColor(Red);
563 // Restores the red-black property to the tree after splicing out
573 // red-black tree.
576 if (w->color() == Red) {
579 xParent->setColor(Red);
586 w->setColor(Red);
593 w->setColor(Red);
613 // red-black tree.
616 if (w->color() == Red) {
619 xParent->setColor(Red);
626 w->setColor(Red);
633 w->setColor(Red);
759 // Each node is either red or black.
760 if (!(node->color() == Red || node->color() == Black))
765 if (node->color() == Red) {
805 builder.append((node->color() == Black) ? " (black)" : " (red)");
