-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathAQueue.cpp
More file actions
47 lines (40 loc) · 1.04 KB
/
AQueue.cpp
File metadata and controls
47 lines (40 loc) · 1.04 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
//array-based queue implementation
template <typename E> class AQueue: public Queue<E>
{
private:
int maxSize; //maximum size of queue
int front; //index of front element
int rear; //index of rear element
E *listArray; //array holding queue elements
public:
AQueue(int size =defaultSize) //constructor
{
maxSize = size+1;
rear = 0; front = 1;
listArray = new E[maxSize];
}
~AQueue() {delete [] listArray;} //destructor
void clear() {rear = 0; front =1;} //reinitialize
void enqueue(const E& it) //put "it" in queue
{
Assert(((rear+2) % maxSize) != front, "Queue is full");
rear = (rear+1) % maxSize;
listArray[rear] = it;
}
E dequeue()
{
Assert(length() != 0, "Queue is empty");
E it = listArray[front];
front = front (front+!) % maxSize;
return it;
}
const E& frontValue() const
{
Assert(length() != 0, "Queue is empty");
return listArray[front];
}
virtual int length() const
{
return ((rear+maxSize) - front +1) %maxSize;
}
};