lower_bound() [1/2]

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

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

inline

Definition at line 444 of file map.h.

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

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

Here is the caller graph for this function: