mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-12-25 21:35:41 +00:00
92 lines
3 KiB
C++
92 lines
3 KiB
C++
|
#ifndef SPROUT_ALGORITHM_FIT_SET_INTERSECTION_HPP
|
||
|
|
#define SPROUT_ALGORITHM_FIT_SET_INTERSECTION_HPP
|
||
|
|
|
||
|
|
#include <sprout/config.hpp>
|
||
|
|
#include <sprout/fixed_container/traits.hpp>
|
||
|
|
#include <sprout/fixed_container/functions.hpp>
|
||
|
|
#include <sprout/algorithm/fixed/set_intersection.hpp>
|
||
|
|
#include <sprout/algorithm/fit/result_of.hpp>
|
||
|
|
#include <sprout/sub_array.hpp>
|
||
|
|
#include <sprout/detail/overlap_count_2.hpp>
|
||
|
|
#include HDR_ALGORITHM_SSCRISK_CEL_OR_SPROUT_DETAIL
|
||
|
|
|
||
|
|
namespace sprout {
|
||
|
|
namespace fit {
|
||
|
|
namespace detail {
|
||
|
|
template<typename Iterator1, typename Iterator2, typename Result, typename Compare>
|
||
|
|
SPROUT_CONSTEXPR inline typename sprout::fit::result_of::algorithm<Result>::type set_intersection_impl(
|
||
|
|
Iterator1 first1,
|
||
|
|
Iterator1 last1,
|
||
|
|
Iterator2 first2,
|
||
|
|
Iterator2 last2,
|
||
|
|
Result const& result,
|
||
|
|
Compare comp,
|
||
|
|
typename sprout::fixed_container_traits<Result>::difference_type offset
|
||
|
|
)
|
||
|
|
{
|
||
|
|
return sprout::sub_copy(
|
||
|
|
sprout::get_fixed(sprout::fixed::set_intersection(first1, last1, first2, last2, result, comp)),
|
||
|
|
offset,
|
||
|
|
offset + NS_SSCRISK_CEL_OR_SPROUT_DETAIL::min(
|
||
|
|
sprout::detail::overlap_count_2(first1, last1, first2, last2, comp),
|
||
|
|
sprout::size(result)
|
||
|
|
)
|
||
|
|
);
|
||
|
|
}
|
||
|
|
} // namespace detail
|
||
|
|
//
|
||
|
|
// set_intersection
|
||
|
|
//
|
||
|
|
template<typename Iterator1, typename Iterator2, typename Result, typename Compare>
|
||
|
|
SPROUT_CONSTEXPR inline typename sprout::fit::result_of::algorithm<Result>::type set_intersection(
|
||
|
|
Iterator1 first1,
|
||
|
|
Iterator1 last1,
|
||
|
|
Iterator2 first2,
|
||
|
|
Iterator2 last2,
|
||
|
|
Result const& result,
|
||
|
|
Compare comp
|
||
|
|
)
|
||
|
|
{
|
||
|
|
return sprout::fit::detail::set_intersection_impl(first1, last1, first2, last2, result, comp, sprout::fixed_begin_offset(result));
|
||
|
|
}
|
||
|
|
|
||
|
|
namespace detail {
|
||
|
|
template<typename Iterator1, typename Iterator2, typename Result>
|
||
|
|
SPROUT_CONSTEXPR inline typename sprout::fit::result_of::algorithm<Result>::type set_intersection_impl(
|
||
|
|
Iterator1 first1,
|
||
|
|
Iterator1 last1,
|
||
|
|
Iterator2 first2,
|
||
|
|
Iterator2 last2,
|
||
|
|
Result const& result,
|
||
|
|
typename sprout::fixed_container_traits<Result>::difference_type offset
|
||
|
|
)
|
||
|
|
{
|
||
|
|
return sprout::sub_copy(
|
||
|
|
sprout::get_fixed(sprout::fixed::set_intersection(first1, last1, first2, last2, result)),
|
||
|
|
offset,
|
||
|
|
offset + NS_SSCRISK_CEL_OR_SPROUT_DETAIL::min(
|
||
|
|
sprout::detail::overlap_count_2(first1, last1, first2, last2),
|
||
|
|
sprout::size(result)
|
||
|
|
)
|
||
|
|
);
|
||
|
|
}
|
||
|
|
} // namespace detail
|
||
|
|
//
|
||
|
|
// set_intersection
|
||
|
|
//
|
||
|
|
template<typename Iterator1, typename Iterator2, typename Result>
|
||
|
|
SPROUT_CONSTEXPR inline typename sprout::fit::result_of::algorithm<Result>::type set_intersection(
|
||
|
|
Iterator1 first1,
|
||
|
|
Iterator1 last1,
|
||
|
|
Iterator2 first2,
|
||
|
|
Iterator2 last2,
|
||
|
|
Result const& result
|
||
|
|
)
|
||
|
|
{
|
||
|
|
return sprout::fit::detail::set_intersection_impl(first1, last1, first2, last2, result, sprout::fixed_begin_offset(result));
|
||
|
|
}
|
||
|
|
} // namespace fit
|
||
|
|
} // namespace sprout
|
||
|
|
|
||
|
|
#endif // #ifndef SPROUT_ALGORITHM_FIT_SET_INTERSECTION_HPP
|