-
Notifications
You must be signed in to change notification settings - Fork 0
/
lecture13.cpp
149 lines (123 loc) · 1.91 KB
/
lecture13.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
#include <iostream>
#include <string>
using namespace std;
const int MAX_SIZE = 5;
class arrCircQueue
{
public:
arrCircQueue();
~arrCircQueue();
bool enqueue(int);
bool dequeue(int&);
bool peek(int&);
private:
bool isFull();
bool isEmpty();
int head = -1;
int tail = -1;
int arrQueue[MAX_SIZE];
};
arrCircQueue::arrCircQueue()
{
//constructor
}
arrCircQueue::~arrCircQueue()
{
//deconstructor
}
//function is returning if the queue is full
bool arrCircQueue::isFull()
{
int tempHead = head;
if (head == 0)
{
//do this because head is the first part of the array
tempHead = MAX_SIZE;
}
//ex: if head is at 0 and tail is at 4 and max_size is 5
if (tempHead - tail == -1)
{
return true;
}
else
{
return false;
}
}
bool arrCircQueue::isEmpty()
{
//as stated in the class
if (head == -1 && tail == -1)
{
return true;
}
else
{
return false;
}
}
bool arrCircQueue::enqueue(int itemToAdd)
{
if (!isFull())
{
//add item
int tempTail = tail+1;
if (tempTail == MAX_SIZE)
{
tempTail = 0;
}
tail = tempTail;
arrQueue[tail] = itemToAdd;
if (head == -1)
{
head = 0;
}
cout << "Item " << itemToAdd << " added to queue." << endl;
return true;
}
else
{
cout << "Queue full, item --" << itemToAdd << "-- not added to queue." << endl;
return false;
}
}
bool arrCircQueue::dequeue(int& itemToGet)
{
if (isEmpty())
{
cout << "Queue empty, nothing to dequeue!" << endl;
return false;
}
else
{
//remove at head
itemToGet = arrQueue[head];
//check if list is now empty
if (head == tail)
{
//nothing left in the queue
head = tail = -1;
}
else
{
head+=1;
if (head == MAX_SIZE)
{
head = 0;
}
}
//impliment p
return true;
}
}
int main()
{
arrCircQueue pirateQ;
pirateQ.enqueue(16);
pirateQ.enqueue(19);
int topOQueue;
if (pirateQ.dequeue(topOQueue))
{
cout << "Dequeued " << topOQueue << endl;
}
}