lower_bound() [1/2]

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

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

inline

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

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

Referenced by equal_range(), equal_range(), find(), find(), insert(), and insert().

Here is the call graph for this function:

Here is the caller graph for this function: