forked from p12tic/cppreference-doc
-
Notifications
You must be signed in to change notification settings - Fork 57
Expand file tree
/
Copy pathunordered_set
More file actions
413 lines (327 loc) · 14.2 KB
/
unordered_set
File metadata and controls
413 lines (327 loc) · 14.2 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
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
/* 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_UNORDERED_SET_H
#define CPPREFERENCE_UNORDERED_SET_H
#if CPPREFERENCE_STDVER>= 2011
#include <initializer_list>
#include <cstddef> // for size_t, ptrdiff_t
#include <functional> // for hash
#include <memory> // for std::allocator
#include <utility> // for std::pair
namespace std {
template <
class Key,
class Hash = std::hash<Key>,
class KeyEqual = std::equal_to<Key>,
class Allocator = std::allocator<Key>
> class unordered_set {
public:
typedef Key key_type;
typedef Key value_type;
typedef size_t size_type; // actual type unspecified
typedef ptrdiff_t difference_type; // actual type not specified
typedef Hash hasher;
typedef KeyEqual key_equal;
typedef Allocator allocator_type;
typedef value_type& reference;
typedef const value_type& const_reference;
#if CPPREFERENCE_SIMPLIFY_TYPEDEFS
typedef value_type* pointer;
typedef const value_type* const_pointer;
#else
typedef typename std::allocator_traits<Allocator>::pointer pointer;
typedef typename std::allocator_traits<Allocator>::const_pointer const_pointer;
#endif
typedef value_type* iterator; // actual type is unspecified
typedef const value_type* const_iterator; // actual type is unspecified
typedef value_type* local_iterator; // actual type is unspecified
typedef const value_type* const_local_iterator; // actual type is unspecified
// constructor
#if CPPREFERENCE_STDVER <2014
explicit unordered_set(size_type bucket_count = 0 /*implementation-defined*/,
const Hash& hash = Hash(),
const KeyEqual& equal = KeyEqual(),
const Allocator& alloc = Allocator());
#else
unordered_set();
explicit unordered_set(size_type bucket_count,
const Hash& hash = Hash(),
const KeyEqual& equal = KeyEqual(),
const Allocator& alloc = Allocator());
unordered_set(size_type bucket_count,
const Allocator& alloc);
unordered_set(size_type bucket_count,
const Hash& hash,
const Allocator& alloc);
#endif
explicit unordered_set(const Allocator& alloc);
template<class InputIt>
unordered_set(InputIt first, InputIt last,
size_type bucket_count = 0 /*implementation-defined*/,
const Hash& hash = Hash(),
const KeyEqual& equal = KeyEqual(),
const Allocator& alloc = Allocator());
#if CPPREFERENCE_STDVER>= 2014
template<class InputIt>
unordered_set(InputIt first, InputIt last,
size_type bucket_count,
const Allocator& alloc);
template<class InputIt>
unordered_set(InputIt first, InputIt last,
size_type bucket_count,
const Hash& hash,
const Allocator& alloc);
#endif
unordered_set(const unordered_set& other);
unordered_set(const unordered_set& other, const Allocator& alloc);
unordered_set(unordered_set&& other);
unordered_set(unordered_set&& other, const Allocator& alloc);
unordered_set(std::initializer_list<value_type> init,
size_type bucket_count = /*implementation-defined*/0,
const Hash& hash = Hash(),
const KeyEqual& equal = KeyEqual(),
const Allocator& alloc = Allocator());
#if CPPREFERENCE_STDVER>= 2014
unordered_set(std::initializer_list<value_type> init,
size_type bucket_count,
const Allocator& alloc);
unordered_set(std::initializer_list<value_type> init,
size_type bucket_count,
const Hash& hash,
const Allocator& alloc);
#endif
#if CPPREFERENCE_STDVER>= 2014
unordered_set(std::initializer_list<value_type> init, const Allocator& alloc);
#endif
~unordered_set();
unordered_set& operator=(const unordered_set& other);
unordered_set& operator=(unordered_set&& other);
unordered_set& operator=(initializer_list<value_type> ilist);
allocator_type get_allocator() const;
// iterators
iterator begin();
const_iterator begin() const;
iterator end();
const_iterator end() const;
const_iterator cbegin() const;
const_iterator cend() const;
// capacity
bool empty() const;
size_type size() const;
size_type max_size() const;
// modifiers
void clear();
std::pair<iterator, bool> insert(const value_type& value);
std::pair<iterator, bool> insert(value_type&& value);
iterator insert(const_iterator hint, const value_type& value);
iterator insert(const_iterator hint, value_type&& value);
template<class InputIt>
void insert(InputIt first, InputIt last);
void insert(std::initializer_list<value_type> ilist);
template<class... Args>
std::pair<iterator, bool> emplace(Args&& ... args);
template <class... Args>
iterator emplace_hint(const_iterator hint, Args&& ... args);
iterator erase(const_iterator pos);
iterator erase(const_iterator first, const_iterator last);
size_type erase(const key_type& key);
void swap(unordered_set& other);
// lookup
size_type count(const Key& key) const;
iterator find(const Key& key);
const_iterator find(const Key& key) const;
std::pair<iterator, iterator> equal_range(const Key& key);
std::pair<const_iterator, const_iterator> equal_range(const Key& key) const;
// bucket interface
local_iterator begin(size_type n);
const_local_iterator begin(size_type n) const;
const_local_iterator cbegin(size_type n) const;
local_iterator end(size_type n);
const_local_iterator end(size_type n) const;
const_local_iterator cend(size_type n) const;
size_type bucket_count() const;
size_type max_bucket_count() const;
size_type bucket_size(size_type n) const;
size_type bucket(const Key& key) const;
float load_factor() const;
float max_load_factor() const;
void max_load_factor(float ml);
void rehash(size_type count);
void reserve(size_type count);
// observers
hasher hash_function() const;
key_equal key_eq() const;
};
template<class Key, class Hash, class KeyEqual, class Allocator>
bool operator==(const unordered_set<Key, Hash, KeyEqual, Allocator>& lhs,
const unordered_set<Key, Hash, KeyEqual, Allocator>& rhs);
template<class Key, class Hash, class KeyEqual, class Allocator>
bool operator!=(const unordered_set<Key, Hash, KeyEqual, Allocator>& lhs,
const unordered_set<Key, Hash, KeyEqual, Allocator>& rhs);
template<class Key, class Hash, class KeyEqual, class Alloc>
void swap(unordered_set<Key, Hash, KeyEqual, Alloc>& lhs,
unordered_set<Key, Hash, KeyEqual, Alloc>& rhs);
template <
class Key,
class Hash = std::hash<Key>,
class KeyEqual = std::equal_to<Key>,
class Allocator = std::allocator<Key>
> class unordered_multiset {
public:
typedef Key key_type;
typedef Key value_type;
typedef size_t size_type; // actual type unspecified
typedef ptrdiff_t difference_type; // actual type not specified
typedef Hash hasher;
typedef KeyEqual key_equal;
typedef Allocator allocator_type;
typedef value_type& reference;
typedef const value_type& const_reference;
#if CPPREFERENCE_SIMPLIFY_TYPEDEFS
typedef value_type* pointer;
typedef const value_type* const_pointer;
#else
typedef typename std::allocator_traits<Allocator>::pointer pointer;
typedef typename std::allocator_traits<Allocator>::const_pointer const_pointer;
#endif
typedef Key* iterator; // actual type is unspecified
typedef const Key* const_iterator; // actual type is unspecified
typedef Key* local_iterator; // actual type is unspecified
typedef const Key* const_local_iterator; // actual type is unspecified
// constructor
#if CPPREFERENCE_STDVER <2014
explicit unordered_multiset(size_type bucket_count = 0 /*implementation-defined*/,
const Hash& hash = Hash(),
const KeyEqual& equal = KeyEqual(),
const Allocator& alloc = Allocator());
#else
unordered_multiset();
explicit unordered_multiset(size_type bucket_count,
const Hash& hash = Hash(),
const KeyEqual& equal = KeyEqual(),
const Allocator& alloc = Allocator());
unordered_multiset(size_type bucket_count,
const Allocator& alloc);
unordered_multiset(size_type bucket_count,
const Hash& hash,
const Allocator& alloc);
#endif
explicit unordered_multiset(const Allocator& alloc);
template<class InputIt>
unordered_multiset(InputIt first, InputIt last,
size_type bucket_count = 0 /*implementation-defined*/,
const Hash& hash = Hash(),
const KeyEqual& equal = KeyEqual(),
const Allocator& alloc = Allocator());
#if CPPREFERENCE_STDVER>= 2014
template<class InputIt>
unordered_multiset(InputIt first, InputIt last,
size_type bucket_count,
const Allocator& alloc);
template<class InputIt>
unordered_multiset(InputIt first, InputIt last,
size_type bucket_count,
const Hash& hash,
const Allocator& alloc);
#endif
unordered_multiset(const unordered_multiset& other);
unordered_multiset(const unordered_multiset& other, const Allocator& alloc);
unordered_multiset(unordered_multiset&& other);
unordered_multiset(unordered_multiset&& other, const Allocator& alloc);
unordered_multiset(std::initializer_list<value_type> init,
size_type bucket_count = /*implementation-defined*/0,
const Hash& hash = Hash(),
const KeyEqual& equal = KeyEqual(),
const Allocator& alloc = Allocator());
#if CPPREFERENCE_STDVER>= 2014
unordered_multiset(std::initializer_list<value_type> init,
size_type bucket_count,
const Allocator& alloc);
unordered_multiset(std::initializer_list<value_type> init,
size_typ
9623
e bucket_count,
const Hash& hash,
const Allocator& alloc);
#endif
#if CPPREFERENCE_STDVER>= 2014
unordered_multiset(std::initializer_list<value_type> init, const Allocator& alloc);
#endif
~unordered_multiset();
unordered_multiset& operator=(const unordered_multiset& other);
unordered_multiset& operator=(unordered_multiset&& other);
unordered_multiset& operator=(initializer_list<value_type> ilist);
allocator_type get_allocator() const;
// iterators
iterator begin();
const_iterator begin() const;
iterator end();
const_iterator end() const;
const_iterator cbegin() const;
const_iterator cend() const;
// capacity
bool empty() const;
size_type size() const;
size_type max_size() const;
// modifiers
void clear();
std::pair<iterator, bool> insert(const value_type& value);
std::pair<iterator, bool> insert(value_type&& value);
iterator insert(const_iterator hint, const value_type& value);
iterator insert(const_iterator hint, value_type&& value);
template<class InputIt>
void insert(InputIt first, InputIt last);
void insert(std::initializer_list<value_type> ilist);
template<class... Args>
std::pair<iterator, bool> emplace(Args&& ... args);
template <class... Args>
iterator emplace_hint(const_iterator hint, Args&& ... args);
iterator erase(const_iterator pos);
iterator erase(const_iterator first, const_iterator last);
size_type erase(const key_type& key);
void swap(unordered_multiset& other);
// lookup
size_type count(const Key& key) const;
iterator find(const Key& key);
const_iterator find(const Key& key) const;
std::pair<iterator, iterator> equal_range(const Key& key);
std::pair<const_iterator, const_iterator> equal_range(const Key& key) const;
// bucket interface
local_iterator begin(size_type n);
const_local_iterator begin(size_type n) const;
const_local_iterator cbegin(size_type n) const;
local_iterator end(size_type n);
const_local_iterator end(size_type n) const;
const_local_iterator cend(size_type n) const;
size_type bucket_count() const;
size_type max_bucket_count() const;
size_type bucket_size(size_type n) const;
size_type bucket(const Key& key) const;
float load_factor() const;
float max_load_factor() const;
void max_load_factor(float ml);
void rehash(size_type count);
void reserve(size_type count);
// observers
hasher hash_function() const;
key_equal key_eq() const;
};
template<class Key, class Hash, class KeyEqual, class Allocator>
bool operator==(const unordered_multiset<Key, Hash, KeyEqual, Allocator>& lhs,
const unordered_multiset<Key, Hash, KeyEqual, Allocator>& rhs);
template<class Key, class Hash, class KeyEqual, class Allocator>
bool operator!=(const unordered_multiset<Key, Hash, KeyEqual, Allocator>& lhs,
const unordered_multiset<Key, Hash, KeyEqual, Allocator>& rhs);
template<class Key, class Hash, class KeyEqual, class Alloc>
void swap(unordered_multiset<Key, Hash, KeyEqual, Alloc>& lhs,
unordered_multiset<Key, Hash, KeyEqual, Alloc>& rhs);
} // namespace std
#endif // CPPREFERENCE_STDVER>= 2011
#endif // CPPREFERENCE_UNORDERED_SET_H