From Jason Turner

[queue.syn]

C++23 → Trunk 3.2 KB 30 lines
Current Draft | LaTeX Source
Archived: C++23
Markdown: C++23 | Trunk
Explore in Adventure Game

Diff to HTML by rtfpessoa

Files changed (1) hide show
  1. tmp/tmp1ew8o4zm/{from.md → to.md} +18 -9
tmp/tmp1ew8o4zm/{from.md → to.md} RENAMED
@@ -7,38 +7,47 @@
7
  namespace std {
8
  // [queue], class template queue
9
  template<class T, class Container = deque<T>> class queue;
10
 
11
  template<class T, class Container>
12
- bool operator==(const queue<T, Container>& x, const queue<T, Container>& y);
13
  template<class T, class Container>
14
- bool operator!=(const queue<T, Container>& x, const queue<T, Container>& y);
15
  template<class T, class Container>
16
- bool operator< (const queue<T, Container>& x, const queue<T, Container>& y);
17
  template<class T, class Container>
18
- bool operator> (const queue<T, Container>& x, const queue<T, Container>& y);
19
  template<class T, class Container>
20
- bool operator<=(const queue<T, Container>& x, const queue<T, Container>& y);
21
  template<class T, class Container>
22
- bool operator>=(const queue<T, Container>& x, const queue<T, Container>& y);
23
  template<class T, three_way_comparable Container>
24
- compare_three_way_result_t<Container>
25
  operator<=>(const queue<T, Container>& x, const queue<T, Container>& y);
26
 
27
  template<class T, class Container>
28
- void swap(queue<T, Container>& x, queue<T, Container>& y) noexcept(noexcept(x.swap(y)));
 
29
  template<class T, class Container, class Alloc>
30
  struct uses_allocator<queue<T, Container>, Alloc>;
31
 
 
 
 
 
32
  // [priority.queue], class template priority_queue
33
  template<class T, class Container = vector<T>,
34
  class Compare = less<typename Container::value_type>>
35
  class priority_queue;
36
 
37
  template<class T, class Container, class Compare>
38
- void swap(priority_queue<T, Container, Compare>& x,
39
  priority_queue<T, Container, Compare>& y) noexcept(noexcept(x.swap(y)));
40
  template<class T, class Container, class Compare, class Alloc>
41
  struct uses_allocator<priority_queue<T, Container, Compare>, Alloc>;
 
 
 
 
42
  }
43
  ```
44
 
 
7
  namespace std {
8
  // [queue], class template queue
9
  template<class T, class Container = deque<T>> class queue;
10
 
11
  template<class T, class Container>
12
+ constexpr bool operator==(const queue<T, Container>& x, const queue<T, Container>& y);
13
  template<class T, class Container>
14
+ constexpr bool operator!=(const queue<T, Container>& x, const queue<T, Container>& y);
15
  template<class T, class Container>
16
+ constexpr bool operator< (const queue<T, Container>& x, const queue<T, Container>& y);
17
  template<class T, class Container>
18
+ constexpr bool operator> (const queue<T, Container>& x, const queue<T, Container>& y);
19
  template<class T, class Container>
20
+ constexpr bool operator<=(const queue<T, Container>& x, const queue<T, Container>& y);
21
  template<class T, class Container>
22
+ constexpr bool operator>=(const queue<T, Container>& x, const queue<T, Container>& y);
23
  template<class T, three_way_comparable Container>
24
+ constexpr compare_three_way_result_t<Container>
25
  operator<=>(const queue<T, Container>& x, const queue<T, Container>& y);
26
 
27
  template<class T, class Container>
28
+ constexpr void swap(queue<T, Container>& x, queue<T, Container>& y)
29
+ noexcept(noexcept(x.swap(y)));
30
  template<class T, class Container, class Alloc>
31
  struct uses_allocator<queue<T, Container>, Alloc>;
32
 
33
+ // [container.adaptors.format], formatter specialization for queue
34
+ template<class charT, class T, formattable<charT> Container>
35
+ struct formatter<queue<T, Container>, charT>;
36
+
37
  // [priority.queue], class template priority_queue
38
  template<class T, class Container = vector<T>,
39
  class Compare = less<typename Container::value_type>>
40
  class priority_queue;
41
 
42
  template<class T, class Container, class Compare>
43
+ constexpr void swap(priority_queue<T, Container, Compare>& x,
44
  priority_queue<T, Container, Compare>& y) noexcept(noexcept(x.swap(y)));
45
  template<class T, class Container, class Compare, class Alloc>
46
  struct uses_allocator<priority_queue<T, Container, Compare>, Alloc>;
47
+
48
+ // [container.adaptors.format], formatter specialization for priority_queue
49
+ template<class charT, class T, formattable<charT> Container, class Compare>
50
+ struct formatter<priority_queue<T, Container, Compare>, charT>;
51
  }
52
  ```
53