lower_bound() [2/2]

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

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

inline

Definition at line 166 of file flat_map.h.

                                                     {
        // Binary search: find first element where !(element < key)
        iterator first = mData.begin();
        size_type count = mData.size();
 
        while (count > 0) {
            size_type step = count / 2;
            iterator it = first + step;
            if (mLess(it->first, key)) {
                first = it + 1;
                count -= step + 1;
            } else {
                count = step;
            }
        }
        return first;
    }

Referenced by fl::flat_map< int, FxPtr >::at(), fl::flat_map< int, FxPtr >::at(), fl::flat_map< int, FxPtr >::equal_range(), fl::flat_map< int, FxPtr >::equal_range(), fl::flat_map< int, FxPtr >::find(), fl::flat_map< int, FxPtr >::find(), fl::flat_map< int, FxPtr >::insert(), fl::flat_map< int, FxPtr >::insert(), fl::flat_map< int, FxPtr >::insert(), fl::flat_map< int, FxPtr >::insert(), and fl::flat_map< int, FxPtr >::operator[]().

Here is the caller graph for this function: