tmp/tmpyurv4n2f/{from.md → to.md}
RENAMED
|
@@ -18,12 +18,11 @@ the specified allocator.
|
|
| 18 |
*Requires:* `T` shall be `DefaultInsertable` into `*this`.
|
| 19 |
|
| 20 |
*Complexity:* Linear in `n`.
|
| 21 |
|
| 22 |
``` cpp
|
| 23 |
-
list(size_type n, const T& value,
|
| 24 |
-
const Allocator& = Allocator());
|
| 25 |
```
|
| 26 |
|
| 27 |
*Effects:* Constructs a `list` with `n` copies of `value`, using the
|
| 28 |
specified allocator.
|
| 29 |
|
|
@@ -31,12 +30,11 @@ specified allocator.
|
|
| 31 |
|
| 32 |
*Complexity:* Linear in `n`.
|
| 33 |
|
| 34 |
``` cpp
|
| 35 |
template <class InputIterator>
|
| 36 |
-
list(InputIterator first, InputIterator last,
|
| 37 |
-
const Allocator& = Allocator());
|
| 38 |
```
|
| 39 |
|
| 40 |
*Effects:* Constructs a `list` equal to the range \[`first`, `last`).
|
| 41 |
|
| 42 |
*Complexity:* Linear in `distance(first, last)`.
|
|
|
|
| 18 |
*Requires:* `T` shall be `DefaultInsertable` into `*this`.
|
| 19 |
|
| 20 |
*Complexity:* Linear in `n`.
|
| 21 |
|
| 22 |
``` cpp
|
| 23 |
+
list(size_type n, const T& value, const Allocator& = Allocator());
|
|
|
|
| 24 |
```
|
| 25 |
|
| 26 |
*Effects:* Constructs a `list` with `n` copies of `value`, using the
|
| 27 |
specified allocator.
|
| 28 |
|
|
|
|
| 30 |
|
| 31 |
*Complexity:* Linear in `n`.
|
| 32 |
|
| 33 |
``` cpp
|
| 34 |
template <class InputIterator>
|
| 35 |
+
list(InputIterator first, InputIterator last, const Allocator& = Allocator());
|
|
|
|
| 36 |
```
|
| 37 |
|
| 38 |
*Effects:* Constructs a `list` equal to the range \[`first`, `last`).
|
| 39 |
|
| 40 |
*Complexity:* Linear in `distance(first, last)`.
|