From Jason Turner

[unord.set.syn]

C++17 → C++20 2.9 KB 34 lines
Current Draft | LaTeX Source
Archived: C++17 | C++20
Markdown: C++17 | C++20
Explore in Adventure Game

Diff to HTML by rtfpessoa

Files changed (1) hide show
  1. tmp/tmpk3cakzg9/{from.md → to.md} +17 -13
tmp/tmpk3cakzg9/{from.md → to.md} RENAMED
@@ -1,9 +1,10 @@
1
  ### Header `<unordered_set>` synopsis <a id="unord.set.syn">[[unord.set.syn]]</a>
2
 
3
  ``` cpp
4
- #include <initializer_list>
 
5
 
6
  namespace std {
7
  // [unord.set], class template unordered_set
8
  template<class Key,
9
  class Hash = hash<Key>,
@@ -16,32 +17,35 @@ namespace std {
16
  class Hash = hash<Key>,
17
  class Pred = equal_to<Key>,
18
  class Alloc = allocator<Key>>
19
  class unordered_multiset;
20
 
 
 
 
 
 
 
 
 
21
  template<class Key, class Hash, class Pred, class Alloc>
22
  void swap(unordered_set<Key, Hash, Pred, Alloc>& x,
23
  unordered_set<Key, Hash, Pred, Alloc>& y)
24
  noexcept(noexcept(x.swap(y)));
25
 
26
  template<class Key, class Hash, class Pred, class Alloc>
27
  void swap(unordered_multiset<Key, Hash, Pred, Alloc>& x,
28
  unordered_multiset<Key, Hash, Pred, Alloc>& y)
29
  noexcept(noexcept(x.swap(y)));
30
 
31
- template <class Key, class Hash, class Pred, class Alloc>
32
- bool operator==(const unordered_set<Key, Hash, Pred, Alloc>& a,
33
- const unordered_set<Key, Hash, Pred, Alloc>& b);
34
- template <class Key, class Hash, class Pred, class Alloc>
35
- bool operator!=(const unordered_set<Key, Hash, Pred, Alloc>& a,
36
- const unordered_set<Key, Hash, Pred, Alloc>& b);
37
- template <class Key, class Hash, class Pred, class Alloc>
38
- bool operator==(const unordered_multiset<Key, Hash, Pred, Alloc>& a,
39
- const unordered_multiset<Key, Hash, Pred, Alloc>& b);
40
- template <class Key, class Hash, class Pred, class Alloc>
41
- bool operator!=(const unordered_multiset<Key, Hash, Pred, Alloc>& a,
42
- const unordered_multiset<Key, Hash, Pred, Alloc>& b);
43
 
44
  namespace pmr {
45
  template<class Key,
46
  class Hash = hash<Key>,
47
  class Pred = equal_to<Key>>
 
1
  ### Header `<unordered_set>` synopsis <a id="unord.set.syn">[[unord.set.syn]]</a>
2
 
3
  ``` cpp
4
+ #include <compare> // see [compare.syn]
5
+ #include <initializer_list> // see [initializer.list.syn]
6
 
7
  namespace std {
8
  // [unord.set], class template unordered_set
9
  template<class Key,
10
  class Hash = hash<Key>,
 
17
  class Hash = hash<Key>,
18
  class Pred = equal_to<Key>,
19
  class Alloc = allocator<Key>>
20
  class unordered_multiset;
21
 
22
+ template<class Key, class Hash, class Pred, class Alloc>
23
+ bool operator==(const unordered_set<Key, Hash, Pred, Alloc>& a,
24
+ const unordered_set<Key, Hash, Pred, Alloc>& b);
25
+
26
+ template<class Key, class Hash, class Pred, class Alloc>
27
+ bool operator==(const unordered_multiset<Key, Hash, Pred, Alloc>& a,
28
+ const unordered_multiset<Key, Hash, Pred, Alloc>& b);
29
+
30
  template<class Key, class Hash, class Pred, class Alloc>
31
  void swap(unordered_set<Key, Hash, Pred, Alloc>& x,
32
  unordered_set<Key, Hash, Pred, Alloc>& y)
33
  noexcept(noexcept(x.swap(y)));
34
 
35
  template<class Key, class Hash, class Pred, class Alloc>
36
  void swap(unordered_multiset<Key, Hash, Pred, Alloc>& x,
37
  unordered_multiset<Key, Hash, Pred, Alloc>& y)
38
  noexcept(noexcept(x.swap(y)));
39
 
40
+ template<class K, class H, class P, class A, class Predicate>
41
+ typename unordered_set<K, H, P, A>::size_type
42
+ erase_if(unordered_set<K, H, P, A>& c, Predicate pred);
43
+
44
+ template<class K, class H, class P, class A, class Predicate>
45
+ typename unordered_multiset<K, H, P, A>::size_type
46
+ erase_if(unordered_multiset<K, H, P, A>& c, Predicate pred);
 
 
 
 
 
47
 
48
  namespace pmr {
49
  template<class Key,
50
  class Hash = hash<Key>,
51
  class Pred = equal_to<Key>>