1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
|
#include "iterator_range.h"
#include <library/cpp/testing/unittest/registar.h>
#include <util/generic/algorithm.h>
#include <util/generic/vector.h>
Y_UNIT_TEST_SUITE(IteratorRange) {
Y_UNIT_TEST(DefaultConstructor) {
TIteratorRange<int*> range;
UNIT_ASSERT(range.empty());
}
Y_UNIT_TEST(DefaultConstructorSentinel) {
TIteratorRange<int*, void*> range;
UNIT_ASSERT(range.empty());
}
Y_UNIT_TEST(RangeBasedForLoop) {
// compileability test
for (int i : TIteratorRange<int*>()) {
Y_UNUSED(i);
}
}
Y_UNIT_TEST(RangeBasedForLoopSentinel) {
// compileability test
for (int i : TIteratorRange<int*, void*>()) {
Y_UNUSED(i);
}
}
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());
}
Y_UNIT_TEST(WorksSentinel) {
struct TRangeSentinel {
};
struct TEnumerator {
ui32 operator*() const {
return Cur;
}
void operator++() {
++Cur;
}
bool operator!=(const TRangeSentinel&) const {
return Cur < End;
}
ui32 Cur;
ui32 End;
};
auto range = MakeIteratorRange(TEnumerator{0, 10}, TRangeSentinel{});
UNIT_ASSERT(!range.empty());
ui32 i = 0;
for (auto j : range) {
UNIT_ASSERT_VALUES_EQUAL(j, i++);
}
UNIT_ASSERT_VALUES_EQUAL(i, 10);
}
Y_UNIT_TEST(OperatorsAndReferences) {
TVector<size_t> values{1, 2, 3, 4, 5};
auto range = MakeIteratorRange(values.begin(), values.end());
UNIT_ASSERT_VALUES_EQUAL(range[2], 3);
UNIT_ASSERT_VALUES_EQUAL(range[range[2]], 4);
*values.begin() = 100500;
UNIT_ASSERT_VALUES_EQUAL(range[0], 100500);
range[0] = 100501;
UNIT_ASSERT_VALUES_EQUAL(range[0], 100501);
TVector<bool> valuesBool{false, true, false, false, false, false, true};
auto rangeBVector = MakeIteratorRange(valuesBool.begin(), valuesBool.end());
UNIT_ASSERT_VALUES_EQUAL(rangeBVector[1], true);
rangeBVector[0] = true;
valuesBool.back() = false;
UNIT_ASSERT_VALUES_EQUAL(rangeBVector[0], true);
UNIT_ASSERT_VALUES_EQUAL(rangeBVector[2], false);
UNIT_ASSERT_VALUES_EQUAL(rangeBVector[6], false);
}
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; }));
}
} // Y_UNIT_TEST_SUITE(IteratorRange)
|
