Sprout/sprout/algorithm/fit/set_intersection.hpp

92 lines
3.1 KiB
C++
Raw Normal View History

2011-09-03 13:26:26 +00:00
#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>
2011-09-03 13:26:26 +00:00
#include <sprout/algorithm/fixed/set_intersection.hpp>
#include <sprout/algorithm/fit/result_of.hpp>
#include <sprout/sub_array.hpp>
2012-06-23 23:22:12 +00:00
#include <sprout/detail/algorithm/set_overlap_count.hpp>
2012-04-01 13:15:09 +00:00
#include HDR_ALGORITHM_SSCRISK_CEL_OR_SPROUT
2011-09-03 13:26:26 +00:00
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,
2011-09-03 13:26:26 +00:00
Result const& result,
Compare comp,
typename sprout::container_traits<Result>::difference_type offset
2011-09-03 13:26:26 +00:00
)
{
return sprout::sub_copy(
sprout::get_internal(sprout::fixed::set_intersection(first1, last1, first2, last2, result, comp)),
2011-09-03 13:26:26 +00:00
offset,
2012-04-01 13:15:09 +00:00
offset + NS_SSCRISK_CEL_OR_SPROUT::min(
2012-06-23 04:22:50 +00:00
sprout::detail::set_overlap_count(first1, last1, first2, last2, comp),
2011-09-03 13:26:26 +00:00
sprout::size(result)
)
);
}
} // 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,
2011-09-03 13:26:26 +00:00
Result const& result,
Compare comp
)
{
return sprout::fit::detail::set_intersection_impl(first1, last1, first2, last2, result, comp, sprout::internal_begin_offset(result));
2011-09-03 13:26:26 +00:00
}
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,
2011-09-03 13:26:26 +00:00
Result const& result,
typename sprout::container_traits<Result>::difference_type offset
2011-09-03 13:26:26 +00:00
)
{
return sprout::sub_copy(
sprout::get_internal(sprout::fixed::set_intersection(first1, last1, first2, last2, result)),
2011-09-03 13:26:26 +00:00
offset,
2012-04-01 13:15:09 +00:00
offset + NS_SSCRISK_CEL_OR_SPROUT::min(
2012-06-23 04:22:50 +00:00
sprout::detail::set_overlap_count(first1, last1, first2, last2),
2011-09-03 13:26:26 +00:00
sprout::size(result)
)
);
}
} // 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,
2011-09-03 13:26:26 +00:00
Result const& result
)
{
return sprout::fit::detail::set_intersection_impl(first1, last1, first2, last2, result, sprout::internal_begin_offset(result));
2011-09-03 13:26:26 +00:00
}
} // namespace fit
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIT_SET_INTERSECTION_HPP