upper_bound() [1/2]

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

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

inline

Definition at line 452 of file map.h.

                                         {
        iterator it = lower_bound(key);
        if (it != end() && it->first == key) {
            ++it;
        }
        return it;
    }

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

Here is the caller graph for this function: