forked from Bitcoin-ABC/bitcoin-abc
-
Notifications
You must be signed in to change notification settings - Fork 28
/
span_tests.cpp
191 lines (145 loc) · 5.18 KB
/
span_tests.cpp
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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
// Copyright (c) 2022 The Bitcoin developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <span.h>
#include <test/check_assert.h>
#include <test/setup_common.h>
#include <boost/test/unit_test.hpp>
#include <vector>
BOOST_FIXTURE_TEST_SUITE(span_tests, BasicTestingSetup)
BOOST_AUTO_TEST_CASE(span_from_vector) {
const std::vector<uint8_t> vec{2, 3, 1};
auto span = Span(vec);
BOOST_CHECK_EQUAL(span.size(), 3);
BOOST_CHECK_EQUAL(span.front(), 2);
BOOST_CHECK_EQUAL(span.back(), 1);
BOOST_CHECK_EQUAL(span[1], 3);
BOOST_CHECK_EQUAL(&vec[1], &span[1]);
}
BOOST_AUTO_TEST_CASE(span_from_c_array) {
uint8_t array[]{5, 6, 4};
auto span = Span(array);
BOOST_CHECK_EQUAL(span.size(), 3);
BOOST_CHECK_EQUAL(span.front(), 5);
BOOST_CHECK_EQUAL(span.back(), 4);
BOOST_CHECK_EQUAL(span[1], 6);
BOOST_CHECK_EQUAL(&array[1], &span[1]);
}
BOOST_AUTO_TEST_CASE(span_pop) {
const std::vector<uint8_t> vec{7, 6, 5, 4, 3, 2, 1};
auto span = Span(vec);
BOOST_CHECK_EQUAL(span.pop_front(), 7);
BOOST_CHECK_EQUAL(span.size(), 6);
BOOST_CHECK_EQUAL(span.front(), 6);
BOOST_CHECK_EQUAL(span.back(), 1);
BOOST_CHECK_EQUAL(span.pop_back(), 1);
BOOST_CHECK_EQUAL(span.size(), 5);
BOOST_CHECK_EQUAL(span.front(), 6);
BOOST_CHECK_EQUAL(span.back(), 2);
BOOST_CHECK_EQUAL(span.pop_back(), 2);
BOOST_CHECK_EQUAL(span.size(), 4);
BOOST_CHECK_EQUAL(span.pop_back(), 3);
BOOST_CHECK_EQUAL(span.size(), 3);
BOOST_CHECK_EQUAL(span.pop_front(), 6);
BOOST_CHECK_EQUAL(span.size(), 2);
BOOST_CHECK_EQUAL(span.pop_back(), 4);
BOOST_CHECK_EQUAL(span.size(), 1);
BOOST_CHECK_EQUAL(span.front(), 5);
BOOST_CHECK_EQUAL(span.front(), span.back());
BOOST_CHECK_EQUAL(span.pop_back(), 5);
BOOST_CHECK_EQUAL(span.size(), 0);
BOOST_CHECK(span.empty());
// popping an empty span should fail an assert
BOOST_CHECK(CheckAssert([&]{span.pop_back();}) == CheckAssertResult::AssertEncountered);
BOOST_CHECK(CheckAssert([&]{span.pop_front();}) == CheckAssertResult::AssertEncountered);
BOOST_CHECK_EQUAL(span.size(), 0);
}
BOOST_AUTO_TEST_CASE(span_compare) {
{
// test equality operators
std::vector<uint8_t> vec{3, 2, 1};
uint8_t array[]{3, 2, 1};
auto span1 = Span(vec);
auto span2 = Span(array);
BOOST_CHECK(span1 == span2);
BOOST_CHECK_EQUAL(span1 != span2, false);
span1[1] = 123;
BOOST_CHECK(span1 != span2);
BOOST_CHECK_EQUAL(span1 == span2, false);
span2[1] = 123;
BOOST_CHECK(span1 == span2);
BOOST_CHECK_EQUAL(span1 != span2, false);
}
{
// test comparison operators
std::vector<uint8_t> vec1{1, 2, 3, 4, 5, 6};
std::vector<uint8_t> vec2{5, 5, 5, 5, 5, 5};
auto span1 = Span(vec1);
auto span2 = Span(vec2);
BOOST_CHECK(span1 < span2);
BOOST_CHECK(!(span1 > span2));
BOOST_CHECK(span1 <= span2);
BOOST_CHECK(!(span1 >= span2));
vec2 = {0, 0, 0, 0, 0, 1};
span2 = Span(vec2);
BOOST_CHECK(!(span1 < span2));
BOOST_CHECK(span1 > span2);
BOOST_CHECK(!(span1 <= span2));
BOOST_CHECK(span1 >= span2);
vec2 = {6, 5, 4, 3, 2, 1};
span2 = Span(vec2);
BOOST_CHECK(span1 < span2);
BOOST_CHECK(!(span1 > span2));
BOOST_CHECK(span1 <= span2);
BOOST_CHECK(!(span1 >= span2));
}
}
BOOST_AUTO_TEST_CASE(span_subspan) {
const std::vector<uint8_t> vec1{7, 6, 5, 4, 3, 2, 1};
const std::vector<uint8_t> vec2{ 6, 5, 4, 3 };
auto span1 = Span(vec1);
auto span2 = Span(vec2);
auto span3 = span1.subspan(1, 4);
BOOST_CHECK_EQUAL(span1.size(), 7);
BOOST_CHECK_EQUAL(span2.size(), 4);
BOOST_CHECK_EQUAL(span3.size(), 4);
BOOST_CHECK(span1 != span2);
BOOST_CHECK(span1 != span3);
BOOST_CHECK(span3 == span1.subspan(1, 4));
BOOST_CHECK(span3 == span2);
BOOST_CHECK(span1.subspan(0, 0).empty());
BOOST_CHECK_EQUAL(span1.pop_front(), 7);
BOOST_CHECK(span1.first(4) == span2);
BOOST_CHECK(span1.first(4).last(3) == span2.last(3));
BOOST_CHECK_EQUAL(span1.pop_back(), 1);
BOOST_CHECK_EQUAL(span1.pop_back(), 2);
BOOST_CHECK(span1 == span2);
BOOST_CHECK(span1 == span3);
// subspan out of bounds is UB as per std::span, so we don't test for that
}
BOOST_AUTO_TEST_CASE(span_iteration) {
const std::vector<uint8_t> vec{7, 6, 5, 4, 3, 2, 1};
auto span = Span(vec);
uint8_t val = 7;
for (auto const &it : span) {
BOOST_CHECK_EQUAL(it, val--);
}
}
BOOST_AUTO_TEST_CASE(span_corner_cases) {
{
// test empty span
const std::vector<uint8_t> vec;
auto span = Span(vec);
BOOST_CHECK_EQUAL(span.size(), 0);
BOOST_CHECK(span.empty());
}
{
// test large span
const std::vector<uint8_t> vec(1024 * 1024, 123);
auto span = Span(vec);
BOOST_CHECK(!span.empty());
BOOST_CHECK_EQUAL(span.size(), 1024 * 1024);
BOOST_CHECK_EQUAL(span[1023], 123);
}
}
BOOST_AUTO_TEST_SUITE_END()