/*============================================================================= Copyright (c) 2011 RiSK (sscrisk) https://github.com/sscrisk/CEL---ConstExpr-Library Copyright (c) 2011-2019 Bolero MURAKAMI 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_SEARCH_HPP #define SPROUT_RANGE_ALGORITHM_SEARCH_HPP #include #include #include #include #include namespace sprout { namespace range { // 25.2.13 Search template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type search(ForwardRange1&& range1, ForwardRange2&& range2) { return sprout::range::range_return::pack( sprout::search( sprout::begin(SPROUT_FORWARD(ForwardRange1, range1)), sprout::end(SPROUT_FORWARD(ForwardRange1, range1)), sprout::begin(SPROUT_FORWARD(ForwardRange2, range2)), sprout::end(SPROUT_FORWARD(ForwardRange2, range2)) ), SPROUT_FORWARD(ForwardRange1, range1) ); } template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type search(ForwardRange1&& range1, ForwardRange2&& range2, BinaryPredicate pred) { return sprout::range::range_return::pack( sprout::search( sprout::begin(SPROUT_FORWARD(ForwardRange1, range1)), sprout::end(SPROUT_FORWARD(ForwardRange1, range1)), sprout::begin(SPROUT_FORWARD(ForwardRange2, range2)), sprout::end(SPROUT_FORWARD(ForwardRange2, range2)), pred ), SPROUT_FORWARD(ForwardRange1, range1) ); } template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type search(ForwardRange1&& range1, ForwardRange2&& range2) { return sprout::range::range_return::pack( sprout::search( sprout::begin(SPROUT_FORWARD(ForwardRange1, range1)), sprout::end(SPROUT_FORWARD(ForwardRange1, range1)), sprout::begin(SPROUT_FORWARD(ForwardRange2, range2)), sprout::end(SPROUT_FORWARD(ForwardRange2, range2)) ), SPROUT_FORWARD(ForwardRange1, range1) ); } template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type search(ForwardRange1&& range1, ForwardRange2&& range2, BinaryPredicate pred) { return sprout::range::range_return::pack( sprout::search( sprout::begin(SPROUT_FORWARD(ForwardRange1, range1)), sprout::end(SPROUT_FORWARD(ForwardRange1, range1)), sprout::begin(SPROUT_FORWARD(ForwardRange2, range2)), sprout::end(SPROUT_FORWARD(ForwardRange2, range2)), pred ), SPROUT_FORWARD(ForwardRange1, range1) ); } // template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type search(ForwardRange&& range, Searcher const& searcher) { return sprout::range::range_return::pack( sprout::search( sprout::begin(SPROUT_FORWARD(ForwardRange, range)), sprout::end(SPROUT_FORWARD(ForwardRange, range)), searcher ), SPROUT_FORWARD(ForwardRange, range) ); } template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type search(ForwardRange&& range, Searcher const& searcher) { return sprout::range::range_return::pack( sprout::search( sprout::begin(SPROUT_FORWARD(ForwardRange, range)), sprout::end(SPROUT_FORWARD(ForwardRange, range)), searcher ), SPROUT_FORWARD(ForwardRange, range) ); } } // namespace range } // namespace sprout #endif // #ifndef SPROUT_RANGE_ALGORITHM_SEARCH_HPP