From Jason Turner

[priqueue.cons]

Diff to HTML by rtfpessoa

tmp/tmpvbw_s_fg/{from.md → to.md} RENAMED
@@ -1,30 +1,27 @@
1
- #### `priority_queue` constructors <a id="priqueue.cons">[[priqueue.cons]]</a>
2
 
3
  ``` cpp
4
  priority_queue(const Compare& x, const Container& y);
5
- explicit priority_queue(const Compare& x = Compare(), Container&& y = Container());
6
  ```
7
 
8
- *Requires:* `x` shall define a strict weak ordering ([[alg.sorting]]).
9
 
10
  *Effects:* Initializes `comp` with `x` and `c` with `y` (copy
11
  constructing or move constructing as appropriate); calls
12
  `make_heap(c.begin(), c.end(), comp)`.
13
 
14
  ``` cpp
15
  template<class InputIterator>
16
- priority_queue(InputIterator first, InputIterator last,
17
- const Compare& x,
18
- const Container& y);
19
  template<class InputIterator>
20
- priority_queue(InputIterator first, InputIterator last,
21
- const Compare& x = Compare(),
22
  Container&& y = Container());
23
  ```
24
 
25
- *Requires:* `x` shall define a strict weak ordering ([[alg.sorting]]).
26
 
27
  *Effects:* Initializes `comp` with `x` and `c` with `y` (copy
28
  constructing or move constructing as appropriate); calls
29
  `c.insert(c.end(), first, last)`; and finally calls
30
  `make_heap(c.begin(), c.end(), comp)`.
 
1
+ #### Constructors <a id="priqueue.cons">[[priqueue.cons]]</a>
2
 
3
  ``` cpp
4
  priority_queue(const Compare& x, const Container& y);
5
+ priority_queue(const Compare& x, Container&& y);
6
  ```
7
 
8
+ *Preconditions:* `x` defines a strict weak ordering [[alg.sorting]].
9
 
10
  *Effects:* Initializes `comp` with `x` and `c` with `y` (copy
11
  constructing or move constructing as appropriate); calls
12
  `make_heap(c.begin(), c.end(), comp)`.
13
 
14
  ``` cpp
15
  template<class InputIterator>
16
+ priority_queue(InputIterator first, InputIterator last, const Compare& x, const Container& y);
 
 
17
  template<class InputIterator>
18
+ priority_queue(InputIterator first, InputIterator last, const Compare& x = Compare(),
 
19
  Container&& y = Container());
20
  ```
21
 
22
+ *Preconditions:* `x` defines a strict weak ordering [[alg.sorting]].
23
 
24
  *Effects:* Initializes `comp` with `x` and `c` with `y` (copy
25
  constructing or move constructing as appropriate); calls
26
  `c.insert(c.end(), first, last)`; and finally calls
27
  `make_heap(c.begin(), c.end(), comp)`.