findNode()

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

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

inlineprivate

Definition at line 227 of file rbtree.h.

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

Referenced by fl::RedBlackTree< value_type, PairCompare, Allocator >::contains(), fl::RedBlackTree< value_type, PairCompare, Allocator >::count(), fl::RedBlackTree< value_type, PairCompare, Allocator >::erase(), fl::RedBlackTree< value_type, PairCompare, Allocator >::find(), and fl::RedBlackTree< value_type, PairCompare, Allocator >::find().

Here is the caller graph for this function: