Sprout/sprout/algorithm/fixed/set_intersection.hpp

144 lines
5.3 KiB
C++
Raw Normal View History

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>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
2011-10-22 12:25:25 +00:00
#include <sprout/iterator/operation.hpp>
2013-01-25 06:14:29 +00:00
#include <sprout/functional/less.hpp>
2011-09-03 13:26:26 +00:00
#include <sprout/algorithm/fixed/result_of.hpp>
2013-01-20 11:49:37 +00:00
#include <sprout/pit.hpp>
2011-10-28 14:28:24 +00:00
#include <sprout/detail/container_complate.hpp>
2011-09-01 02:48:32 +00:00
namespace sprout {
namespace fixed {
namespace detail {
template<typename InputIterator1, typename InputIterator2, typename Result, typename Compare, typename... Args>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size == sizeof...(Args),
2011-09-03 13:26:26 +00:00
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
set_intersection_impl(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result, Compare comp,
typename sprout::container_traits<Result>::size_type size,
2011-09-01 02:48:32 +00:00
Args const&... args
)
{
return sprout::remake<Result>(result, sprout::size(result), args...);
2011-09-01 02:48:32 +00:00
}
template<typename InputIterator1, typename InputIterator2, typename Result, typename Compare, typename... Args>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size != sizeof...(Args),
2011-09-03 13:26:26 +00:00
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
set_intersection_impl(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result, Compare comp,
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)
? 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)
? 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
? sprout::fixed::detail::set_intersection_impl(
first1, last1, sprout::next(first2), last2, result, comp,
size, args...
)
: sprout::detail::container_complate(result, args...)
2011-10-28 14:28:24 +00:00
: sprout::detail::container_complate(result, args...)
2011-09-01 02:48:32 +00:00
;
}
2013-01-25 06:14:29 +00:00
template<typename InputIterator1, typename InputIterator2, typename Result, typename Compare>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::is_fixed_container<Result>::value,
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
set_intersection(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result, Compare comp
)
{
return sprout::fixed::detail::set_intersection_impl(
first1, last1,
first2, last2,
result, comp,
sprout::size(result)
);
}
2011-09-01 02:48:32 +00:00
} // namespace detail
//
// set_intersection
//
template<typename InputIterator1, typename InputIterator2, typename Result, typename Compare>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
set_intersection(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result, Compare comp
2011-09-01 02:48:32 +00:00
)
{
2013-01-25 06:14:29 +00:00
return sprout::fixed::detail::set_intersection(first1, last1, first2, last2, result, comp);
2011-09-01 02:48:32 +00:00
}
template<typename InputIterator1, typename InputIterator2, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
set_intersection(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
2011-09-01 02:48:32 +00:00
Result const& result
)
{
2013-01-25 06:14:29 +00:00
return sprout::fixed::set_intersection(first1, last1, first2, last2, result, sprout::less<>());
2011-09-01 02:48:32 +00:00
}
2013-01-20 11:49:37 +00:00
template<typename Result, typename InputIterator1, typename InputIterator2, typename Compare>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
set_intersection(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Compare comp
)
{
return sprout::fixed::set_intersection(first1, last1, first2, last2, sprout::pit<Result>(), comp);
}
template<typename Result, typename InputIterator1, typename InputIterator2>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
set_intersection(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2
)
{
return sprout::fixed::set_intersection(first1, last1, first2, last2, sprout::pit<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