1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-12-03 21:15:42 +00:00
Sprout/sprout/range/algorithm/fixed/set_intersection.hpp

58 lines
2.9 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
Copyright (c) 2011-2017 Bolero MURAKAMI
2013-08-08 09:54:33 +00:00
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)
=============================================================================*/
2011-09-01 02:48:32 +00:00
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_SET_INTERSECTION_HPP
#define SPROUT_RANGE_ALGORITHM_FIXED_SET_INTERSECTION_HPP
#include <sprout/config.hpp>
#include <sprout/container/functions.hpp>
2014-04-05 09:31:09 +00:00
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
#include <sprout/algorithm/fixed/results.hpp>
2011-09-01 02:48:32 +00:00
#include <sprout/algorithm/fixed/set_intersection.hpp>
namespace sprout {
namespace range {
namespace fixed {
//
// set_intersection
//
2014-04-05 09:31:09 +00:00
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
2013-02-03 16:10:26 +00:00
set_intersection(InputRange1 const& rng1, InputRange2 const& rng2, Result const& result, Compare comp) {
return sprout::fixed::set_intersection(sprout::begin(rng1), sprout::end(rng1), sprout::begin(rng2), sprout::end(rng2), result, comp);
2011-09-01 02:48:32 +00:00
}
2014-04-05 09:31:09 +00:00
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
2013-02-03 16:10:26 +00:00
set_intersection(InputRange1 const& rng1, InputRange2 const& rng2, Result const& result) {
return sprout::fixed::set_intersection(sprout::begin(rng1), sprout::end(rng1), sprout::begin(rng2), sprout::end(rng2), result);
2011-09-01 02:48:32 +00:00
}
2013-01-25 06:14:29 +00:00
2013-02-03 16:10:26 +00:00
template<typename Result, typename InputRange1, typename InputRange2, typename Compare>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
2013-02-03 16:10:26 +00:00
set_intersection(InputRange1 const& rng1, InputRange2 const& rng2, Compare comp) {
return sprout::fixed::set_intersection<Result>(sprout::begin(rng1), sprout::end(rng1), sprout::begin(rng2), sprout::end(rng2), comp);
2013-01-25 06:14:29 +00:00
}
2013-02-03 16:10:26 +00:00
template<typename Result, typename InputRange1, typename InputRange2>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
2013-02-03 16:10:26 +00:00
set_intersection(InputRange1 const& rng1, InputRange2 const& rng2) {
return sprout::fixed::set_intersection<Result>(sprout::begin(rng1), sprout::end(rng1), sprout::begin(rng2), sprout::end(rng2));
2013-01-25 06:14:29 +00:00
}
2011-09-01 02:48:32 +00:00
} // namespace fixed
2011-09-03 13:26:26 +00:00
using sprout::range::fixed::set_intersection;
2011-09-01 02:48:32 +00:00
} // namespace range
} // namespace sprout
#endif // #ifndef SPROUT_RANGE_ALGORITHM_FIXED_SET_INTERSECTION_HPP