mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-07-12 14:54:10 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

support STL container: set operation algorithms

Browse source
This commit is contained in:
bolero-MURAKAMI 2013-01-26 21:30:29 +09:00
parent ee8602f6a3
commit 271f348972
17 changed files with 1488 additions and 76 deletions
Download patch file Download diff file Expand all files Collapse all files

113
sprout/algorithm/find_intersection.hpp Normal file
View file

@ -0,0 +1,113 @@
#ifndef SPROUT_ALGORITHM_FIND_INTERSECTION_HPP
#define SPROUT_ALGORITHM_FIND_INTERSECTION_HPP
#include <iterator>
#include <type_traits>
#include <sprout/config.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/tuple/tuple.hpp>
#include <sprout/functional/less.hpp>
#include <sprout/utility/pair.hpp>
namespace sprout {
namespace detail {
template<typename InputIterator1, typename InputIterator2>
inline SPROUT_CONSTEXPR sprout::pair<InputIterator1, InputIterator2>
find_intersection_impl_check(
sprout::tuples::tuple<InputIterator1, InputIterator2, bool> const& current,
InputIterator1 last1, InputIterator2 last2
)
{
return sprout::tuples::get<2>(current)
? sprout::pair<InputIterator1, InputIterator2>(
sprout::tuples::get<0>(current),
sprout::tuples::get<1>(current)
)
: sprout::pair<InputIterator1, InputIterator2>(last1, last2)
;
}
template<typename InputIterator1, typename InputIterator2, typename Compare>
inline SPROUT_CONSTEXPR sprout::tuples::tuple<InputIterator1, InputIterator2, bool>
find_intersection_impl_1(
sprout::tuples::tuple<InputIterator1, InputIterator2, bool> const& current,
InputIterator1 last1, InputIterator2 last2, Compare comp, typename std::iterator_traits<InputIterator1>::difference_type n
)
{
typedef sprout::tuples::tuple<InputIterator1, InputIterator2, bool> type;
return sprout::tuples::get<2>(current) || sprout::tuples::get<0>(current) == last1 || sprout::tuples::get<1>(current) == last2 ? current
: n == 1 ? comp(*sprout::tuples::get<0>(current), *sprout::tuples::get<1>(current))
? type(sprout::next(sprout::tuples::get<0>(current)), sprout::tuples::get<1>(current), false)
: comp(*sprout::tuples::get<1>(current), *sprout::tuples::get<0>(current))
? type(sprout::tuples::get<0>(current), sprout::next(sprout::tuples::get<1>(current)), false)
: type(sprout::tuples::get<0>(current), sprout::tuples::get<1>(current), true)
: sprout::detail::find_intersection_impl_1(
sprout::detail::find_intersection_impl_1(
current,
last1, last2, comp, n / 2
),
last1, last2, comp, n - n / 2
)
;
}
template<typename InputIterator1, typename InputIterator2, typename Compare>
inline SPROUT_CONSTEXPR sprout::tuples::tuple<InputIterator1, InputIterator2, bool>
find_intersection_impl(
sprout::tuples::tuple<InputIterator1, InputIterator2, bool> const& current,
InputIterator1 last1, InputIterator2 last2, Compare comp, typename std::iterator_traits<InputIterator1>::difference_type n
)
{
typedef sprout::tuples::tuple<InputIterator1, InputIterator2, bool> type;
return sprout::tuples::get<2>(current) || sprout::tuples::get<0>(current) == last1 || sprout::tuples::get<1>(current) == last2 ? current
: sprout::detail::find_intersection_impl(
sprout::detail::find_intersection_impl_1(
current,
last1, last2, comp, n
),
last1, last2, comp, n * 2
)
;
}
template<typename InputIterator1, typename InputIterator2, typename Compare>
inline SPROUT_CONSTEXPR sprout::pair<InputIterator1, InputIterator2>
find_intersection(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Compare comp
)
{
typedef sprout::tuples::tuple<InputIterator1, InputIterator2, bool> type;
return sprout::detail::find_intersection_impl_check(
sprout::detail::find_intersection_impl(type(first1, first2, false), last1, last2, comp, 1),
last1, last2
);
}
} // namespace detail
//
// find_intersection
//
// recursion depth:
// O(log N)
//
template<typename InputIterator1, typename InputIterator2, typename Compare>
inline SPROUT_CONSTEXPR sprout::pair<InputIterator1, InputIterator2>
find_intersection(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Compare comp
)
{
return sprout::detail::find_intersection(first1, last1, first2, last2, comp);
}
template<typename InputIterator1, typename InputIterator2>
inline SPROUT_CONSTEXPR sprout::pair<InputIterator1, InputIterator2>
find_intersection(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2
)
{
return sprout::find_intersection(first1, last1, first2, last2, sprout::less<>());
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIND_INTERSECTION_HPP