lower_bound() [1/2]

template<typename Iterator, typename T>

Iterator fl::lower_bound	(	Iterator	first,
		Iterator	last,
		const T &	value )

Definition at line 556 of file algorithm.h.

                                                                                {
    typedef typename fl::remove_reference<decltype(*first)>::type value_type;
    return detail::lower_bound_impl(first, last, value,
        [](const value_type& a, const T& b) { return a < b; });
}

References FL_NOEXCEPT, fl::detail::lower_bound_impl(), and type_rank< T >::value.

Here is the call graph for this function: