forked from leo000leo/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpriority_queue.h
More file actions
199 lines (170 loc) · 5.36 KB
/
Copy pathpriority_queue.h
File metadata and controls
199 lines (170 loc) · 5.36 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
//
// priority_queue
// Algorithm
//
// Created by dtysky on 16/9/19.
// Copyright © 2016 [email protected]. All rights reserved.
//
#ifndef ALGORITHM_PRIORITY_QUEUE_H
#define ALGORITHM_PRIORITY_QUEUE_H
#include <cstdio>
#include <iostream>
#include "linked_list.h"
namespace data_structures {
template <typename T>
class PriorityQueue {
protected:
LinkedList<T> _list;
bool _less(const T& element1, const T& element2);
void _checkN(const size_t n);
public:
PriorityQueue();
PriorityQueue(const PriorityQueue<T>& queue);
virtual ~PriorityQueue();
bool isEmpty();
size_t size();
PriorityQueue<T>& clear();
PriorityQueue<T>& enqueue(const T &element);
T dequeueMaxN(const size_t n = 1);
T dequeueMinN(const size_t n = 1);
T maxN(const size_t n = 1);
T minN(const size_t n = 1);
PriorityQueue<T>& operator=(const PriorityQueue<T>& queue);
bool operator==(const PriorityQueue<T>& queue) const;
bool operator!=(const PriorityQueue<T>& queue) const;
ListNode<T>* begin() const;
ListNode<T>* end() const;
ListNode<T>* header() const;
ListNode<T>* tail() const;
friend std::ostream& operator<<(std::ostream& out, const PriorityQueue<T>& queue){
out << "Min ---- ";
out << queue._list;
out << " ---- Max";
return out;
};
};
template <typename T> inline
PriorityQueue<T>::PriorityQueue() {
_list = LinkedList<T>();
}
template <typename T> inline
PriorityQueue<T>::PriorityQueue(const PriorityQueue<T>& queue) {
_list = LinkedList<T>(queue._list);
}
template <typename T> inline
PriorityQueue<T>::~PriorityQueue() {}
template <typename T> inline
PriorityQueue<T>& PriorityQueue<T>::operator=(const PriorityQueue<T>& queue){
_list = queue._list;
return *this;
}
template <typename T> inline
bool PriorityQueue<T>::operator==(const PriorityQueue<T>& queue) const {
return _list == queue._list;
}
template <typename T> inline
bool PriorityQueue<T>::operator!=(const PriorityQueue<T>& queue) const {
return _list != queue._list;
}
template <typename T> inline
bool PriorityQueue<T>::isEmpty() {
return _list.isEmpty();
}
template <typename T> inline
size_t PriorityQueue<T>::size(){
return _list.size();
}
template <typename T> inline
PriorityQueue<T>& PriorityQueue<T>::clear(){
_list.clear();
return *this;
}
template <typename T> inline
bool PriorityQueue<T>::_less(const T &element1, const T &element2) {
return element1 < element2;
}
template <typename T> inline
PriorityQueue<T>& PriorityQueue<T>::enqueue(const T &element) {
if (isEmpty()) {
_list.insertToHeader(element);
return *this;
}
if (_less(element, _list.begin()->element)) {
_list.insertToHeader(element);
return *this;
}
for (auto node = _list.begin(); node->next() != _list.end(); node = node->next()) {
if (_less(element, node->next()->element)) {
_list.insertAfterNode(node, element);
return *this;
}
}
_list.insertToTail(element);
return *this;
}
template <typename T> inline
void PriorityQueue<T>::_checkN(const size_t n) {
auto size = _list.size();
if (n == 0 || n > size) {
throw std::out_of_range("N must be larger than 0 and less than this queue's size !");
}
}
template <typename T> inline
T PriorityQueue<T>::maxN(const size_t n) {
_checkN(n);
return _list.getKthNode(_list.size() - n)->element;
}
template <typename T> inline
T PriorityQueue<T>::minN(const size_t n) {
_checkN(n);
return _list.getKthNode(n - 1)->element;
}
template <typename T> inline
T PriorityQueue<T>::dequeueMaxN(const size_t n) {
_checkN(n);
auto size = _list.size();
T result;
if (n == size) {
result = _list.begin()->element;
_list.deleteFromHeader();
}
else {
auto node = _list.getKthNode(_list.size() - n - 1);
result = node->next()->element;
_list.deleteAfterNode(node);
}
return result;
}
template <typename T> inline
T PriorityQueue<T>::dequeueMinN(const size_t n) {
_checkN(n);
T result;
if (n == 1) {
result = _list.begin()->element;
_list.deleteFromHeader();
}
else {
auto node = _list.getKthNode(n - 1);
result = node->next()->element;
_list.deleteAfterNode(node);
}
return result;
}
template <typename T> inline
ListNode<T>* PriorityQueue<T>::begin() const {
return _list.begin();
}
template <typename T> inline
ListNode<T>* PriorityQueue<T>::end() const {
return _list.end();
}
template <typename T> inline
ListNode<T>* PriorityQueue<T>::header() const {
return _list.header();
}
template <typename T> inline
ListNode<T>* PriorityQueue<T>::tail() const {
return _list.tail();
}
}
#endif //ALGORITHM_PRIORITY_QUEUE_H