lower_bound() [2/2]

template<typename Key, typename Value, typename Compare = less<Key>, typename Allocator = allocator_slab<char>>

const_iterator fl::MapRedBlackTree< Key, Value, Compare, Allocator >::lower_bound ( const Key & key ) const

inline

Definition at line 1365 of file rbtree.h.

                                                     {
        return mTree.lower_bound(value_type(key, Value()));
    }