Sprout/sprout/range/algorithm/next_intersection.hpp

48 lines
1.6 KiB
C++
Raw Normal View History

2013-01-26 13:19:35 +00:00
#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>
2013-02-07 14:12:57 +00:00
#include <sprout/utility/pair/pair.hpp>
2013-01-26 13:19:35 +00:00
#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