Sprout/sprout/range/algorithm/next_union.hpp

48 lines
1.7 KiB
C++
Raw Normal View History

2013-01-26 13:19:35 +00:00
#ifndef SPROUT_RANGE_ALGORITHM_NEXT_UNION_HPP
#define SPROUT_RANGE_ALGORITHM_NEXT_UNION_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_union.hpp>
namespace sprout {
namespace range {
//
// next_union
//
template<typename InputRange1, typename InputRange2, typename Compare>
2013-01-26 13:19:35 +00:00
inline SPROUT_CONSTEXPR sprout::pair<
typename sprout::range::lvalue_iterator<InputRange1>::type,
typename sprout::range::lvalue_iterator<InputRange2>::type
2013-01-26 13:19:35 +00:00
>
next_union(InputRange1&& range1, InputRange2&& range2, Compare comp) {
2013-01-26 13:19:35 +00:00
return sprout::next_union(
sprout::begin(sprout::forward<InputRange1>(range1)),
sprout::end(sprout::forward<InputRange1>(range1)),
sprout::begin(sprout::forward<InputRange2>(range2)),
sprout::end(sprout::forward<InputRange2>(range2)),
2013-01-26 13:19:35 +00:00
comp
);
}
template<typename InputRange1, typename InputRange2>
2013-01-26 13:19:35 +00:00
inline SPROUT_CONSTEXPR sprout::pair<
typename sprout::range::lvalue_iterator<InputRange1>::type,
typename sprout::range::lvalue_iterator<InputRange2>::type
2013-01-26 13:19:35 +00:00
>
next_union(InputRange1&& range1, InputRange2&& range2) {
2013-01-26 13:19:35 +00:00
return sprout::next_union(
sprout::begin(sprout::forward<InputRange1>(range1)),
sprout::end(sprout::forward<InputRange1>(range1)),
sprout::begin(sprout::forward<InputRange2>(range2)),
sprout::end(sprout::forward<InputRange2>(range2))
2013-01-26 13:19:35 +00:00
);
}
} // namespace range
} // namespace sprout
#endif // #ifndef SPROUT_RANGE_ALGORITHM_NEXT_UNION_HPP