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
|
#include <cstdio>
#include <deque>
struct Foo_small {
int a;
int b;
int c;
Foo_small(int a, int b, int c) : a(a), b(b), c(c) {}
};
struct Foo_large {
int a;
int b;
int c;
char d[1000] = {0};
Foo_large(int a, int b, int c) : a(a), b(b), c(c) {}
};
template <typename T> T fill(T deque) {
for (int i = 0; i < 100; i++) {
deque.push_back({i, i + 1, i + 2});
deque.push_front({-i, -(i + 1), -(i + 2)});
}
return deque;
}
void by_ref_and_ptr(std::deque<int> &ref, std::deque<int> *ptr) {
puts("stop here");
return;
}
int main() {
std::deque<int> empty;
std::deque<int> deque_1 = {1};
std::deque<int> deque_3 = {3, 1, 2};
std::deque<Foo_small> deque_200_small;
deque_200_small = fill<std::deque<Foo_small>>(deque_200_small);
std::deque<Foo_large> deque_200_large;
deque_200_large = fill<std::deque<Foo_large>>(deque_200_large);
puts("break here");
empty.push_back(1);
puts("break here");
(empty.push_back(12));
(empty.push_back(123));
(empty.push_back(1234));
(empty.push_back(12345));
(empty.push_back(123456));
(empty.push_back(1234567));
puts("break here");
by_ref_and_ptr(empty, &empty);
empty.clear();
puts("break here");
return empty.size() + deque_1.front() + deque_3.front();
}
|
