-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueue.cpp
More file actions
101 lines (96 loc) · 1.63 KB
/
Queue.cpp
File metadata and controls
101 lines (96 loc) · 1.63 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
#include "Queue.h"
Queue::Queue()
{
frontQueue = NULL;
counter = 0;
}
Queue::~Queue()
{
}
void Queue::push(List* newList)
{
queueList *newQueue = new queueList();
newQueue->list = newList;
if (counter == 0)
{
newQueue->next = NULL;
newQueue->prev = NULL;
this->frontQueue = newQueue;
counter++;
}
else
{
counter++;
queueList *temp = frontQueue;
do
{
if (temp->next != NULL) temp = temp->next;
else
{
temp->next = newQueue;
newQueue->prev = temp;
newQueue->next = NULL;
break;
}
} while (1);
}
}
List* Queue::front()
{
return this->frontQueue->list;
}
void Queue::pop()
{
queueList* temp;
temp = frontQueue;
counter--;
if (counter == 0)
frontQueue = NULL;
else
{
temp->next->prev = NULL;
this->frontQueue = temp->next;
}
}
bool Queue::exist(List *newList)
{
queueList* temp = frontQueue;
do
{
if (temp->list == newList) return true;
else
{
if (temp->next != NULL)
temp = temp->next;
else
return false;
}
} while (1);
}
bool Queue::empty()
{
if (counter == 0)
return true;
return false;
}
int Queue::size()
{
return this->counter;
}
void Queue::print(Queue* list)
{
InputList* input;
List* temp;
queueList* queue;
queue = list->frontQueue;
cout << "Process\t\t" << "Operation\t" << "Meter" << endl;
do
{
cout << queue->list->processID << "\t\t" << queue->list->currentProcess->getOperation() << "\t\t" << queue->list->currentProcess->getMeter() << endl;
if (queue->next != NULL)
queue = queue->next;
else
break;
} while (1);
cout << "\n";
}