summaryrefslogtreecommitdiffstats
path: root/util/generic/iterator_range_ut.cpp
diff options
context:
space:
mode:
authorstanly <[email protected]>2022-02-10 16:46:49 +0300
committerDaniil Cherednik <[email protected]>2022-02-10 16:46:49 +0300
commitcde218e65dfef5ce03a48d641fd8f7913cf17b2d (patch)
treed3349caea4095825a55b5ba24fe758067b29ce6f /util/generic/iterator_range_ut.cpp
parent9f813499b4ef585cb3c2bb93de93ef003daf4fc4 (diff)
Restoring authorship annotation for <[email protected]>. Commit 1 of 2.
Diffstat (limited to 'util/generic/iterator_range_ut.cpp')
-rw-r--r--util/generic/iterator_range_ut.cpp40
1 files changed, 20 insertions, 20 deletions
diff --git a/util/generic/iterator_range_ut.cpp b/util/generic/iterator_range_ut.cpp
index a7e3670ae10..e859c90b014 100644
--- a/util/generic/iterator_range_ut.cpp
+++ b/util/generic/iterator_range_ut.cpp
@@ -1,4 +1,4 @@
-#include "iterator_range.h"
+#include "iterator_range.h"
#include <library/cpp/testing/unittest/registar.h>
#include <util/generic/algorithm.h>
@@ -6,9 +6,9 @@
Y_UNIT_TEST_SUITE(IteratorRange) {
Y_UNIT_TEST(DefaultConstructor) {
- TIteratorRange<int*> range;
- UNIT_ASSERT(range.empty());
- }
+ TIteratorRange<int*> range;
+ UNIT_ASSERT(range.empty());
+ }
Y_UNIT_TEST(DefaultConstructorSentinel) {
TIteratorRange<int*, void*> range;
@@ -16,11 +16,11 @@ Y_UNIT_TEST_SUITE(IteratorRange) {
}
Y_UNIT_TEST(RangeBasedForLoop) {
- // compileability test
- for (int i : TIteratorRange<int*>()) {
- Y_UNUSED(i);
- }
- }
+ // compileability test
+ for (int i : TIteratorRange<int*>()) {
+ Y_UNUSED(i);
+ }
+ }
Y_UNIT_TEST(RangeBasedForLoopSentinel) {
// compileability test
@@ -30,11 +30,11 @@ Y_UNIT_TEST_SUITE(IteratorRange) {
}
Y_UNIT_TEST(Works) {
- const int values[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- auto range = MakeIteratorRange(values, values + Y_ARRAY_SIZE(values));
- UNIT_ASSERT_VALUES_EQUAL(range.size(), Y_ARRAY_SIZE(values));
- UNIT_ASSERT(Equal(range.begin(), range.end(), values));
- UNIT_ASSERT(!range.empty());
+ const int values[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
+ auto range = MakeIteratorRange(values, values + Y_ARRAY_SIZE(values));
+ UNIT_ASSERT_VALUES_EQUAL(range.size(), Y_ARRAY_SIZE(values));
+ UNIT_ASSERT(Equal(range.begin(), range.end(), values));
+ UNIT_ASSERT(!range.empty());
}
Y_UNIT_TEST(WorksSentinel) {
@@ -89,10 +89,10 @@ Y_UNIT_TEST_SUITE(IteratorRange) {
}
Y_UNIT_TEST(CanUseInAlgorithms) {
- const int values[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- auto range = MakeIteratorRange(values, values + Y_ARRAY_SIZE(values));
- // more like compileability test
- // we should be able to use TIteratorRange as a container parameter for standard algorithms
- UNIT_ASSERT(AllOf(range, [](int x) { return x > 0; }));
- }
+ const int values[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
+ auto range = MakeIteratorRange(values, values + Y_ARRAY_SIZE(values));
+ // more like compileability test
+ // we should be able to use TIteratorRange as a container parameter for standard algorithms
+ UNIT_ASSERT(AllOf(range, [](int x) { return x > 0; }));
+ }
}