-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest_main.cpp
212 lines (178 loc) · 6.84 KB
/
test_main.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
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
#include "filter.h"
#define BOOST_TEST_MODULE test_main
#include <boost/test/unit_test.hpp>
using namespace std;
BOOST_AUTO_TEST_SUITE(test_suite_main)
//Тест для проверки нахождения ip адресов, у которых 1-ый байт равен 1
BOOST_AUTO_TEST_CASE(Filter_1_byte){
vector<vector<string>>pool_ip = {
{"0","6","10","1"},
{"1","7","1","1"},
{"4","6","10","1"},
{"1","60","10","1"},
{"15","2","4","7"},
{"8","4","3","200"}
};
vector<vector<string>>reference = {
{"1","7","1","1"},
{"1","60","10","1"}
};
//Что бы проверить равенство векторов, у которых одинаковые элементы, но упорядочены
//не по порядку, надо сначала их отсортировать
sort(reference.begin(), reference.end());
//проверяем нашу функцию
vector<vector<string>> result = filter(pool_ip, 1);
//сортируем результируемый вектор
sort(result.begin(), result.end());
for(auto test_el:reference){
static int j=0;
BOOST_CHECK_EQUAL_COLLECTIONS(test_el.begin(), test_el.end(), result[j].begin(), result[j].end());
++j;
}
}
//Тест для проверки нахождения ip адресов, у которых 1-ый байт и 2-ой байт равны 100 и 10
//соответственно
BOOST_AUTO_TEST_CASE(Filter_1_2_bytes){
vector<vector<string>>pool_ip = {
{"0","6","10","1"},
{"100","10","1","1"},
{"4","6","10","1"},
{"1","60","10","1"},
{"15","2","4","7"},
{"100","10","6","7"},
{"8","4","3","200"}
};
vector<vector<string>>reference = {
{"100","10","1","1"},
{"100","10","6","7"}
};
//Что бы проверить равенство векторов, у которых одинаковые элементы, но упорядочены
//не по порядку, надо сначала их отсортировать
sort(reference.begin(), reference.end());
//проверяем нашу функцию
vector<vector<string>> result = filter(pool_ip, 100,10);
//сортируем результируемый вектор
sort(result.begin(), result.end());
for(auto test_el:reference){
static int j=0;
BOOST_CHECK_EQUAL_COLLECTIONS(test_el.begin(), test_el.end(), result[j].begin(), result[j].end());
++j;
}
}
//Тест для проверки нахождения ip адресов, у которых 1-ый байт, 2-ой
//и 3-ий байты равны 7, 10 и 4 соответственно
BOOST_AUTO_TEST_CASE(Filter_1_2_3_bytes){
vector<vector<string>>pool_ip = {
{"0","6","10","1"},
{"100","10","1","1"},
{"7","10","4","1"},
{"1","60","10","1"},
{"15","2","4","7"},
{"100","10","6","7"},
{"7","10","4","66"},
{"8","4","3","200"}
};
vector<vector<string>>reference = {
{"7","10","4","1"},
{"7","10","4","66"}
};
//Что бы проверить равенство векторов, у которых одинаковые элементы, но упорядочены
//не по порядку, надо сначала их отсортировать
sort(reference.begin(), reference.end());
//проверяем нашу функцию
vector<vector<string>> result = filter(pool_ip, 7,10, 4);
//сортируем результируемый вектор
sort(result.begin(), result.end());
for(auto test_el:reference){
static int j=0;
BOOST_CHECK_EQUAL_COLLECTIONS(test_el.begin(), test_el.end(), result[j].begin(), result[j].end());
++j;
}
}
//Тест для проверки нахождения ip адреса
BOOST_AUTO_TEST_CASE(Find_ip){
vector<vector<string>>pool_ip = {
{"0","6","10","1"},
{"100","10","1","1"},
{"7","10","4","1"},
{"1","60","10","1"},
{"15","2","4","7"},
{"100","10","6","7"},
{"7","10","4","66"},
{"8","4","3","200"}
};
vector<vector<string>>reference = {
{"7","10","4","1"},
};
//Что бы проверить равенство векторов, у которых одинаковые элементы, но упорядочены
//не по порядку, надо сначала их отсортировать
sort(reference.begin(), reference.end());
//проверяем нашу функцию
vector<vector<string>> result = filter(pool_ip, 7, 10, 4, 1);
//сортируем результируемый вектор
sort(result.begin(), result.end());
for(auto test_el:reference){
static int j=0;
BOOST_CHECK_EQUAL_COLLECTIONS(test_el.begin(), test_el.end(), result[j].begin(), result[j].end());
++j;
}
}
//Тест для проверки компаратора для функции qsort
BOOST_AUTO_TEST_CASE(Compare){
vector<vector<string>>pool_ip = {
{"0","6","10","1"},
{"100","10","1","1"},
{"7","10","4","1"},
{"1","60","10","1"},
{"15","2","4","7"},
{"100","10","6","7"},
{"7","10","4","66"},
{"8","4","3","200"}
};
vector<vector<string>>reference = {
{"0","6","10","1"},
{"1","60","10","1"},
{"7","10","4","1"},
{"7","10","4","66"},
{"8","4","3","200"},
{"15","2","4","7"},
{"100","10","1","1"},
{"100","10","6","7"},
};
//проверяем нашу функцию
qsort(&pool_ip[0], pool_ip.size(), sizeof(vector<string>), compare);
for(auto test_el:reference){
static int j=0;
BOOST_CHECK_EQUAL_COLLECTIONS(test_el.begin(), test_el.end(), pool_ip[j].begin(), pool_ip[j].end());
++j;
}
}
//Тест для проверки функции filter_any. Находим ip адреса, где присутствует байт, равный 1
BOOST_AUTO_TEST_CASE(Filter_any){
vector<vector<string>>pool_ip = {
{"0","6","10","1"},
{"100","10","1","1"},
{"7","10","4","1"},
{"1","60","10","1"},
{"15","2","4","7"},
{"100","10","6","7"},
{"7","10","4","66"},
{"8","4","3","200"}
};
vector<vector<string>>reference = {
{"0","6","10","1"},
{"1","60","10","1"},
{"7","10","4","1"},
{"100","10","1","1"},
};
sort(reference.begin(), reference.end());
//проверяем нашу функцию
vector<vector<string>>result = filter_any(pool_ip, 1);
sort(result.begin(), result.end());
for(auto test_el:reference){
static int j=0;
BOOST_CHECK_EQUAL_COLLECTIONS(test_el.begin(), test_el.end(), result[j].begin(), result[j].end());
++j;
}
}
BOOST_AUTO_TEST_SUITE_END()