-
Notifications
You must be signed in to change notification settings - Fork 8
Expand file tree
/
Copy pathsolution.cpp
More file actions
182 lines (164 loc) · 3.26 KB
/
solution.cpp
File metadata and controls
182 lines (164 loc) · 3.26 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
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
#include <vector>
#include <cstdlib>
#include <iostream>
// TODO: implement a queue with a dynamicly sized ring-buffer storage.
template <typename T>
class Queue
{
private:
typedef typename std::vector<T>::size_type size_type;
public:
Queue()
: m_buffer()
, m_begin(0)
, m_length(0)
{
}
void push_back(const T& data)
{
ensure_available(1);
m_buffer[(m_begin + m_length) % m_buffer.size()] = data;
++m_length;
}
T& front()
{
return m_buffer[m_begin];
}
void pop()
{
--m_length;
m_begin = (m_begin + 1) % m_buffer.size();
}
bool empty() const
{
return size() == 0;
}
size_type size() const
{
return m_length;
}
friend std::ostream& operator<<(std::ostream& ostr, const Queue<T>& queue)
{
ostr << "{m_buffer: ";
for (size_type i = 0; i < queue.m_buffer.size(); ++i)
{
if (i != 0)
ostr << ' ';
ostr << queue.m_buffer[i];
}
ostr << ", m_begin: " << queue.m_begin;
ostr << ", m_length: " << queue.m_length;
ostr << "}";
return ostr;
}
private:
void ensure_available(size_type available)
{
using namespace std;
if (m_buffer.size() < m_length + available)
{
vector<T> new_buffer((m_length + available) * 2);
if (m_begin + m_length < m_buffer.size())
{
move(m_buffer.begin() + m_begin, m_buffer.begin() + m_begin + m_length, new_buffer.begin());
}
else
{
// 2 parts, wrapped
size_type p1begin = m_begin;
size_type p1len = m_buffer.size() - p1begin;
size_type p2begin = 0;
size_type p2len = m_buffer.size() - p1len;
// move p1 to the start of new_buffer
move(m_buffer.begin() + p1begin, m_buffer.begin() + p1begin + p1len, new_buffer.begin());
// append p2 to new_buffer
move(m_buffer.begin() + p2begin, m_buffer.begin() + p2begin + p2len, new_buffer.begin() + p1len);
}
swap(m_buffer, new_buffer);
m_begin = 0;
}
}
private:
std::vector<T> m_buffer;
size_type m_begin, m_length;
};
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++;
}
}