lower_bound() [2/2]

template<typename T, typename LessThan = fl::less<T>>

iterator fl::SortedHeapVector< T, LessThan >::lower_bound ( const T & value )

inline

Definition at line 1046 of file vector.h.

                                                     {
        iterator first = mArray.begin();
        iterator last = mArray.end();
        while (first != last) {
            iterator mid = first + (last - first) / 2;
            if (mLess(*mid, value)) {
                first = mid + 1;
            } else {
                last = mid;
            }
        }
        return first;
    }

References FL_NOEXCEPT, mArray, mLess, and fl::type_rank< T >::value.

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

Here is the caller graph for this function: