flightsimulatorplatfrom/pilotclient
1
0
Fork 0
mirror of https://github.com/swift-project/pilotclient.git synced 2026-04-01 21:56:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

Ref T464 Implement removal of one sequence from another in O(n),

Browse Source 
assuming that elements in both sequences are in the same order in both.
This commit is contained in:
Mat Sutcliffe
2018-12-11 17:12:09 +00:00
committed by Klaus Basan
parent 40ae7174a7
commit 71de01065b
4 changed files with 47 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
src/blackmisc/algorithm.h
View File

@@ -22,6 +22,27 @@
namespace BlackMisc
{
/*!
* Removes those elements in range 1 that appear also in range 2 leaving only those that
* do not appear in range 2. Returns an iterator one past the new end of range 1.
* \pre All the elements of range 2 must be present in the same order in range 1.
*/
template <typename I, typename J>
auto removeIfIn(I begin1, I end1, J begin2, J end2)
{
auto newEnd = end1;
std::for_each(begin2, end2, [&](const auto &rm)
{
const auto found = std::find(begin1, end1, rm);
Q_ASSERT(found != end1);
if (newEnd == end1) { newEnd = found; }
else { newEnd = std::move(begin1, found, newEnd); }
begin1 = std::next(found);
});
if (newEnd != end1) { newEnd = std::move(begin1, end1, newEnd); }
return newEnd;
}
namespace Private
{
//! \private A high quality deterministic pseudo-random number generator.