tmp/tmpkq1s4_ne/{from.md → to.md}
RENAMED
|
@@ -0,0 +1,16 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
#### General <a id="alg.req.general">[[alg.req.general]]</a>
|
| 2 |
+
|
| 3 |
+
There are several additional iterator concepts that are commonly applied
|
| 4 |
+
to families of algorithms. These group together iterator requirements of
|
| 5 |
+
algorithm families. There are three relational concepts that specify how
|
| 6 |
+
element values are transferred between `indirectly_readable` and
|
| 7 |
+
`indirectly_writable` types: `indirectly_movable`,
|
| 8 |
+
`indirectly_copyable`, and `indirectly_swappable`. There are three
|
| 9 |
+
relational concepts for rearrangements: `permutable`, `mergeable`, and
|
| 10 |
+
`sortable`. There is one relational concept for comparing values from
|
| 11 |
+
different sequences: `indirectly_comparable`.
|
| 12 |
+
|
| 13 |
+
[*Note 1*: The `ranges::less` function object type used in the concepts
|
| 14 |
+
below imposes constraints on the concepts’ arguments in addition to
|
| 15 |
+
those that appear in the concepts’ bodies [[range.cmp]]. — *end note*]
|
| 16 |
+
|