GothenburgBitFactory/timewarrior
1
0
Fork 0
mirror of https://github.com/GothenburgBitFactory/timewarrior.git synced 2025-07-07 20:06:39 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

Common: Refactored listDiff

Browse source
This commit is contained in:
Paul Beckingham 2015-12-22 08:57:35 -05:00
parent f637a10078
commit a0b5db4c89
1 changed files with 8 additions and 32 deletions
Download patch file Download diff file Expand all files Collapse all files

40
src/common/text.h
View file

@ -28,6 +28,7 @@
#define INCLUDED_TEXT
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
@ -75,39 +76,14 @@ template <class T> void listDiff (
const T& left, const T& right, T& leftOnly, T& rightOnly)
{
leftOnly.clear ();
for (auto& l : left)
if (std::find (right.begin (), right.end (), l) == right.end ())
leftOnly.push_back (l);
rightOnly.clear ();
for (unsigned int l = 0; l < left.size (); ++l)
{
bool found = false;
for (unsigned int r = 0; r < right.size (); ++r)
{
if (left[l] == right[r])
{
found = true;
break;
}
}
if (!found)
leftOnly.push_back (left[l]);
}
for (unsigned int r = 0; r < right.size (); ++r)
{
bool found = false;
for (unsigned int l = 0; l < left.size (); ++l)
{
if (left[l] == right[r])
{
found = true;
break;
}
}
if (!found)
rightOnly.push_back (right[r]);
}
for (auto& r : right)
if (std::find (left.begin (), left.end (), r) == left.end ())
rightOnly.push_back (r);
}
#endif