2014-04-06 09:37:06 +00:00
|
|
|
/*=============================================================================
|
2019-01-07 08:47:17 +00:00
|
|
|
Copyright (c) 2011-2019 Bolero MURAKAMI
|
2014-04-06 09:37:06 +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)
|
|
|
|
=============================================================================*/
|
|
|
|
#ifndef SPROUT_ALGORITHM_CXX14_SET_INTERSECTION_HPP
|
|
|
|
#define SPROUT_ALGORITHM_CXX14_SET_INTERSECTION_HPP
|
|
|
|
|
|
|
|
#include <sprout/config.hpp>
|
|
|
|
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
|
|
|
|
#include <sprout/type_traits/enabler_if.hpp>
|
|
|
|
#include <sprout/functional/less.hpp>
|
|
|
|
|
|
|
|
namespace sprout {
|
|
|
|
//
|
|
|
|
// 25.4.5.3 set_intersection
|
|
|
|
//
|
|
|
|
template<
|
|
|
|
typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Compare,
|
|
|
|
typename sprout::enabler_if<sprout::is_iterator_outputable<OutputIterator>::value>::type = sprout::enabler
|
|
|
|
>
|
|
|
|
inline SPROUT_CXX14_CONSTEXPR OutputIterator
|
|
|
|
set_intersection(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp) {
|
|
|
|
while (first1 != last1 && first2 != last2) {
|
|
|
|
if (comp(*first1, *first2)) {
|
|
|
|
++first1;
|
|
|
|
} else if (comp(*first2, *first1)) {
|
|
|
|
++first2;
|
|
|
|
} else {
|
|
|
|
*result = *first1;
|
|
|
|
++first1;
|
|
|
|
++first2;
|
|
|
|
++result;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
template<
|
|
|
|
typename InputIterator1, typename InputIterator2, typename OutputIterator,
|
|
|
|
typename sprout::enabler_if<sprout::is_iterator_outputable<OutputIterator>::value>::type = sprout::enabler
|
|
|
|
>
|
|
|
|
inline SPROUT_CXX14_CONSTEXPR OutputIterator
|
|
|
|
set_intersection(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result) {
|
|
|
|
return sprout::set_intersection(
|
|
|
|
first1, last1, first2, last2, result,
|
|
|
|
sprout::less<>()
|
|
|
|
);
|
|
|
|
}
|
|
|
|
} // namespace sprout
|
|
|
|
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_CXX14_SET_INTERSECTION_HPP
|