lower_bound() [2/2]

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

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

inline

Definition at line 137 of file flat_set.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, key)) {
                first = it + 1;
                count -= step + 1;
            } else {
                count = step;
            }
        }
        return first;
    }

References count(), mData, mLess, and fl::step().

Here is the call graph for this function: