lower_bound() [2/2]

template<typename Key, typename Value, typename Compare = less<Key>, typename Allocator = allocator<fl::pair<Key, Value>>>

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

inline

Definition at line 442 of file multi_map.h.

                                                     {
        ValueWithId search_key(value_type(key, Value()), 0);
        return const_iterator(mTree.lower_bound(search_key));
    }