aboutsummaryrefslogtreecommitdiffstats
path: root/util/generic/algorithm_ut.cpp
diff options
context:
space:
mode:
authorbulatman <bulatman@yandex-team.ru>2022-02-10 16:45:50 +0300
committerDaniil Cherednik <dcherednik@yandex-team.ru>2022-02-10 16:45:50 +0300
commit6560e4993b14d193f8c879e33a3de5e5eba6e21d (patch)
treecfd2e2baa05c3196f2caacbb63c32e1df40bc3de /util/generic/algorithm_ut.cpp
parent7489e4682331202b9c7d863c0898eb83d7b12c2b (diff)
downloadydb-6560e4993b14d193f8c879e33a3de5e5eba6e21d.tar.gz
Restoring authorship annotation for <bulatman@yandex-team.ru>. Commit 1 of 2.
Diffstat (limited to 'util/generic/algorithm_ut.cpp')
-rw-r--r--util/generic/algorithm_ut.cpp62
1 files changed, 31 insertions, 31 deletions
diff --git a/util/generic/algorithm_ut.cpp b/util/generic/algorithm_ut.cpp
index 8d732fcc0c..9dd7632f5c 100644
--- a/util/generic/algorithm_ut.cpp
+++ b/util/generic/algorithm_ut.cpp
@@ -720,42 +720,42 @@ Y_UNIT_TEST_SUITE(TAlgorithm) {
}
Y_UNIT_TEST(TestTupleForEach) {
- ForEach(std::tuple<>{}, [&](auto) { UNIT_ASSERT(false); });
+ ForEach(std::tuple<>{}, [&](auto) { UNIT_ASSERT(false); });
auto t = std::make_tuple(5, 6, 2, 3, 6);
ForEach(t, [](auto& v) { v *= -1; });
UNIT_ASSERT_EQUAL(t, std::make_tuple(-5, -6, -2, -3, -6));
}
- Y_UNIT_TEST(TestTupleAllOf) {
- UNIT_ASSERT(AllOf(std::tuple<>{}, [](auto) { return false; }));
- UNIT_ASSERT(!AllOf(std::make_tuple(1, 2, 0, 4, 5), [&](auto v) { UNIT_ASSERT_LT(v, 3); return 0 != v; }));
- UNIT_ASSERT(AllOf(std::make_tuple(1, 2, 3, 4, 5), [](auto v) { return 0 != v; }));
- {
- auto pred = std::function<bool(int)>([x = TVector<int>(1, 0)](auto v) { return x.front() != v; });
- UNIT_ASSERT(AllOf(std::make_tuple(1, 2), pred));
- UNIT_ASSERT(AllOf(std::make_tuple(1, 2), pred));
- }
- {
- auto ts = std::make_tuple(TString{"foo"}, TString{"bar"});
- auto pred = [](auto s) { return s.size() == 3; };
- UNIT_ASSERT_VALUES_EQUAL(AllOf(ts, pred), AllOf(ts, pred));
- }
- }
-
- Y_UNIT_TEST(TestTupleAnyOf) {
- UNIT_ASSERT(!AnyOf(std::tuple<>{}, [](auto) { return true; }));
- UNIT_ASSERT(AnyOf(std::make_tuple(0, 1, 2, 3, 4), [&](auto v) { UNIT_ASSERT_LT(v, 2); return 1 == v; }));
- UNIT_ASSERT(AnyOf(std::make_tuple(1, 2, 3, 4, 5), [](auto v) { return 5 == v; }));
- auto pred = std::function<bool(int)>([x = TVector<int>(1, 0)](auto v) { return x.front() == v; });
- UNIT_ASSERT(!AnyOf(std::make_tuple(1, 2), pred));
- UNIT_ASSERT(!AnyOf(std::make_tuple(1, 2), pred));
- {
- auto ts = std::make_tuple(TString{"f"}, TString{"bar"});
- auto pred = [](auto s) { return s.size() == 3; };
- UNIT_ASSERT_VALUES_EQUAL(AnyOf(ts, pred), AnyOf(ts, pred));
- }
- }
-
+ Y_UNIT_TEST(TestTupleAllOf) {
+ UNIT_ASSERT(AllOf(std::tuple<>{}, [](auto) { return false; }));
+ UNIT_ASSERT(!AllOf(std::make_tuple(1, 2, 0, 4, 5), [&](auto v) { UNIT_ASSERT_LT(v, 3); return 0 != v; }));
+ UNIT_ASSERT(AllOf(std::make_tuple(1, 2, 3, 4, 5), [](auto v) { return 0 != v; }));
+ {
+ auto pred = std::function<bool(int)>([x = TVector<int>(1, 0)](auto v) { return x.front() != v; });
+ UNIT_ASSERT(AllOf(std::make_tuple(1, 2), pred));
+ UNIT_ASSERT(AllOf(std::make_tuple(1, 2), pred));
+ }
+ {
+ auto ts = std::make_tuple(TString{"foo"}, TString{"bar"});
+ auto pred = [](auto s) { return s.size() == 3; };
+ UNIT_ASSERT_VALUES_EQUAL(AllOf(ts, pred), AllOf(ts, pred));
+ }
+ }
+
+ Y_UNIT_TEST(TestTupleAnyOf) {
+ UNIT_ASSERT(!AnyOf(std::tuple<>{}, [](auto) { return true; }));
+ UNIT_ASSERT(AnyOf(std::make_tuple(0, 1, 2, 3, 4), [&](auto v) { UNIT_ASSERT_LT(v, 2); return 1 == v; }));
+ UNIT_ASSERT(AnyOf(std::make_tuple(1, 2, 3, 4, 5), [](auto v) { return 5 == v; }));
+ auto pred = std::function<bool(int)>([x = TVector<int>(1, 0)](auto v) { return x.front() == v; });
+ UNIT_ASSERT(!AnyOf(std::make_tuple(1, 2), pred));
+ UNIT_ASSERT(!AnyOf(std::make_tuple(1, 2), pred));
+ {
+ auto ts = std::make_tuple(TString{"f"}, TString{"bar"});
+ auto pred = [](auto s) { return s.size() == 3; };
+ UNIT_ASSERT_VALUES_EQUAL(AnyOf(ts, pred), AnyOf(ts, pred));
+ }
+ }
+
Y_UNIT_TEST(FindIfForContainer) {
using std::begin;
using std::end;