forked from PeterFeicht/cppreference-doc
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue
More file actions
248 lines (184 loc) · 6.72 KB
/
queue
File metadata and controls
248 lines (184 loc) · 6.72 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
237
238
239
240
241
242
243
244
245
246
247
248
/* Copyright (C) 2015 Povilas Kanapickas <povilas@radix.lt>
This file is part of cppreference-doc
This work is licensed under the Creative Commons Attribution-ShareAlike 3.0
Unported License. To view a copy of this license, visit
http://creativecommons.org/licenses/by-sa/3.0/ or send a letter to Creative
Commons, 444 Castro Street, Suite 900, Mountain View, California, 94041, USA.
Permission is granted to copy, distribute and/or modify this document
under the terms of the GNU Free Documentation License, Version 1.3 or
any later version published by the Free Software Foundation; with no
Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.
*/
#ifndef CPPREFERENCE_QUEUE_H
#define CPPREFERENCE_QUEUE_H
#if CPPREFERENCE_STDVER>= 2011
#include <initializer_list>
#endif
#include <deque>
#include <vector>
#include <functional> // less
namespace std {
template <
class T,
class Container = std::deque<T>
> class queue {
public:
typedef Container container_type;
typedef typename Container::value_type value_type;
typedef typename Container::size_type size_type;
typedef typename Container::reference reference;
typedef typename Container::const_reference const_reference;
#if CPPREFERENCE_STDVER <2011
explicit queue(const Container& cont = Container());
#else
explicit queue(const Container& cont);
explicit queue(Container&& cont = Container());
queue(const queue& other);
queue(queue&& other);
template<class Alloc>
explicit queue(const Alloc& alloc);
template<class Alloc>
queue(const Container& cont, const Alloc& alloc);
template<class Alloc>
queue(Container&& cont, const Alloc& alloc);
template<class Alloc>
queue(const queue& other, const Alloc& alloc);
template<class Alloc>
queue(queue&& other, const Alloc& alloc);
#endif
~queue();
queue<T, Container>&
operator=(const queue<T, Container>& other);
#if CPPREFERENCE_STDVER>= 2011
queue<T, Container>&
operator=(queue<T, Container>&& other);
#endif
reference front();
const_reference front() const;
reference back();
const_reference back() const;
bool empty() const;
size_type size() const;
void push(const T& value);
#if CPPREFERENCE_STDVER>= 2011
void push(T&& value);
template<class... Args>
void emplace(Args&& ... args);
#endif
void pop();
#if CPPREFERENCE_STDVER>= 2011
void swap(queue& other);
#endif
protected:
Container c;
};
template<class T, class Container>
bool operator==(queue<T, Container>& lhs,
queue<T, Container>& rhs);
template<class T, class Container>
bool operator!=(queue<T, Container>& lhs,
queue<T, Container>& rhs);
template<class T, class Container>
bool operator<(queue<T, Container>& lhs,
queue<T, Container>& rhs);
template<class T, class Container>
bool operator<=(queue<T, Container>& lhs,
queue<T, Container>& rhs);
template<class T, class Container>
bool operator>(queue<T, Container>& lhs,
queue<T, Container>& rhs);
template<class T, class Container>
bool operator>=(queue<T, Container>& lhs,
queue<T, Container>& rhs);
template<class T, class Container>
void swap(queue<T, Container>& lhs,
queue<T, Container>& rhs);
template <
class T,
class Container = std::vector<T>,
class Compare = std::less<typename Container::value_type>
> class priority_queue {
public:
typedef Container container_type;
typedef typename Container::value_type value_type;
typedef typename Container::size_type size_type;
typedef typename Container::reference reference;
typedef typename Container::const_reference const_reference;
priority_queue(const priority_queue& other);
#if CPPREFERENCE_STDVER <2011
explicit priority_queue(const Compare& compare = Compare(),
const Container& cont = Container());
#else
priority_queue(const Compare& compare, const Container& cont);
explicit priority_queue(const Compare& compare = Compare(),
Container && cont = Container());
priority_queue(priority_queue&& other);
template<class Alloc>
explicit priority_queue(const Alloc& alloc);
template<class Alloc>
priority_queue(const Compare& compare, const Alloc& alloc);
template<class Alloc>
priority_queue(const Compare& compare, const Container& cont,
const Alloc& alloc);
template<class Alloc>
priority_queue(const Compare& compare, Container&& cont,
const Alloc& alloc);
template<class Alloc>
priority_queue(const priority_queue& other, const Alloc& alloc);
template<class Alloc>
priority_queue(priority_queue&& other, const Alloc& alloc);
template<class InputIt>
priority_queue(InputIt first, InputIt last,
const Compare& compare, const Container& cont);
template<class InputIt>
priority_queue(InputIt first, InputIt last,
const Compare& compare = Compare(),
Container && cont = Container());
#endif
~priority_queue();
priority_queue<T, Container>&
operator=(const priority_queue<T, Container>& other);
#if CPPREFERENCE_STDVER>= 2011
priority_queue<T, Container>&
operator=(priority_queue<T, Container>&& other);
#endif
const_reference top() const;
bool empty() const;
size_type size() const;
void push(const T& value);
#if CPPREFERENCE_STDVER>= 2011
void push(T&& value);
template<class... Args>
void emplace(Args&& ... args);
#endif
void pop();
#if CPPREFERENCE_STDVER>= 2011
void swap(priority_queue& other);
#endif
protected:
Container c;
Compare comp;
};
template<class T, class Container>
bool operator==(priority_queue<T, Container>& lhs,
priority_queue<T, Container>& rhs);
template<class T, class Container>
bool operator!=(priority_queue<T, Container>& lhs,
priority_queue<T, Container>& rhs);
template<class T, class Container>
bool operator<(priority_queue<T, Container>& lhs,
priority_queue<T, Container>& rhs);
template<class T, class Container>
bool operator<=(priority_queue<T, Container>& lhs,
priority_queue<T, Container>& rhs);
template<class T, class Container>
bool operator>(priority_queue<T, Container>& lhs,
priority_queue<T, Container>& rhs);
template<class T, class Container>
bool operator>=(priority_queue<T, Container>& lhs,
priority_queue<T, Container>& rhs);
template<class T, class Container, class Compare>
void swap(priority_queue<T, Container, Compare>& lhs,
priority_queue<T, Container, Compare>& rhs);
} // namespace std
#endif // CPPREFERENCE_QUEUE_H