FastLED 3.9.15
Loading...
Searching...
No Matches

◆ 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.

546 {
547 if (x == nullptr) return nullptr;
548 if (x->left != nullptr) {
549 return mTree->maximum(x->left);
550 }
551 RBNode* y = x->parent;
552 while (y != nullptr && x == y->left) {
553 x = y;
554 y = y->parent;
555 }
556 return y;
557 }
const RedBlackTree * mTree
Definition rbtree.h:531

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

Referenced by operator++().

+ Here is the caller graph for this function: