lowerBoundNode()

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

RBNode * fl::RedBlackTree< T, Compare, Allocator >::lowerBoundNode ( const value_type & value ) const

inlineprivate

Definition at line 303 of file rbtree.h.

                                                          {
        RBNode* current = mRoot;
        RBNode* result = nullptr;
        while (current != nullptr) {
            if (!mComp(current->data, value)) {
                result = current;
                current = current->left;
            } else {
                current = current->right;
            }
        }
        return result;
    }

Referenced by fl::RedBlackTree< value_type, PairCompare, Allocator >::lower_bound(), and fl::RedBlackTree< value_type, PairCompare, Allocator >::lower_bound().

Here is the caller graph for this function: