Sprout/sprout/range/algorithm/next_union.hpp
2019-01-07 17:47:17 +09:00

54 lines
2 KiB
C++

/*=============================================================================
Copyright (c) 2011-2019 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_NEXT_UNION_HPP
#define SPROUT_RANGE_ALGORITHM_NEXT_UNION_HPP
#include <sprout/config.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/utility/forward.hpp>
#include <sprout/utility/pair/pair.hpp>
#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>
inline SPROUT_CONSTEXPR sprout::pair<
typename sprout::range::lvalue_iterator<InputRange1>::type,
typename sprout::range::lvalue_iterator<InputRange2>::type
>
next_union(InputRange1&& range1, InputRange2&& range2, Compare comp) {
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)),
comp
);
}
template<typename InputRange1, typename InputRange2>
inline SPROUT_CONSTEXPR sprout::pair<
typename sprout::range::lvalue_iterator<InputRange1>::type,
typename sprout::range::lvalue_iterator<InputRange2>::type
>
next_union(InputRange1&& range1, InputRange2&& range2) {
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))
);
}
} // namespace range
} // namespace sprout
#endif // #ifndef SPROUT_RANGE_ALGORITHM_NEXT_UNION_HPP