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 <iostream>
#include <boost/sort/sort.hpp>
#include "external/minunit.h"
#include "append_vector.h"
using namespace AppendVectorNS;
MU_TEST(test_append_vector) {
AppendVector<int32_t> vec;
AppendVector<int32_t> vec2;
mu_check(vec.size() == 0);
mu_check(vec.begin() == vec.end());
mu_check(vec.begin() != vec2.begin());
for (int i = 0; i < 10000; i++) {
vec.push_back(i);
}
mu_check(vec.size() == 10000);
mu_check(vec[25] == 25);
const AppendVector<int32_t>::Iterator& it = vec.begin();
mu_check(*it == 0);
mu_check(*(it + 1) == 1);
mu_check(*(it + 2) == 2);
mu_check(*(it + 9000) == 9000);
mu_check(*(it + 1 - 1) == 0);
mu_check(*(vec.end() + -1) == 9999);
mu_check(*(vec.end() - 1) == 9999);
mu_check(*(vec.end() - 2) == 9998);
mu_check(*(vec.end() - 9000) == 1000);
mu_check(*(vec.begin() - -1) == 1);
boost::sort::block_indirect_sort(
vec.begin(),
vec.end(),
[](auto const &a, auto const&b) { return b < a; },
1
);
mu_check(vec[0] == 9999);
mu_check(vec[9999] == 0);
boost::sort::block_indirect_sort(
vec.begin(),
vec.end(),
[](auto const &a, auto const&b) { return a < b; },
1
);
mu_check(vec[0] == 0);
mu_check(vec[9999] == 9999);
auto iter = std::lower_bound(
vec.begin(),
vec.end(),
123,
[](const int32_t& a, const int32_t& toFind) {
return a < toFind;
}
);
mu_check(iter != vec.end());
mu_check(*iter == 123);
iter = std::lower_bound(
vec.begin(),
vec.end(),
123123,
[](const int32_t& a, const int32_t& toFind) {
return a < toFind;
}
);
mu_check(iter == vec.end());
iter = std::lower_bound(
vec.begin(),
vec.end(),
-2,
[](const int32_t& a, const int32_t& toFind) {
return a < toFind;
}
);
mu_check(iter == vec.begin());
}
MU_TEST_SUITE(test_suite_append_vector) {
MU_RUN_TEST(test_append_vector);
}
int main() {
MU_RUN_SUITE(test_suite_append_vector);
MU_REPORT();
return MU_EXIT_CODE;
}
|
