lower_bound() [1/2]

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

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

inline

Definition at line 365 of file map.h.

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

Referenced by fl::SortedHeapMap< uint32_t, FramePtr, Less >::upper_bound(), and fl::SortedHeapMap< uint32_t, FramePtr, Less >::upper_bound().

Here is the caller graph for this function: