tmp/tmpxzs_qpmx/{from.md → to.md}
RENAMED
|
@@ -0,0 +1,12 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
#### Concept <a id="alg.req.sortable">[[alg.req.sortable]]</a>
|
| 2 |
+
|
| 3 |
+
The `sortable` concept specifies the common requirements of algorithms
|
| 4 |
+
that permute sequences into ordered sequences (e.g., `sort`).
|
| 5 |
+
|
| 6 |
+
``` cpp
|
| 7 |
+
template<class I, class R = ranges::less, class P = identity>
|
| 8 |
+
concept sortable =
|
| 9 |
+
permutable<I> &&
|
| 10 |
+
indirect_strict_weak_order<R, projected<I, P>>;
|
| 11 |
+
```
|
| 12 |
+
|