lower_bound() [1/2]

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

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

inline

Definition at line 685 of file rbtree.h.

                                                  {
        Node* n = lowerBoundNode(value);
        return n ? iterator(n, this) : end();
    }

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

Here is the caller graph for this function: