-
Notifications
You must be signed in to change notification settings - Fork 8
Expand file tree
/
Copy pathstart.cpp
More file actions
91 lines (84 loc) · 1.42 KB
/
start.cpp
File metadata and controls
91 lines (84 loc) · 1.42 KB
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
#include <vector>
#include <cstdlib>
#include <iostream>
// TODO: implement a queue with a dynamicly sized ring-buffer storage.
void panic(const char* s)
{
std::cout << s << std::endl;
std::abort();
}
int main()
{
Queue<int> queue;
if (!queue.empty())
{
panic("!queue.empty()");
}
queue.push_back(1);
queue.push_back(2);
queue.push_back(3);
if (queue.empty())
{
panic("queue.empty()");
}
if (queue.front() != 1)
{
panic("queue.PopFront() != 1");
}
queue.pop();
if (queue.front() != 2)
{
panic("queue.PopFront() != 2");
}
queue.pop();
if (queue.front() != 3)
{
panic("queue.PopFront() != 3");
}
//std::cout << queue << std::endl;
queue.pop();
if (!queue.empty())
{
panic("!queue.empty()");
}
//std::cout << queue << std::endl;
queue.push_back(4);
if (queue.empty())
{
panic("queue.empty()");
}
//std::cout << queue << std::endl;
if (queue.front() != 4)
{
panic("queue.PopFront() != 4");
}
queue.pop();
int in = 0;
int out = 0;
for (int i = 1; i < 100; i++)
{
for (int j = 0; j < i; j++)
{
queue.push_back(in);
in++;
}
int x = queue.front();
queue.pop();
if (x != out)
{
//panic(fmt.Sprintf("queue.PopFront() != %d, got %d", out, x));
panic("queue.PopFront() != %d, got %d");
}
out++;
}
while (!queue.empty())
{
int x = queue.front();
queue.pop();
if (x != out)
{
panic("queue.PopFront() != %d, got %d");
}
out++;
}
}