lower_bound() [2/2]

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

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

inline

Definition at line 690 of file rbtree.h.

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