mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-12-25 21:35:41 +00:00
57 lines
2.8 KiB
C++
57 lines
2.8 KiB
C++
/*=============================================================================
|
|
Copyright (c) 2011-2015 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_FIXED_SET_UNION_HPP
|
|
#define SPROUT_RANGE_ALGORITHM_FIXED_SET_UNION_HPP
|
|
|
|
#include <sprout/config.hpp>
|
|
#include <sprout/container/functions.hpp>
|
|
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
|
|
#include <sprout/type_traits/enabler_if.hpp>
|
|
#include <sprout/algorithm/fixed/results.hpp>
|
|
#include <sprout/algorithm/fixed/set_union.hpp>
|
|
|
|
namespace sprout {
|
|
namespace range {
|
|
namespace fixed {
|
|
//
|
|
// set_union
|
|
//
|
|
template<
|
|
typename InputRange1, typename InputRange2, typename Result, typename Compare,
|
|
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
|
|
>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
|
set_union(InputRange1 const& rng1, InputRange2 const& rng2, Result const& result, Compare comp) {
|
|
return sprout::fixed::set_union(sprout::begin(rng1), sprout::end(rng1), sprout::begin(rng2), sprout::end(rng2), result, comp);
|
|
}
|
|
template<
|
|
typename InputRange1, typename InputRange2, typename Result,
|
|
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
|
|
>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
|
set_union(InputRange1 const& rng1, InputRange2 const& rng2, Result const& result) {
|
|
return sprout::fixed::set_union(sprout::begin(rng1), sprout::end(rng1), sprout::begin(rng2), sprout::end(rng2), result);
|
|
}
|
|
|
|
template<typename Result, typename InputRange1, typename InputRange2, typename Compare>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
|
set_union(InputRange1 const& rng1, InputRange2 const& rng2, Compare comp) {
|
|
return sprout::fixed::set_union<Result>(sprout::begin(rng1), sprout::end(rng1), sprout::begin(rng2), sprout::end(rng2), comp);
|
|
}
|
|
template<typename Result, typename InputRange1, typename InputRange2>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
|
set_union(InputRange1 const& rng1, InputRange2 const& rng2) {
|
|
return sprout::fixed::set_union<Result>(sprout::begin(rng1), sprout::end(rng1), sprout::begin(rng2), sprout::end(rng2));
|
|
}
|
|
} // namespace fixed
|
|
|
|
using sprout::range::fixed::set_union;
|
|
} // namespace range
|
|
} // namespace sprout
|
|
|
|
#endif // #ifndef SPROUT_RANGE_ALGORITHM_FIXED_SET_UNION_HPP
|