feedc0de/qt-creator
1
0
Fork 0
forked from qt-creator/qt-creator
Code Pull Requests Activity

Utils: Add take

Browse Source 
Add a new algorithmn to take the first match in a container out of the container.

It takes a pointer to something and will try to match against a smart pointer
stored in the container. Besides that it also accepts the usual like a predicate,
member variable or member function.

Change-Id: I4aabd4d43aa076a534da6488d0f9c3695ba79c09
Reviewed-by: Eike Ziller <eike.ziller@qt.io>
This commit is contained in:
Tobias Hunger
2018-01-09 15:32:47 +01:00
parent f873ad54e1
commit 831b84a6fd
2 changed files with 59 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
tests/auto/algorithm/tst_algorithm.cpp
View File

@@ -50,6 +50,7 @@ private slots:
void findOrDefault();
void toRawPointer();
void toReferences();
void take();
};
@@ -612,6 +613,31 @@ void tst_Algorithm::toReferences()
}
}
void tst_Algorithm::take()
{
{
QList<Struct> v {1, 3, 5, 6, 7, 8, 9, 11, 13, 15, 13, 16, 17};
Utils::optional<Struct> r1 = Utils::take(v, [](const Struct &s) { return s.member == 13; });
QVERIFY(r1);
QCOMPARE(r1.value(), 13);
Utils::optional<Struct> r2 = Utils::take(v, [](const Struct &s) { return s.member == 13; });
QVERIFY(r2);
QCOMPARE(r2.value(), 13);
Utils::optional<Struct> r3 = Utils::take(v, [](const Struct &s) { return s.member == 13; });
QVERIFY(!r3);
Utils::optional<Struct> r4 = Utils::take(v, &Struct::isEven);
QVERIFY(r4);
QCOMPARE(r4.value(), 6);
}
{
QList<Struct> v {0, 0, 0, 0, 0, 0, 1, 2, 3};
Utils::optional<Struct> r1 = Utils::take(v, &Struct::member);
QVERIFY(r1);
QCOMPARE(r1.value(), 1);
}
}
QTEST_MAIN(tst_Algorithm)
#include "tst_algorithm.moc"