tmp/tmpsddz_zzm/{from.md → to.md}
RENAMED
|
@@ -18,7 +18,19 @@ template<class InputIterator>
|
|
| 18 |
*Effects:* Constructs an empty `map` using the specified comparison
|
| 19 |
object and allocator, and inserts elements from the range \[`first`,
|
| 20 |
`last`).
|
| 21 |
|
| 22 |
*Complexity:* Linear in N if the range \[`first`, `last`) is already
|
| 23 |
-
sorted
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 24 |
|
|
|
|
| 18 |
*Effects:* Constructs an empty `map` using the specified comparison
|
| 19 |
object and allocator, and inserts elements from the range \[`first`,
|
| 20 |
`last`).
|
| 21 |
|
| 22 |
*Complexity:* Linear in N if the range \[`first`, `last`) is already
|
| 23 |
+
sorted with respect to `comp` and otherwise N log N, where N is
|
| 24 |
+
`last - first`.
|
| 25 |
+
|
| 26 |
+
``` cpp
|
| 27 |
+
template<container-compatible-range<value_type> R>
|
| 28 |
+
map(from_range_t, R&& rg, const Compare& comp = Compare(), const Allocator& = Allocator());
|
| 29 |
+
```
|
| 30 |
+
|
| 31 |
+
*Effects:* Constructs an empty `map` using the specified comparison
|
| 32 |
+
object and allocator, and inserts elements from the range `rg`.
|
| 33 |
+
|
| 34 |
+
*Complexity:* Linear in N if `rg` is already sorted with respect to
|
| 35 |
+
`comp` and otherwise N log N, where N is `ranges::distance(rg)`.
|
| 36 |
|