tmp/tmpe0ddzvns/{from.md → to.md}
RENAMED
|
@@ -1,24 +1,24 @@
|
|
| 1 |
#### `forward_list` constructors, copy, assignment <a id="forwardlist.cons">[[forwardlist.cons]]</a>
|
| 2 |
|
| 3 |
``` cpp
|
| 4 |
-
explicit forward_list(const Allocator&
|
| 5 |
```
|
| 6 |
|
| 7 |
*Effects:* Constructs an empty `forward_list` object using the specified
|
| 8 |
allocator.
|
| 9 |
|
| 10 |
*Complexity:* Constant.
|
| 11 |
|
| 12 |
``` cpp
|
| 13 |
-
explicit forward_list(size_type n);
|
| 14 |
```
|
| 15 |
|
| 16 |
-
*Effects:* Constructs a `forward_list` object with `n`
|
| 17 |
-
elements.
|
| 18 |
|
| 19 |
-
*Requires:* `T` shall be `
|
| 20 |
|
| 21 |
*Complexity:* Linear in `n`.
|
| 22 |
|
| 23 |
``` cpp
|
| 24 |
forward_list(size_type n, const T& value, const Allocator& = Allocator());
|
|
@@ -39,18 +39,5 @@ template <class InputIterator>
|
|
| 39 |
*Effects:* Constructs a `forward_list` object equal to the range
|
| 40 |
\[`first`, `last`).
|
| 41 |
|
| 42 |
*Complexity:* Linear in `distance(first, last)`.
|
| 43 |
|
| 44 |
-
``` cpp
|
| 45 |
-
template <class InputIterator>
|
| 46 |
-
void assign(InputIterator first, InputIterator last);
|
| 47 |
-
```
|
| 48 |
-
|
| 49 |
-
*Effects:* `clear(); insert_after(before_begin(), first, last);`
|
| 50 |
-
|
| 51 |
-
``` cpp
|
| 52 |
-
void assign(size_type n, const T& t);
|
| 53 |
-
```
|
| 54 |
-
|
| 55 |
-
*Effects:* `clear(); insert_after(before_begin(), n, t);`
|
| 56 |
-
|
|
|
|
| 1 |
#### `forward_list` constructors, copy, assignment <a id="forwardlist.cons">[[forwardlist.cons]]</a>
|
| 2 |
|
| 3 |
``` cpp
|
| 4 |
+
explicit forward_list(const Allocator&);
|
| 5 |
```
|
| 6 |
|
| 7 |
*Effects:* Constructs an empty `forward_list` object using the specified
|
| 8 |
allocator.
|
| 9 |
|
| 10 |
*Complexity:* Constant.
|
| 11 |
|
| 12 |
``` cpp
|
| 13 |
+
explicit forward_list(size_type n, const Allocator& = Allocator());
|
| 14 |
```
|
| 15 |
|
| 16 |
+
*Effects:* Constructs a `forward_list` object with `n` default-inserted
|
| 17 |
+
elements using the specified allocator.
|
| 18 |
|
| 19 |
+
*Requires:* `T` shall be `DefaultInsertable` into `*this`.
|
| 20 |
|
| 21 |
*Complexity:* Linear in `n`.
|
| 22 |
|
| 23 |
``` cpp
|
| 24 |
forward_list(size_type n, const T& value, const Allocator& = Allocator());
|
|
|
|
| 39 |
*Effects:* Constructs a `forward_list` object equal to the range
|
| 40 |
\[`first`, `last`).
|
| 41 |
|
| 42 |
*Complexity:* Linear in `distance(first, last)`.
|
| 43 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|