| 1 |
#ifndef INCLUDED_JARED_SETUTILS_H |
| 2 |
#define INCLUDED_JARED_SETUTILS_H |
| 3 |
|
| 4 |
#include <vector> |
| 5 |
|
| 6 |
template<class bseq_a, class bseq_b, class bseq_c, class ForwardIterator_a, class ForwardIterator_b> |
| 7 |
void set_comparison( |
| 8 |
bseq_a& left, |
| 9 |
bseq_b& right, |
| 10 |
bseq_c& common, |
| 11 |
ForwardIterator_a lhs_first, |
| 12 |
ForwardIterator_a lhs_end, |
| 13 |
ForwardIterator_b rhs_first, |
| 14 |
ForwardIterator_b rhs_end |
| 15 |
) |
| 16 |
{ |
| 17 |
// int a = 0, b = 0; |
| 18 |
|
| 19 |
ForwardIterator_a a = lhs_first; |
| 20 |
ForwardIterator_b b = rhs_first; |
| 21 |
|
| 22 |
// while(a < lhs.size() && b < rhs.size()) |
| 23 |
while(a != lhs_end && b != rhs_end) |
| 24 |
{ |
| 25 |
// if (lhs[a] < rhs[b]) |
| 26 |
if (*a < *b) |
| 27 |
{ |
| 28 |
// left.push_back(lhs[a]); |
| 29 |
left.push_back(*a); |
| 30 |
++a; |
| 31 |
} |
| 32 |
// else if (lhs[a] == rhs[b]) |
| 33 |
else if (*a == *b) |
| 34 |
{ |
| 35 |
// common.push_back(lhs[a]); |
| 36 |
common.push_back(*a); |
| 37 |
++a; |
| 38 |
++b; |
| 39 |
} |
| 40 |
else // lhs[a] > rhs[b] |
| 41 |
{ |
| 42 |
// right.push_back(rhs[b]); |
| 43 |
right.push_back(*b); |
| 44 |
++b; |
| 45 |
} |
| 46 |
} |
| 47 |
|
| 48 |
for(; a != lhs_end;++a) |
| 49 |
{ |
| 50 |
left.push_back(*a); |
| 51 |
} |
| 52 |
|
| 53 |
for(; b < rhs_end;++b) |
| 54 |
{ |
| 55 |
right.push_back(*b); |
| 56 |
} |
| 57 |
} |
| 58 |
|
| 59 |
#endif // INCLUDED_JARED_SETUTILS_H |