tmp/tmp9zny4agz/{from.md → to.md}
RENAMED
|
@@ -1,9 +1,9 @@
|
|
| 1 |
### Raw storage iterator <a id="storage.iterator">[[storage.iterator]]</a>
|
| 2 |
|
| 3 |
`raw_storage_iterator` is provided to enable algorithms to store their
|
| 4 |
-
results into uninitialized memory. The
|
| 5 |
`OutputIterator` is required to have its `operator*` return an object
|
| 6 |
for which `operator&` is defined and returns a pointer to `T`, and is
|
| 7 |
also required to satisfy the requirements of an output iterator (
|
| 8 |
[[output.iterators]]).
|
| 9 |
|
|
@@ -13,14 +13,14 @@ namespace std {
|
|
| 13 |
class raw_storage_iterator
|
| 14 |
: public iterator<output_iterator_tag,void,void,void,void> {
|
| 15 |
public:
|
| 16 |
explicit raw_storage_iterator(OutputIterator x);
|
| 17 |
|
| 18 |
-
raw_storage_iterator
|
| 19 |
-
raw_storage_iterator
|
| 20 |
-
raw_storage_iterator
|
| 21 |
-
raw_storage_iterator
|
| 22 |
};
|
| 23 |
}
|
| 24 |
```
|
| 25 |
|
| 26 |
``` cpp
|
|
@@ -29,33 +29,33 @@ explicit raw_storage_iterator(OutputIterator x);
|
|
| 29 |
|
| 30 |
*Effects:* Initializes the iterator to point to the same value to which
|
| 31 |
`x` points.
|
| 32 |
|
| 33 |
``` cpp
|
| 34 |
-
raw_storage_iterator
|
| 35 |
```
|
| 36 |
|
| 37 |
*Returns:* `*this`
|
| 38 |
|
| 39 |
``` cpp
|
| 40 |
-
raw_storage_iterator
|
| 41 |
```
|
| 42 |
|
| 43 |
*Effects:* Constructs a value from `element` at the location to which
|
| 44 |
the iterator points.
|
| 45 |
|
| 46 |
*Returns:* A reference to the iterator.
|
| 47 |
|
| 48 |
``` cpp
|
| 49 |
-
raw_storage_iterator
|
| 50 |
```
|
| 51 |
|
| 52 |
*Effects:* Pre-increment: advances the iterator and returns a reference
|
| 53 |
to the updated iterator.
|
| 54 |
|
| 55 |
``` cpp
|
| 56 |
-
raw_storage_iterator
|
| 57 |
```
|
| 58 |
|
| 59 |
*Effects:* Post-increment: advances the iterator and returns the old
|
| 60 |
value of the iterator.
|
| 61 |
|
|
|
|
| 1 |
### Raw storage iterator <a id="storage.iterator">[[storage.iterator]]</a>
|
| 2 |
|
| 3 |
`raw_storage_iterator` is provided to enable algorithms to store their
|
| 4 |
+
results into uninitialized memory. The template parameter
|
| 5 |
`OutputIterator` is required to have its `operator*` return an object
|
| 6 |
for which `operator&` is defined and returns a pointer to `T`, and is
|
| 7 |
also required to satisfy the requirements of an output iterator (
|
| 8 |
[[output.iterators]]).
|
| 9 |
|
|
|
|
| 13 |
class raw_storage_iterator
|
| 14 |
: public iterator<output_iterator_tag,void,void,void,void> {
|
| 15 |
public:
|
| 16 |
explicit raw_storage_iterator(OutputIterator x);
|
| 17 |
|
| 18 |
+
raw_storage_iterator& operator*();
|
| 19 |
+
raw_storage_iterator& operator=(const T& element);
|
| 20 |
+
raw_storage_iterator& operator++();
|
| 21 |
+
raw_storage_iterator operator++(int);
|
| 22 |
};
|
| 23 |
}
|
| 24 |
```
|
| 25 |
|
| 26 |
``` cpp
|
|
|
|
| 29 |
|
| 30 |
*Effects:* Initializes the iterator to point to the same value to which
|
| 31 |
`x` points.
|
| 32 |
|
| 33 |
``` cpp
|
| 34 |
+
raw_storage_iterator& operator*();
|
| 35 |
```
|
| 36 |
|
| 37 |
*Returns:* `*this`
|
| 38 |
|
| 39 |
``` cpp
|
| 40 |
+
raw_storage_iterator& operator=(const T& element);
|
| 41 |
```
|
| 42 |
|
| 43 |
*Effects:* Constructs a value from `element` at the location to which
|
| 44 |
the iterator points.
|
| 45 |
|
| 46 |
*Returns:* A reference to the iterator.
|
| 47 |
|
| 48 |
``` cpp
|
| 49 |
+
raw_storage_iterator& operator++();
|
| 50 |
```
|
| 51 |
|
| 52 |
*Effects:* Pre-increment: advances the iterator and returns a reference
|
| 53 |
to the updated iterator.
|
| 54 |
|
| 55 |
``` cpp
|
| 56 |
+
raw_storage_iterator operator++(int);
|
| 57 |
```
|
| 58 |
|
| 59 |
*Effects:* Post-increment: advances the iterator and returns the old
|
| 60 |
value of the iterator.
|
| 61 |
|