tmp/tmp6rku5fmd/{from.md → to.md}
RENAMED
|
@@ -0,0 +1,17 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
#### Concept <a id="alg.req.mergeable">[[alg.req.mergeable]]</a>
|
| 2 |
+
|
| 3 |
+
The `mergeable` concept specifies the requirements of algorithms that
|
| 4 |
+
merge sorted sequences into an output sequence by copying elements.
|
| 5 |
+
|
| 6 |
+
``` cpp
|
| 7 |
+
template<class I1, class I2, class Out, class R = ranges::less,
|
| 8 |
+
class P1 = identity, class P2 = identity>
|
| 9 |
+
concept mergeable =
|
| 10 |
+
input_iterator<I1> &&
|
| 11 |
+
input_iterator<I2> &&
|
| 12 |
+
weakly_incrementable<Out> &&
|
| 13 |
+
indirectly_copyable<I1, Out> &&
|
| 14 |
+
indirectly_copyable<I2, Out> &&
|
| 15 |
+
indirect_strict_weak_order<R, projected<I1, P1>, projected<I2, P2>>;
|
| 16 |
+
```
|
| 17 |
+
|