lower_bound() [1/2]

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

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

inline

Definition at line 184 of file flat_map.h.

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