From 831b84a6fd7fda254a9eeece8f27275c3cf9ff66 Mon Sep 17 00:00:00 2001 From: Tobias Hunger Date: Tue, 9 Jan 2018 15:32:47 +0100 Subject: Utils: Add take 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 --- tests/auto/algorithm/tst_algorithm.cpp | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) (limited to 'tests/auto/algorithm/tst_algorithm.cpp') diff --git a/tests/auto/algorithm/tst_algorithm.cpp b/tests/auto/algorithm/tst_algorithm.cpp index 87e3b7ecbd..88845d7e01 100644 --- a/tests/auto/algorithm/tst_algorithm.cpp +++ b/tests/auto/algorithm/tst_algorithm.cpp @@ -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 v {1, 3, 5, 6, 7, 8, 9, 11, 13, 15, 13, 16, 17}; + Utils::optional r1 = Utils::take(v, [](const Struct &s) { return s.member == 13; }); + QVERIFY(r1); + QCOMPARE(r1.value(), 13); + Utils::optional r2 = Utils::take(v, [](const Struct &s) { return s.member == 13; }); + QVERIFY(r2); + QCOMPARE(r2.value(), 13); + Utils::optional r3 = Utils::take(v, [](const Struct &s) { return s.member == 13; }); + QVERIFY(!r3); + + Utils::optional r4 = Utils::take(v, &Struct::isEven); + QVERIFY(r4); + QCOMPARE(r4.value(), 6); + } + { + QList v {0, 0, 0, 0, 0, 0, 1, 2, 3}; + Utils::optional r1 = Utils::take(v, &Struct::member); + QVERIFY(r1); + QCOMPARE(r1.value(), 1); + } +} + QTEST_MAIN(tst_Algorithm) #include "tst_algorithm.moc" -- cgit v1.2.1