/*============================================================================= Copyright (c) 2011-2014 Bolero MURAKAMI Copyright (C) 2011 RiSK (sscrisk) https://github.com/bolero-MURAKAMI/Sprout Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) =============================================================================*/ #ifndef SPROUT_RANGE_ALGORITHM_FIND_END_HPP #define SPROUT_RANGE_ALGORITHM_FIND_END_HPP #include #include #include #include #include namespace sprout { namespace range { // 25.2.6 Find end template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type find_end(ForwardRange1&& range1, ForwardRange2&& range2) { return sprout::range::range_return::pack( sprout::find_end( sprout::begin(sprout::forward(range1)), sprout::end(sprout::forward(range1)), sprout::begin(sprout::forward(range2)), sprout::end(sprout::forward(range2)) ), sprout::forward(range1) ); } template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type find_end(ForwardRange1&& range1, ForwardRange2&& range2, BinaryPredicate pred) { return sprout::range::range_return::pack( sprout::find_end( sprout::begin(sprout::forward(range1)), sprout::end(sprout::forward(range1)), sprout::begin(sprout::forward(range2)), sprout::end(sprout::forward(range2)), pred ), sprout::forward(range1) ); } template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type find_end(ForwardRange1&& range1, ForwardRange2&& range2) { return sprout::range::range_return::pack( sprout::find_end( sprout::begin(sprout::forward(range1)), sprout::end(sprout::forward(range1)), sprout::begin(sprout::forward(range2)), sprout::end(sprout::forward(range2)) ), sprout::forward(range1) ); } template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type find_end(ForwardRange1&& range1, ForwardRange2&& range2, BinaryPredicate pred) { return sprout::range::range_return::pack( sprout::find_end( sprout::begin(sprout::forward(range1)), sprout::end(sprout::forward(range1)), sprout::begin(sprout::forward(range2)), sprout::end(sprout::forward(range2)), pred ), sprout::forward(range1) ); } } // namespace range } // namespace sprout #endif // #ifndef SPROUT_RANGE_ALGORITHM_FIND_END_HPP