From Jason Turner

[queue.syn]

C++17 → C++20 2.5 KB 29 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/tmpvh937k0f/{from.md → to.md} +18 -8
tmp/tmpvh937k0f/{from.md → to.md} RENAMED
@@ -1,32 +1,42 @@
1
  ### Header `<queue>` synopsis <a id="queue.syn">[[queue.syn]]</a>
2
 
3
  ``` cpp
4
- #include <initializer_list>
 
5
 
6
  namespace std {
7
  template<class T, class Container = deque<T>> class queue;
8
- template <class T, class Container = vector<T>,
9
- class Compare = less<typename Container::value_type>>
10
- class priority_queue;
11
 
12
  template<class T, class Container>
13
  bool operator==(const queue<T, Container>& x, const queue<T, Container>& y);
14
- template <class T, class Container>
15
- bool operator< (const queue<T, Container>& x, const queue<T, Container>& y);
16
  template<class T, class Container>
17
  bool operator!=(const queue<T, Container>& x, const queue<T, Container>& y);
 
 
18
  template<class T, class Container>
19
  bool operator> (const queue<T, Container>& x, const queue<T, Container>& y);
20
- template <class T, class Container>
21
- bool operator>=(const queue<T, Container>& x, const queue<T, Container>& y);
22
  template<class T, class Container>
23
  bool operator<=(const queue<T, Container>& x, const queue<T, Container>& y);
 
 
 
 
 
24
 
25
  template<class T, class Container>
26
  void swap(queue<T, Container>& x, queue<T, Container>& y) noexcept(noexcept(x.swap(y)));
 
 
 
 
 
 
 
27
  template<class T, class Container, class Compare>
28
  void swap(priority_queue<T, Container, Compare>& x,
29
  priority_queue<T, Container, Compare>& y) noexcept(noexcept(x.swap(y)));
 
 
30
  }
31
  ```
32
 
 
1
  ### Header `<queue>` synopsis <a id="queue.syn">[[queue.syn]]</a>
2
 
3
  ``` cpp
4
+ #include <compare> // see [compare.syn]
5
+ #include <initializer_list> // see [initializer.list.syn]
6
 
7
  namespace std {
8
  template<class T, class Container = deque<T>> class queue;
 
 
 
9
 
10
  template<class T, class Container>
11
  bool operator==(const queue<T, Container>& x, const queue<T, Container>& y);
 
 
12
  template<class T, class Container>
13
  bool operator!=(const queue<T, Container>& x, const queue<T, Container>& y);
14
+ template<class T, class Container>
15
+ bool operator< (const queue<T, Container>& x, const queue<T, Container>& y);
16
  template<class T, class Container>
17
  bool operator> (const queue<T, Container>& x, const queue<T, Container>& y);
 
 
18
  template<class T, class Container>
19
  bool operator<=(const queue<T, Container>& x, const queue<T, Container>& y);
20
+ template<class T, class Container>
21
+ bool operator>=(const queue<T, Container>& x, const queue<T, Container>& y);
22
+ template<class T, three_way_comparable Container>
23
+ compare_three_way_result_t<Container>
24
+ operator<=>(const queue<T, Container>& x, const queue<T, Container>& y);
25
 
26
  template<class T, class Container>
27
  void swap(queue<T, Container>& x, queue<T, Container>& y) noexcept(noexcept(x.swap(y)));
28
+ template<class T, class Container, class Alloc>
29
+ struct uses_allocator<queue<T, Container>, Alloc>;
30
+
31
+ template<class T, class Container = vector<T>,
32
+ class Compare = less<typename Container::value_type>>
33
+ class priority_queue;
34
+
35
  template<class T, class Container, class Compare>
36
  void swap(priority_queue<T, Container, Compare>& x,
37
  priority_queue<T, Container, Compare>& y) noexcept(noexcept(x.swap(y)));
38
+ template<class T, class Container, class Compare, class Alloc>
39
+ struct uses_allocator<priority_queue<T, Container, Compare>, Alloc>;
40
  }
41
  ```
42