find()

template<typename Iterator, typename T>

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

Definition at line 212 of file algorithm.h.

                                                                         {
    while (first != last) {
        if (*first == value) {
            return first;
        }
        ++first;
    }
    return last;
}

References FL_NOEXCEPT, and type_rank< T >::value.

Referenced by fl::task::Executor::register_runner(), and fl::task::Executor::unregister_runner().

Here is the caller graph for this function: