/*============================================================================= Copyright (c) 2011-2014 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_FIND_INTERSECTION_HPP #define SPROUT_RANGE_ALGORITHM_FIND_INTERSECTION_HPP #include #include #include #include #include #include namespace sprout { namespace range { // // find_intersection // template inline SPROUT_CONSTEXPR sprout::pair< typename sprout::range::lvalue_iterator::type, typename sprout::range::lvalue_iterator::type > find_intersection(InputRange1&& range1, InputRange2&& range2, Compare comp) { return sprout::find_intersection( sprout::begin(SPROUT_FORWARD(InputRange1, range1)), sprout::end(SPROUT_FORWARD(InputRange1, range1)), sprout::begin(SPROUT_FORWARD(InputRange2, range2)), sprout::end(SPROUT_FORWARD(InputRange2, range2)), comp ); } template inline SPROUT_CONSTEXPR sprout::pair< typename sprout::range::lvalue_iterator::type, typename sprout::range::lvalue_iterator::type > find_intersection(InputRange1&& range1, InputRange2&& range2) { return sprout::find_intersection( sprout::begin(SPROUT_FORWARD(InputRange1, range1)), sprout::end(SPROUT_FORWARD(InputRange1, range1)), sprout::begin(SPROUT_FORWARD(InputRange2, range2)), sprout::end(SPROUT_FORWARD(InputRange2, range2)) ); } } // namespace range } // namespace sprout #endif // #ifndef SPROUT_RANGE_ALGORITHM_FIND_INTERSECTION_HPP