-
Notifications
You must be signed in to change notification settings - Fork 0
/
test.cpp
440 lines (364 loc) · 11.3 KB
/
test.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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
#include "stack.hpp"
#include "vector.hpp"
#include "map.hpp"
#include "pair.hpp"
#include <iostream>
#include <vector>
#include <stack>
#include <map>
#define FT_CONTAINER
// #define STD_CONTAINER
#ifdef FT_CONTAINER
typedef ft::pair<int, float> pair;
typedef ft::map<int, float> map;
typedef ft::map<int, float>::iterator map_iterator;
typedef ft::pair<map_iterator, map_iterator> pair_iterator;
typedef ft::map<int, float>::reverse_iterator reverse_iterator;
#define MAKE_PAIR ft::make_pair<int, float>
typedef ft::vector<int> vector;
typedef ft::vector<int>::iterator iteratorVector;
typedef ft::vector<int>::reverse_iterator reverseIterator;
typedef ft::stack<int> stack;
#endif
#ifdef STD_CONTAINER
typedef std::pair<int, float> pair;
typedef std::map<int, float> map;
typedef std::map<int, float>::iterator map_iterator;
typedef std::pair<map_iterator, map_iterator> pair_iterator;
typedef std::map<int, float>::reverse_iterator reverse_iterator;
#define MAKE_PAIR std::make_pair<int, float>
typedef std::vector<int> vector;
typedef std::vector<int>::iterator iteratorVector;
typedef std::vector<int>::reverse_iterator reverseIterator;
typedef std::stack<int> stack;
#endif
int main()
{
std::cout << "\n======================= vector test ===========================" << "\n\n";
vector vec1;
std::cout << " [insert vector test] " << "\n";
vec1.push_back(1);
vec1.insert(vec1.begin(), 0);
vec1.push_back(5);
vec1.push_back(2);
vec1.push_back(3);
iteratorVector vItStart = vec1.begin();
vItStart++;
vec1.insert(vItStart, 4);
vItStart = vec1.begin();
iteratorVector vItEnd = vec1.end();
std::cout << "print vec1 with iterator" << "\n";
while (vItStart != vItEnd)
{
std::cout << *vItStart << " ";
vItStart++;
}
std::cout << "\n";
vector vec2;
vec2.insert(vec2.begin(), vec1.begin(), vec1.end());
std::cout << "print vec2 with reverse iterator" << "\n";
reverseIterator vRitStart = vec2.rbegin();
reverseIterator vRitEnd = vec2.rend();
while (vRitStart != vRitEnd)
{
std::cout << *vRitStart << " ";
vRitStart++;
}
std::cout << "\n";
std::cout << "\n[reverse iterator operator test]" << "\n";
vRitStart = vec2.rbegin();
vRitEnd = vec2.rend();
std::cout << "reverse iterator1 = " << *vRitStart << "\n";
std::cout << "reverse iterator2 = " << *vRitEnd << "\n";
std::cout << "iterator1 < iterator2 : " << (vRitStart < vRitEnd) << "\n";
std::cout << "reverse iterator1 = " << *vRitStart << "\n";
std::cout << "reverse iterator2 = " << *vRitEnd << "\n";
std::cout << "iterator1 > iterator2 : " << (vRitStart > vRitEnd) << "\n";
std::cout << "reverse iterator1 = " << *vRitStart << "\n";
std::cout << "reverse iterator2 = " << *vRitEnd << "\n";
std::cout << "iterator1 <= iterator2 : " << (vRitStart <= vRitEnd) << "\n";
std::cout << "reverse iterator1 = " << *vRitStart << "\n";
std::cout << "reverse iterator2 = " << *vRitEnd << "\n";
std::cout << "iterator1 >= iterator2 : " << (vRitStart >= vRitEnd) << "\n";
std::cout << "\n[assign test]" << "\n";
vec1.assign((size_t)5, 10);
std::cout << "print vec1 with iterator" << "\n";
vItStart = vec1.begin();
vItEnd = vec1.end();
while (vItStart != vItEnd)
{
std::cout << *vItStart << " ";
vItStart++;
}
std::cout << "\n";
std::cout << "\n[front test]" << "\n";
std::cout << "vec2 front = " << vec2.front() << "\n";
std::cout << "\n[back test]" << "\n";
std::cout << "vec2 back = " << vec2.back() << "\n";
std::cout << "\n[empty test]" << "\n";
std::cout << "vec1 is empty = " << vec1.empty() << "\n";
std::cout << "vec2 is empty = " << vec2.empty() << "\n";
std::cout << "\n[size test]" << "\n";
std::cout << "vec1 size = " << vec1.size() << "\n";
std::cout << "vec2 size = " << vec2.size() << "\n";
std::cout << "\n[capacity reserve test]" << "\n";
vec1.reserve(100);
std::cout << "vec1 capacity = " << vec1.capacity() << "\n";
std::cout << "\n[resize test]" << "\n";
vec1.resize(10);
std::cout << "vec1 size = " << vec1.size() << "\n";
vItStart = vec1.begin();
vItEnd = vec1.end();
while (vItStart != vItEnd)
{
std::cout << *vItStart << " ";
vItStart++;
}
std::cout << "\n[clear test]" << "\n";
vec1.clear();
std::cout << "vec1 size = " << vec1.size() << "\n";
vItStart = vec1.begin();
vItEnd = vec1.end();
while (vItStart != vItEnd)
{
std::cout << *vItStart << " ";
vItStart++;
}
std::cout << "\n[erase test]" << "\n";
vec1.push_back(1);
vec1.push_back(2);
vec1.push_back(3);
vec1.push_back(4);
vec1.push_back(5);
std::cout << "vec1 size = " << vec1.size() << "\n";
vItStart = vec1.begin();
vItEnd = vec1.end();
while (vItStart != vItEnd)
{
std::cout << *vItStart << " ";
vItStart++;
}
std::cout << "\n";
vItStart = vec1.begin();
vItEnd = vec1.end();
vItStart++;
vItStart++;
vec1.erase(vItStart, vItEnd);
std::cout << "vec1 size = " << vec1.size() << "\n";
vItStart = vec1.begin();
vItEnd = vec1.end();
while (vItStart != vItEnd)
{
std::cout << *vItStart << " ";
vItStart++;
}
std::cout << "\n";
std::cout << "\n[pop_back test]" << "\n";
vec1.pop_back();
std::cout << "vec1 size = " << vec1.size() << "\n";
vItStart = vec1.begin();
vItEnd = vec1.end();
while (vItStart != vItEnd)
{
std::cout << *vItStart << " ";
vItStart++;
}
std::cout << "\n";
std::cout << "\n[swap test]" << "\n";
vec1.swap(vec2);
std::cout << "vec1 size = " << vec1.size() << "\n";
vItStart = vec1.begin();
vItEnd = vec1.end();
while (vItStart != vItEnd)
{
std::cout << *vItStart << " ";
vItStart++;
}
std::cout << "\n";
std::cout << "vec2 size = " << vec2.size() << "\n";
vItStart = vec2.begin();
vItEnd = vec2.end();
while (vItStart != vItEnd)
{
std::cout << *vItStart << " ";
vItStart++;
}
std::cout << "\n";
std::cout << "\n[operator[] test]" << "\n";
std::cout << "vec1[0] = " << vec1[0] << "\n";
std::cout << "vec1[1] = " << vec1[1] << "\n";
std::cout << "vec1[2] = " << vec1[2] << "\n";
std::cout << "vec1[3] = " << vec1[3] << "\n";
std::cout << "vec1[4] = " << vec1[4] << "\n";
std::cout << "\n [=operator test (vec3 = vec2)] " << "\n";
vector vec3 = vec2;
std::cout << "print vec3 with iterator" << "\n";
vItStart = vec3.begin();
vItEnd = vec3.end();
while (vItStart != vItEnd)
{
std::cout << *vItStart << " ";
vItStart++;
}
std::cout << "\n";
std::cout << "\n======================= map test ===========================" << "\n\n";
map map1;
std::cout << " [insert map test] " << "\n";
map1.insert(MAKE_PAIR(1, 5.1));
map1.insert(MAKE_PAIR(2, 1.4));
map1.insert(MAKE_PAIR(3, 2.5));
map1.insert(MAKE_PAIR(4, 2.1));
map1[5] = 2.56;
map1.insert(map1.begin(), MAKE_PAIR(6, 6.2255));
map_iterator it = map1.begin();
map_iterator it2 = map1.end();
std::cout << "print map1 with iterator" << "\n";
while (it != it2)
{
std::cout << "m[" << it->first << "] = " << it->second << '\n';
it++;
}
it = map1.begin();
it2 = map1.end();
map map2;
map2.insert(it, it2);
std::cout << "print map2 with reverse_iterator" << "\n";
reverse_iterator rit = map1.rbegin();
reverse_iterator rit2 = map1.rend();
while (rit != rit2)
{
std::cout << "m[" << rit->first << "] = " << rit->second << '\n';
rit++;
}
std::cout << "\n[clear test]\n";
map1.clear();
it = map1.begin();
it2 = map1.end();
while (it != it2)
{
std::cout << "m[" << it->first << "] = " << it->second << '\n';
it++;
}
std::cout << "after clear map size = " << map1.size() << "\n";
std::cout << "\n[at test]" << "\n";
std::cout << "m[" << 1 << "] = " << map2.at(1) << '\n';
std::cout << "\n[equal_range test]" << "\n";
pair_iterator p = map2.equal_range(3);
for (map_iterator q = p.first; q != p.second; ++q) {
std::cout << "m[" << q->first << "] = " << q->second << '\n';
}
std::cout << "\n[lower_bound test]" << "\n";
map_iterator lb = map2.lower_bound(3);
std::cout << "m[" << lb->first << "] = " << lb->second << '\n';
lb++;
std::cout << "m[" << lb->first << "] = " << lb->second << '\n';
std::cout << "\n[upper_bound test]" << "\n";
map_iterator ub = map2.upper_bound(3);
std::cout << "m[" << ub->first << "] = " << ub->second << '\n';
ub++;
std::cout << "m[" << ub->first << "] = " << ub->second << '\n';
std::cout << "\n[find test]" << "\n";
map_iterator f = map2.find(3);
std::cout << "m[" << f->first << "] = " << f->second << '\n';
std::cout << "\n[erase test]" << "\n";
map2.erase(3);
it = map2.begin();
it++;
it++;
it++;
map2.erase(it, map2.end());
it = map2.begin();
it2 = map2.end();
while (it != it2)
{
std::cout << "m[" << it->first << "] = " << it->second << '\n';
it++;
}
std::cout << "\n[max_size test]" << "\n";
std::cout << "max_size = " << map2.max_size() << "\n";
std::cout << "\n[swap test]" << "\n";
map map3;
map3.insert(MAKE_PAIR(5, 5.1));
map3.insert(MAKE_PAIR(6, 1.4));
map3.insert(MAKE_PAIR(7, 2.5));
map3.insert(MAKE_PAIR(8, 2.1));
map3[9] = 2.56;
map3.insert(map3.begin(), MAKE_PAIR(3, 6.2255));
map3.swap(map2);
it = map3.begin();
it2 = map3.end();
std::cout << "===== map3 === \n";
while (it != it2)
{
std::cout << "m[" << it->first << "] = " << it->second << '\n';
it++;
}
std::cout << "===== map2 === \n";
it = map2.begin();
it2 = map2.end();
while (it != it2)
{
std::cout << "m[" << it->first << "] = " << it->second << '\n';
it++;
}
std::cout << "\n[empty test]" << "\n";
std::cout << "map1 is empty? " << map1.empty() << "\n";
std::cout << "map2 is empty? " << map2.empty() << "\n";
std::cout << "map3 is empty? " << map3.empty() << "\n";
std::cout << "\n[size test]\n";
std::cout << "map1 size = " << map1.size() << "\n";
std::cout << "map2 size = " << map2.size() << "\n";
std::cout << "map3 size = " << map3.size() << "\n";
std::cout << "\n[operator= test (map4 = map3)]\n";
std::cout << "===== map4 === \n";
map map4;
map4 = map3;
it = map4.begin();
it2 = map4.end();
while (it != it2)
{
std::cout << "m[" << it->first << "] = " << it->second << '\n';
it++;
}
std::cout << "\n[operator== test (map4 == map3)]\n";
std::cout << "map4 == map3 ? " << (map4 == map3) << "\n";
std::cout << "\n[operator!= test (map4 != map3)]\n";
std::cout << "map4 != map3 ? " << (map4 != map3) << "\n";
std::cout << "\n[operator< test (map4 < map3)]\n";
std::cout << "map4 < map3 ? " << (map4 < map3) << "\n";
std::cout << "\n[operator<= test (map4 <= map3)]\n";
std::cout << "map4 <= map3 ? " << (map4 <= map3) << "\n";
std::cout << "\n[operator> test (map4 > map3)]\n";
std::cout << "map4 > map3 ? " << (map4 > map3) << "\n";
std::cout << "\n[operator>= test (map4 >= map3)]\n";
std::cout << "map4 >= map3 ? " << (map4 >= map3) << "\n";
std::cout << "[max_size test]\n";
std::cout << "map1 max_size = " << map1.max_size() << "\n";
std::cout << "\n[stack test]" << "\n";
stack s;
s.push(1);
s.push(2);
s.push(3);
s.push(4);
stack s2(s);
std::cout << "stack size = " << s.size() << "\n";
std::cout << "stack top = " << s.top() << "\n";
s.pop();
std::cout << "stack top = " << s.top() << "\n";
s.pop();
std::cout << "stack top = " << s.top() << "\n";
s.pop();
std::cout << "\n[empty test]" << "\n";
std::cout << "stack is empty? " << s.empty() << "\n";
std::cout << "\n[stack s2]" << "\n";
std::cout << "stack size = " << s2.size() << "\n";
std::cout << "stack top = " << s2.top() << "\n";
s2.pop();
std::cout << "stack top = " << s2.top() << "\n";
s2.pop();
std::cout << "stack top = " << s2.top() << "\n";
s2.pop();
std::cout << "\n[empty test]" << "\n";
std::cout << "stack is empty? " << s2.empty() << "\n";
return 0;
}