#ifndef SPROUT_RANGE_ALGORITHM_SEARCH_N_HPP #define SPROUT_RANGE_ALGORITHM_SEARCH_N_HPP #include #include #include #include #include namespace sprout { namespace range { // Copyright (C) 2011 RiSK (sscrisk) // 25.2.13 Search template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type search_n(ForwardRange&& range, Size count, T const& value) { return sprout::range::range_return::pack( sprout::search_n( sprout::begin(sprout::forward(range)), sprout::end(sprout::forward(range)), count, value ), sprout::forward(range) ); } template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type search_n(ForwardRange&& range, Size count, T const& value, BinaryPredicate pred) { return sprout::range::range_return::pack( sprout::search_n( sprout::begin(sprout::forward(range)), sprout::end(sprout::forward(range)), count, value, pred ), sprout::forward(range) ); } template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type search_n(ForwardRange&& range, Size count, T const& value) { return sprout::range::range_return::pack( sprout::search_n( sprout::begin(sprout::forward(range)), sprout::end(sprout::forward(range)), count, value ), sprout::forward(range) ); } template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type search_n(ForwardRange&& range, Size count, T const& value, BinaryPredicate pred) { return sprout::range::range_return::pack( sprout::search_n( sprout::begin(sprout::forward(range)), sprout::end(sprout::forward(range)), count, value, pred ), sprout::forward(range) ); } } // namespace range } // namespace sprout #endif // #ifndef SPROUT_RANGE_ALGORITHM_SEARCH_N_HPP