lower_bound() [2/2]

template<typename Iterator, typename T, typename Compare>

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

Definition at line 551 of file algorithm.h.

                                                                                              {
    return detail::lower_bound_impl(first, last, value, comp);
}

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

Referenced by fl::detail::AlphaTrimmedMeanImpl< T, N >::update(), fl::detail::HampelFilterImpl< T, N >::update(), and fl::detail::MedianFilterImpl< T, N >::update().

Here is the call graph for this function:

Here is the caller graph for this function: