mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-11-14 10:39:05 +00:00
99 lines
3.8 KiB
C++
99 lines
3.8 KiB
C++
/*=============================================================================
|
|
Copyright (c) 2011-2013 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_ALGORITHM_FIT_SET_INTERSECTION_HPP
|
|
#define SPROUT_ALGORITHM_FIT_SET_INTERSECTION_HPP
|
|
|
|
#include <sprout/config.hpp>
|
|
#include <sprout/container/traits.hpp>
|
|
#include <sprout/container/functions.hpp>
|
|
#include <sprout/algorithm/fixed/set_union.hpp>
|
|
#include <sprout/algorithm/fit/result_of.hpp>
|
|
#include <sprout/sub_array/sub_array.hpp>
|
|
#include <sprout/sub_array/sub.hpp>
|
|
#include <sprout/detail/algorithm/set_overlap_count.hpp>
|
|
#include <sprout/iterator/type_traits/category.hpp>
|
|
|
|
namespace sprout {
|
|
namespace fit {
|
|
namespace detail {
|
|
template<typename InputIterator1, typename InputIterator2, typename Result, typename Compare>
|
|
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
|
|
set_intersection_impl(
|
|
InputIterator1 first1, InputIterator1 last1,
|
|
InputIterator2 first2, InputIterator2 last2,
|
|
Result const& result, Compare comp,
|
|
typename sprout::container_traits<Result>::difference_type offset
|
|
)
|
|
{
|
|
return sprout::sub_copy(
|
|
sprout::get_internal(sprout::fixed::set_intersection(first1, last1, first2, last2, result, comp)),
|
|
offset,
|
|
offset + sprout::fit_size(
|
|
result, sprout::detail::set_overlap_count(first1, last1, first2, last2, comp)
|
|
)
|
|
);
|
|
}
|
|
} // namespace detail
|
|
//
|
|
// set_intersection
|
|
//
|
|
template<typename InputIterator1, typename InputIterator2, typename Result, typename Compare>
|
|
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
|
|
set_intersection(
|
|
InputIterator1 first1, InputIterator1 last1,
|
|
InputIterator2 first2, InputIterator2 last2,
|
|
Result const& result, Compare comp
|
|
)
|
|
{
|
|
static_assert(
|
|
sprout::is_forward_iterator<InputIterator1>::value && sprout::is_forward_iterator<InputIterator2>::value,
|
|
"Sorry, not implemented."
|
|
);
|
|
return sprout::fit::detail::set_intersection_impl(first1, last1, first2, last2, result, comp, sprout::internal_begin_offset(result));
|
|
}
|
|
|
|
namespace detail {
|
|
template<typename InputIterator1, typename InputIterator2, typename Result>
|
|
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
|
|
set_intersection_impl(
|
|
InputIterator1 first1, InputIterator1 last1,
|
|
InputIterator2 first2, InputIterator2 last2,
|
|
Result const& result,
|
|
typename sprout::container_traits<Result>::difference_type offset
|
|
)
|
|
{
|
|
return sprout::sub_copy(
|
|
sprout::get_internal(sprout::fixed::set_intersection(first1, last1, first2, last2, result)),
|
|
offset,
|
|
offset + sprout::fit_size(
|
|
result, sprout::detail::set_overlap_count(first1, last1, first2, last2)
|
|
)
|
|
);
|
|
}
|
|
} // namespace detail
|
|
//
|
|
// set_intersection
|
|
//
|
|
template<typename InputIterator1, typename InputIterator2, typename Result>
|
|
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
|
|
set_intersection(
|
|
InputIterator1 first1, InputIterator1 last1,
|
|
InputIterator2 first2, InputIterator2 last2,
|
|
Result const& result
|
|
)
|
|
{
|
|
static_assert(
|
|
sprout::is_forward_iterator<InputIterator1>::value && sprout::is_forward_iterator<InputIterator2>::value,
|
|
"Sorry, not implemented."
|
|
);
|
|
return sprout::fit::detail::set_intersection_impl(first1, last1, first2, last2, result, sprout::internal_begin_offset(result));
|
|
}
|
|
} // namespace fit
|
|
} // namespace sprout
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_FIT_SET_INTERSECTION_HPP
|