predecessor()

template<typename T, typename Compare = less<T>, typename Allocator = allocator_slab<char>>

RBNode * fl::RedBlackTree< T, Compare, Allocator >::reverse_iterator::predecessor ( RBNode * x ) const

inlineprivate

Definition at line 546 of file rbtree.h.

                                             {
            if (x == nullptr) return nullptr;
            if (x->left != nullptr) {
                return mTree->maximum(x->left);
            }
            RBNode* y = x->parent;
            while (y != nullptr && x == y->left) {
                x = y;
                y = y->parent;
            }
            return y;
        }

References mTree, fl::x, and fl::y.

Referenced by operator++().

Here is the caller graph for this function: