-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueue_Array.h
More file actions
88 lines (71 loc) · 901 Bytes
/
Copy pathQueue_Array.h
File metadata and controls
88 lines (71 loc) · 901 Bytes
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
#pragma once
template<class T>
class Queue_Array
{
public:
Queue_Array(void) : nHead(0),
nEnd(0),
count(0),
nSize(2)
{
items = new T[nSize];
}
~Queue_Array(void) { }
void push(T item)
{
Expand();
if (IsEmpty())
{
nHead = 0;
nEnd = 0;
items[nHead] = item;
}
else
{
nEnd++;
items[nEnd] = item;
}
count++;
}
T pop()
{
if (IsEmpty())
{
throw "Out of Bound";
}
T value = items[nHead];
nHead++;
count--;
return value;
}
void Expand()
{
if ((nEnd+1) == nSize)
{
nSize *= 2;
T* newItem = new T[nSize];
for (int i = nHead; i <= nEnd; i++)
{
newItem[i-nHead] = items[i];
}
nEnd -= nHead;
nHead -= nHead;
delete[] items;
items = newItem;
}
}
int size()
{
return count;
}
bool IsEmpty()
{
return count == 0;
}
private:
T *items;
int nHead;
int nEnd;
int nSize;
int count;
};