find() [2/2]

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

iterator fl::RedBlackTree< T, Compare, Allocator >::find ( const value_type & value )

inline

Definition at line 916 of file rbtree.h.

                                                        {
        RBNode* node = findNode(value);
        return node ? iterator(node, this) : end();
    }