-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy patharray_queue.hpp
More file actions
72 lines (59 loc) · 1.29 KB
/
Copy patharray_queue.hpp
File metadata and controls
72 lines (59 loc) · 1.29 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
/*
* @Author: five-5
* @Description: 数组队列
* @Date: 2019-03-24
* @LastEditTime: 2019-03-24
*/
#ifndef ARRAY_QUEUE_HPP
#define ARRAY_QUEUE_HPP
#include "../Array/my_array.hpp"
#include "queue.h"
#include <iostream>
template <typename T>
class ArrayQueue: public Queue<T> {
public:
ArrayQueue(int capacity) {
array = MyArray<T>(capacity);
}
ArrayQueue() {
array = MyArray<T>();
}
// Override
int size() const{
return array.size();
}
// Override
void push(T e) {
array.AddLast(e);
}
// Override
bool empty() const{
return array.IsEmpty();
}
// Override
T pop() {
return array.RemoveFirst();
}
// Override
T front() const {
return array.GetFirst();
}
int capacity() {
return array.capacity();
}
friend std::ostream & operator<< (std::ostream &out, const ArrayQueue<T> &array_queue) {
out << "Queue: ";
out << "front [";
for (int i = 0; i < array_queue.array.size(); ++i) {
out << array_queue.array.Get(i);
if (i != array_queue.array.size() - 1) {
out << ", ";
}
}
out << "] tail";
return out;
}
private:
MyArray<T> array;
};
#endif