tmp/tmpkd5abn63/{from.md → to.md}
RENAMED
|
@@ -4,13 +4,12 @@ The `input_or_output_iterator` concept forms the basis of the iterator
|
|
| 4 |
concept taxonomy; every iterator models `input_or_output_iterator`. This
|
| 5 |
concept specifies operations for dereferencing and incrementing an
|
| 6 |
iterator. Most algorithms will require additional operations to compare
|
| 7 |
iterators with sentinels [[iterator.concept.sentinel]], to read
|
| 8 |
[[iterator.concept.input]] or write [[iterator.concept.output]] values,
|
| 9 |
-
or to provide a richer set of iterator movements
|
| 10 |
-
[[iterator.concept.forward]], [[iterator.concept.bidir]],
|
| 11 |
-
[[iterator.concept.random.access]]).
|
| 12 |
|
| 13 |
``` cpp
|
| 14 |
template<class I>
|
| 15 |
concept input_or_output_iterator =
|
| 16 |
requires(I i) {
|
|
|
|
| 4 |
concept taxonomy; every iterator models `input_or_output_iterator`. This
|
| 5 |
concept specifies operations for dereferencing and incrementing an
|
| 6 |
iterator. Most algorithms will require additional operations to compare
|
| 7 |
iterators with sentinels [[iterator.concept.sentinel]], to read
|
| 8 |
[[iterator.concept.input]] or write [[iterator.concept.output]] values,
|
| 9 |
+
or to provide a richer set of iterator movements
|
| 10 |
+
[[iterator.concept.forward]], [[iterator.concept.bidir]], [[iterator.concept.random.access]].
|
|
|
|
| 11 |
|
| 12 |
``` cpp
|
| 13 |
template<class I>
|
| 14 |
concept input_or_output_iterator =
|
| 15 |
requires(I i) {
|