mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-07-04 14:14:09 +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

41
sprout/algorithm/next_intersection.hpp Normal file
View file

@ -0,0 +1,41 @@
#ifndef SPROUT_ALGORITHM_NEXT_INTERSECTION_HPP
#define SPROUT_ALGORITHM_NEXT_INTERSECTION_HPP
#include <sprout/config.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/functional/less.hpp>
#include <sprout/utility/pair.hpp>
#include <sprout/algorithm/find_intersection.hpp>
namespace sprout {
//
// next_intersection
//
// recursion depth:
// O(log(N1+N2))
//
template<typename InputIterator1, typename InputIterator2, typename Compare>
inline SPROUT_CONSTEXPR sprout::pair<InputIterator1, InputIterator2>
next_intersection(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Compare comp
)
{
typedef sprout::pair<InputIterator1, InputIterator2> type;
return first1 == last1 || first2 == last2 ? type(last1, last2)
: sprout::find_intersection(sprout::next(first1), last1, sprout::next(first2), last2, comp)
;
}
template<typename InputIterator1, typename InputIterator2>
inline SPROUT_CONSTEXPR sprout::pair<InputIterator1, InputIterator2>
next_intersection(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2
)
{
return sprout::next_intersection(first1, last1, first2, last2, sprout::less<>());
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_NEXT_INTERSECTION_HPP