#ifndef SPROUT_RANGE_ALGORITHM_ADJACENT_FIND_HPP #define SPROUT_RANGE_ALGORITHM_ADJACENT_FIND_HPP #include #include #include #include #include namespace sprout { namespace range { // Copyright (C) 2011 RiSK (sscrisk) // 25.2.8 Adjacent find template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type adjacent_find(Range&& range) { return sprout::range::range_return::pack( sprout::adjacent_find( sprout::begin(sprout::forward(range)), sprout::end(sprout::forward(range)) ), sprout::forward(range) ); } template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type adjacent_find(Range&& range, BinaryPredicate pred) { return sprout::range::range_return::pack( sprout::adjacent_find( sprout::begin(sprout::forward(range)), sprout::end(sprout::forward(range)), pred ), sprout::forward(range) ); } template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type adjacent_find(Range&& range) { return sprout::range::range_return::pack( sprout::adjacent_find( sprout::begin(sprout::forward(range)), sprout::end(sprout::forward(range)) ), sprout::forward(range) ); } template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type adjacent_find(Range&& range, BinaryPredicate pred) { return sprout::range::range_return::pack( sprout::adjacent_find( sprout::begin(sprout::forward(range)), sprout::end(sprout::forward(range)), pred ), sprout::forward(range) ); } } // namespace range } // namespace sprout #endif // #ifndef SPROUT_RANGE_ALGORITHM_ADJACENT_FIND_HPP