tmp/tmppvzhqx85/{from.md → to.md}
RENAMED
|
@@ -1,19 +1,18 @@
|
|
| 1 |
### Specialized algorithms <a id="specialized.algorithms">[[specialized.algorithms]]</a>
|
| 2 |
|
| 3 |
-
All the iterators that are used as
|
| 4 |
-
|
| 5 |
-
|
| 6 |
-
|
| 7 |
-
|
| 8 |
-
|
| 9 |
-
|
| 10 |
-
|
| 11 |
-
|
| 12 |
-
|
| 13 |
-
|
| 14 |
-
effects.
|
| 15 |
|
| 16 |
#### `addressof` <a id="specialized.addressof">[[specialized.addressof]]</a>
|
| 17 |
|
| 18 |
``` cpp
|
| 19 |
template <class T> T* addressof(T& r) noexcept;
|
|
|
|
| 1 |
### Specialized algorithms <a id="specialized.algorithms">[[specialized.algorithms]]</a>
|
| 2 |
|
| 3 |
+
All the iterators that are used as template parameters in the following
|
| 4 |
+
algorithms are required to have their `operator*` return an object for
|
| 5 |
+
which `operator&` is defined and returns a pointer to `T`. In the
|
| 6 |
+
algorithm `uninitialized_copy`, the template parameter `InputIterator`
|
| 7 |
+
is required to satisfy the requirements of an input iterator (
|
| 8 |
+
[[input.iterators]]). In all of the following algorithms, the template
|
| 9 |
+
parameter `ForwardIterator` is required to satisfy the requirements of a
|
| 10 |
+
forward iterator ([[forward.iterators]]), and is required to have the
|
| 11 |
+
property that no exceptions are thrown from increment, assignment,
|
| 12 |
+
comparison, or indirection through valid iterators. In the following
|
| 13 |
+
algorithms, if an exception is thrown there are no effects.
|
|
|
|
| 14 |
|
| 15 |
#### `addressof` <a id="specialized.addressof">[[specialized.addressof]]</a>
|
| 16 |
|
| 17 |
``` cpp
|
| 18 |
template <class T> T* addressof(T& r) noexcept;
|