lower_bound_impl()

template<typename Iterator, typename T, typename Compare>

Iterator fl::detail::lower_bound_impl	(	Iterator	first,
		Iterator	last,
		const T &	value,
		Compare	comp )

Definition at line 447 of file algorithm.h.

                                                                                                    {
    auto count = last - first;
    while (count > 0) {
        auto step = count / 2;
        Iterator it = first + step;
        if (comp(*it, value)) {
            first = ++it;
            count -= step + 1;
        } else {
            count = step;
        }
    }
    return first;
}

References fl::FL_NO_EXCEPT, fl::step(), and fl::type_rank< T >::value.

Referenced by fl::adl_barrier::lower_bound(), fl::adl_barrier::lower_bound(), and merge_inplace().

Here is the call graph for this function:

Here is the caller graph for this function: