-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathmaxHeap1.h
More file actions
236 lines (166 loc) · 5.82 KB
/
maxHeap1.h
File metadata and controls
236 lines (166 loc) · 5.82 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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
#ifndef C202_HW3_MAXHEAP1_H
#define C202_HW3_MAXHEAP1_H
#include <exception>
#include <string>
using namespace std;
// -------------------------------------------Patient Class-------------------------------------------------------------
class Patient {
public:
Patient() { }
Patient( int patientId, int priority, int arrivalTime, int serviceTime ) {
this->patientID = patientId;
this->priority = priority;
this->arrivalTime = arrivalTime;
this->serviceTime = serviceTime;
}
int getId() {
return patientID;
}
int getPriority() {
return priority;
}
int getArrivalTime() {
return arrivalTime;
}
int getServiceTime() {
return serviceTime;
}
private:
int patientID;
int priority;
int arrivalTime;
int serviceTime;
};
// -------------------------------------------End of Patient Class------------------------------------------------------
// -------------------------------------------KeyedItem Class-----------------------------------------------------------
typedef int KeyType;
class KeyedItem {
public:
KeyedItem() { }
KeyedItem(Patient p) : patientID( p.getId() ), priority( p.getPriority() ),
arrivalTime( p.getArrivalTime() ), serviceTime( p.getServiceTime() ) { }
KeyType getKey() const {
return priority;
}
KeyType getPatientId() const {
return patientID;
}
KeyType getPriority() const {
return priority;
}
KeyType getArrivalTime() const {
return arrivalTime;
}
KeyType getServiceTime() const {
return serviceTime;
}
private:
KeyType patientID;
KeyType priority;
KeyType arrivalTime;
KeyType serviceTime;
};
//-------------------------------------------End of KeyedItem Class-----------------------------------------------------
// -------------------------------------------HeapException Class-------------------------------------------------------
class HeapException : public exception{
private:
string msg;
public:
virtual const char* what() const throw()
{
return msg.c_str();
}
HeapException(const string & message =""):
exception(), msg(message) {};
~HeapException() throw() {};
}; // end HeapException
// ------------------------------------End of HeapException Class-------------------------------------------------------
// -------------------------------------------PQException Class---------------------------------------------------------
class PQException : public exception{
private:
string msg;
public:
virtual const char* what() const throw()
{
return msg.c_str();
}
PQException(const string & message =""):
exception(), msg(message) {};
~PQException() throw() {};
}; // end HeapException
// ------------------------------------End of PQException Class---------------------------------------------------------
//-------------------------------------------Heap Class-----------------------------------------------------------------
const int MAX_HEAP = 2000;
typedef KeyedItem HeapItemType;
class Heap {
public:
Heap(); // default constructor
// copy constructor and destructor are supplied by the compiler
bool heapIsEmpty() const;
void heapInsert(const HeapItemType& newItem) throw(HeapException);
void heapDelete(HeapItemType& rootItem) throw(HeapException);
protected:
void heapRebuild(int root); // Converts the semiheap rooted at
// index root into a heap
private:
HeapItemType items[MAX_HEAP]; // array of heap items
int size; // number of heap items
};
//---------------------------------------------End of Heap Class--------------------------------------------------------
//-------------------------------------------PriorityQueue Class--------------------------------------------------------
typedef HeapItemType PQItemType;
class PriorityQueue {
public:
// default constructor, copy constructor, and destructor
// are supplied by the compiler
// priority-queue operations:
bool pqIsEmpty() const;
void pqInsert(const PQItemType& newItem) throw (PQException);
void pqDelete(PQItemType& priorityItem) throw (PQException);
void deleteHeap() { }
private:
Heap h;
};
//-----------------------------------End of PriorityQueue Class---------------------------------------------------------
//---------------------------------------------Doctor Class-------------------------------------------------------------
class Doctor {
public:
Doctor( ){ available = true; }
void setAvailable() {
available = true;
}
void setNonAvailable() {
available = false;
}
bool getAvailable() {
return available;
}
void setRemainingTime( int time ) {
remainingTime = time;
}
void reduceRemainingTime( ) {
remainingTime = remainingTime - 1;
if(remainingTime == 0) {
setAvailable();
}
}
private:
bool available;
int remainingTime;
};
//------------------------------------End of Doctor Class---------------------------------------------------------------
//----------------------------------------maxHeap1 Class----------------------------------------------------------------
class maxHeap1 {
public:
maxHeap1( int maxAvgWaitingTime ) : maxAvgWaitingTime( maxAvgWaitingTime ) { }
void initPatients( string file );
int getNumOfPatients() { return numOfPatients; }
Patient * getPatientsInOrderOfArrival() { return patientsInOrderOfArrival; }
void delDynamicPatients() { }
private:
int numOfPatients;
int maxAvgWaitingTime;
Patient patientsInOrderOfArrival[MAX_HEAP];
};
#endif //C202_HW3_MAXHEAP1_H
//-------------------------------------End of maxHeap1 Class------------------------------------------------------------