lower_bound() [2/2]

template<typename Key, typename Value, typename Less = fl::DefaultLess<Key>>

const_iterator fl::SortedHeapMap< Key, Value, Less >::lower_bound ( const Key & key ) const

inline

Definition at line 369 of file map.h.

                                                     {
        return data.lower_bound(Pair(key));
    }