mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-11-14 10:39:05 +00:00
48 lines
1.6 KiB
C++
48 lines
1.6 KiB
C++
|
#ifndef SPROUT_RANGE_ALGORITHM_NEXT_INTERSECTION_HPP
|
||
|
#define SPROUT_RANGE_ALGORITHM_NEXT_INTERSECTION_HPP
|
||
|
|
||
|
#include <sprout/config.hpp>
|
||
|
#include <sprout/container/functions.hpp>
|
||
|
#include <sprout/utility/forward.hpp>
|
||
|
#include <sprout/utility/pair.hpp>
|
||
|
#include <sprout/range/type_traits/lvalue_iterator.hpp>
|
||
|
#include <sprout/algorithm/next_intersection.hpp>
|
||
|
|
||
|
namespace sprout {
|
||
|
namespace range {
|
||
|
//
|
||
|
// next_intersection
|
||
|
//
|
||
|
template<typename Range1, typename Range2, typename Compare>
|
||
|
inline SPROUT_CONSTEXPR sprout::pair<
|
||
|
typename sprout::range::lvalue_iterator<Range1>::type,
|
||
|
typename sprout::range::lvalue_iterator<Range2>::type
|
||
|
>
|
||
|
next_intersection(Range1&& range1, Range2&& range2, Compare comp) {
|
||
|
return sprout::next_intersection(
|
||
|
sprout::begin(sprout::forward<Range1>(range1)),
|
||
|
sprout::end(sprout::forward<Range1>(range1)),
|
||
|
sprout::begin(sprout::forward<Range2>(range2)),
|
||
|
sprout::end(sprout::forward<Range2>(range2)),
|
||
|
comp
|
||
|
);
|
||
|
}
|
||
|
|
||
|
template<typename Range1, typename Range2>
|
||
|
inline SPROUT_CONSTEXPR sprout::pair<
|
||
|
typename sprout::range::lvalue_iterator<Range1>::type,
|
||
|
typename sprout::range::lvalue_iterator<Range2>::type
|
||
|
>
|
||
|
next_intersection(Range1&& range1, Range2&& range2) {
|
||
|
return sprout::next_intersection(
|
||
|
sprout::begin(sprout::forward<Range1>(range1)),
|
||
|
sprout::end(sprout::forward<Range1>(range1)),
|
||
|
sprout::begin(sprout::forward<Range2>(range2)),
|
||
|
sprout::end(sprout::forward<Range2>(range2))
|
||
|
);
|
||
|
}
|
||
|
} // namespace range
|
||
|
} // namespace sprout
|
||
|
|
||
|
#endif // #ifndef SPROUT_RANGE_ALGORITHM_NEXT_INTERSECTION_HPP
|