2011-09-01 02:48:32 +00:00
|
|
|
#ifndef SPROUT_ALGORITHM_FIXED_SET_INTERSECTION_HPP
|
|
|
|
#define SPROUT_ALGORITHM_FIXED_SET_INTERSECTION_HPP
|
|
|
|
|
|
|
|
#include <type_traits>
|
|
|
|
#include <sprout/config.hpp>
|
2012-03-31 07:24:13 +00:00
|
|
|
#include <sprout/container/traits.hpp>
|
|
|
|
#include <sprout/container/functions.hpp>
|
2011-10-22 12:25:25 +00:00
|
|
|
#include <sprout/iterator/operation.hpp>
|
2011-09-03 13:26:26 +00:00
|
|
|
#include <sprout/algorithm/fixed/result_of.hpp>
|
2011-10-28 14:28:24 +00:00
|
|
|
#include <sprout/detail/container_complate.hpp>
|
2012-04-01 13:15:09 +00:00
|
|
|
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
|
2011-09-01 02:48:32 +00:00
|
|
|
|
|
|
|
namespace sprout {
|
|
|
|
namespace fixed {
|
|
|
|
namespace detail {
|
2011-10-07 07:40:45 +00:00
|
|
|
template<typename InputIterator1, typename InputIterator2, typename Result, typename Compare, typename... Args>
|
2012-04-04 13:23:41 +00:00
|
|
|
inline SPROUT_CONSTEXPR typename std::enable_if<
|
2012-03-31 07:24:13 +00:00
|
|
|
sprout::container_traits<Result>::static_size == sizeof...(Args),
|
2011-09-03 13:26:26 +00:00
|
|
|
typename sprout::fixed::result_of::algorithm<Result>::type
|
2011-10-28 14:28:24 +00:00
|
|
|
>::type set_intersection_impl(
|
2011-10-07 07:40:45 +00:00
|
|
|
InputIterator1 first1,
|
|
|
|
InputIterator1 last1,
|
|
|
|
InputIterator2 first2,
|
|
|
|
InputIterator2 last2,
|
2011-09-01 02:48:32 +00:00
|
|
|
Result const& result,
|
|
|
|
Compare comp,
|
2012-03-31 07:24:13 +00:00
|
|
|
typename sprout::container_traits<Result>::size_type size,
|
2011-09-01 02:48:32 +00:00
|
|
|
Args const&... args
|
|
|
|
)
|
|
|
|
{
|
2012-03-31 07:24:13 +00:00
|
|
|
return sprout::remake<Result>(result, sprout::size(result), args...);
|
2011-09-01 02:48:32 +00:00
|
|
|
}
|
2011-10-07 07:40:45 +00:00
|
|
|
template<typename InputIterator1, typename InputIterator2, typename Result, typename Compare, typename... Args>
|
2012-04-04 13:23:41 +00:00
|
|
|
inline SPROUT_CONSTEXPR typename std::enable_if<
|
2012-03-31 07:24:13 +00:00
|
|
|
sprout::container_traits<Result>::static_size != sizeof...(Args),
|
2011-09-03 13:26:26 +00:00
|
|
|
typename sprout::fixed::result_of::algorithm<Result>::type
|
2011-10-28 14:28:24 +00:00
|
|
|
>::type set_intersection_impl(
|
2011-10-07 07:40:45 +00:00
|
|
|
InputIterator1 first1,
|
|
|
|
InputIterator1 last1,
|
|
|
|
InputIterator2 first2,
|
|
|
|
InputIterator2 last2,
|
2011-09-01 02:48:32 +00:00
|
|
|
Result const& result,
|
|
|
|
Compare comp,
|
2012-03-31 07:24:13 +00:00
|
|
|
typename sprout::container_traits<Result>::size_type size,
|
2011-09-01 02:48:32 +00:00
|
|
|
Args const&... args
|
|
|
|
)
|
|
|
|
{
|
2011-10-28 14:28:24 +00:00
|
|
|
return sizeof...(Args) < size
|
2011-09-01 02:48:32 +00:00
|
|
|
? first1 != last1
|
|
|
|
? first2 != last2
|
|
|
|
? comp(*first1, *first2)
|
2011-10-28 14:28:24 +00:00
|
|
|
? sprout::fixed::detail::set_intersection_impl(sprout::next(first1), last1, first2, last2, result, comp, size, args...)
|
2011-09-01 02:48:32 +00:00
|
|
|
: comp(*first2, *first1)
|
2011-10-28 14:28:24 +00:00
|
|
|
? sprout::fixed::detail::set_intersection_impl(first1, last1, sprout::next(first2), last2, result, comp, size, args...)
|
|
|
|
: sprout::fixed::detail::set_intersection_impl(sprout::next(first1), last1, sprout::next(first2), last2, result, comp, size, args..., *first1)
|
|
|
|
: sprout::fixed::detail::set_intersection_impl(sprout::next(first1), last1, first2, last2, result, comp, size, args...)
|
2011-09-01 02:48:32 +00:00
|
|
|
: first2 != last2
|
2011-10-28 14:28:24 +00:00
|
|
|
? sprout::fixed::detail::set_intersection_impl(first1, last1, sprout::next(first2), last2, result, comp, size, args...)
|
|
|
|
: sprout::detail::container_complate(result, args...)
|
|
|
|
: sprout::detail::container_complate(result, args...)
|
2011-09-01 02:48:32 +00:00
|
|
|
;
|
|
|
|
}
|
|
|
|
} // namespace detail
|
|
|
|
//
|
|
|
|
// set_intersection
|
|
|
|
//
|
2011-10-07 07:40:45 +00:00
|
|
|
template<typename InputIterator1, typename InputIterator2, typename Result, typename Compare>
|
2012-04-04 13:23:41 +00:00
|
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type set_intersection(
|
2011-10-07 07:40:45 +00:00
|
|
|
InputIterator1 first1,
|
|
|
|
InputIterator1 last1,
|
|
|
|
InputIterator2 first2,
|
|
|
|
InputIterator2 last2,
|
2011-09-01 02:48:32 +00:00
|
|
|
Result const& result,
|
|
|
|
Compare comp
|
|
|
|
)
|
|
|
|
{
|
|
|
|
return sprout::fixed::detail::set_intersection_impl(
|
|
|
|
first1,
|
|
|
|
last1,
|
|
|
|
first2,
|
|
|
|
last2,
|
|
|
|
result,
|
2011-10-28 14:28:24 +00:00
|
|
|
comp,
|
|
|
|
sprout::size(result)
|
2011-09-01 02:48:32 +00:00
|
|
|
);
|
|
|
|
}
|
|
|
|
//
|
|
|
|
// set_intersection
|
|
|
|
//
|
2011-10-07 07:40:45 +00:00
|
|
|
template<typename InputIterator1, typename InputIterator2, typename Result>
|
2012-04-04 13:23:41 +00:00
|
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type set_intersection(
|
2011-10-07 07:40:45 +00:00
|
|
|
InputIterator1 first1,
|
|
|
|
InputIterator1 last1,
|
|
|
|
InputIterator2 first2,
|
|
|
|
InputIterator2 last2,
|
2011-09-01 02:48:32 +00:00
|
|
|
Result const& result
|
|
|
|
)
|
|
|
|
{
|
|
|
|
return sprout::fixed::detail::set_intersection_impl(
|
|
|
|
first1,
|
|
|
|
last1,
|
|
|
|
first2,
|
|
|
|
last2,
|
|
|
|
result,
|
2012-04-01 13:15:09 +00:00
|
|
|
NS_SSCRISK_CEL_OR_SPROUT::less<typename sprout::container_traits<Result>::value_type>(),
|
2011-10-28 14:28:24 +00:00
|
|
|
sprout::size(result)
|
2011-09-01 02:48:32 +00:00
|
|
|
);
|
|
|
|
}
|
|
|
|
} // namespace fixed
|
2011-09-03 13:26:26 +00:00
|
|
|
|
|
|
|
using sprout::fixed::set_intersection;
|
2011-09-01 02:48:32 +00:00
|
|
|
} // namespace sprout
|
|
|
|
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_FIXED_SET_INTERSECTION_HPP
|