-
Notifications
You must be signed in to change notification settings - Fork 0
/
Queue.cpp
182 lines (171 loc) · 3 KB
/
Queue.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
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
using namespace std;
template <typename T>
class Queue
{
private:
T* _array;
int _head;
int _tail;
int _size;
int _counter;
public:
Queue();
Queue(int size);
~Queue();
bool Add(T data);
T Get();
bool Del();
};
/** Queue<T>::Queue() */
template<typename T>
Queue<T>::Queue()
{
_size = _head = _counter = _tail = 0;
_array = nullptr;
}
/** Queue<T>::Queue(int size) */
template <typename T>
Queue<T>::Queue(int size)
{
_size = size;
_array = new T[size];
for (int i = 0; i < _size; i++)
_array[i] = 0;
_head = _counter = _tail = 0;
}
/** Queue<T>::~Queue() */
template <typename T>
Queue<T>::~Queue()
{
delete[] _array;
}
/** bool Queue<T>::Add(T data) */
template <typename T>
bool Queue<T>::Add(T data)
{
if (_counter == _size)
return false;
if (_tail >= _size)
_tail = 0;
_array[_tail] = data;
_counter++;
_tail++;
return true;
}
/** T Queue<T>::Get() */
template <typename T>
T Queue<T>::Get()
{
return _array[_head];
}
/** bool Queue<T>::Del() */
template <typename T>
bool Queue<T>::Del()
{
if (_counter == 0)
return false;
_array[_head] = 0;
_head++;
if (_head >= _size)
_head = 0;
_counter--;
return true;
}
/** vector<string> &split(const string &s, char delim, vector<string> &elems) */
vector<string> &split(const string &s, char delim, vector<string> &elems)
{
stringstream ss(s);
string item;
while (getline(ss, item, delim))
elems.push_back(item);
return elems;
}
/** vector<string> split(const string &s, char delim) */
vector<string> split(const string &s, char delim)
{
vector<string> elems;
split(s, delim, elems);
return elems;
}
/** int main(int argc, char* argv[]) */
int main(int argc, char* argv[])
{
unsigned int maxSize;
cout << "Size of queue = ";
cin >> maxSize;
Queue<int> queue(maxSize);
int N;
cout << "N = ";
cin >> N;
vector<string> expressions;
string expression;
int i = 0;
int size;
cin.ignore(numeric_limits<streamsize>::max(), '\n');
while (i < N && i >= 0)
{
cout << i + 1 << ">>";
getline(cin, expression);
expressions = split(expression, ' ');
size = expressions.size();
if (size == 0)
{
cout << "The expression is not correct. Try again.\n";
i--;
}
else if (expressions[0] == "add")
{
if (size == 2)
{
if (!queue.Add(stoi(expressions[1])))
{
cout << "Queue is full. Try again.\n";
i--;
}
}
else
{
cout << "The expression is not correct. Try again.\n";
i--;
}
}
else if (expressions[0] == "del")
{
if (size == 1)
{
if (!queue.Del())
{
cout << "Queue is empty. Try again.\n";
i--;
}
}
else
{
cout << "The expression is not correct. Try again.\n";
i--;
}
}
else if (expressions[0] == "get")
{
if (size == 1)
cout << queue.Get() << endl;
else
{
cout << "The expression is not correct. Try again.\n";
i--;
}
}
else
{
cout << "The operation is not correct. Try again.\n";
i--;
}
i++;
}
system("pause");
return 0;
}