tmp/tmp54q4lyil/{from.md → to.md}
RENAMED
|
@@ -0,0 +1,33 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
#### Member functions <a id="array.members">[[array.members]]</a>
|
| 2 |
+
|
| 3 |
+
``` cpp
|
| 4 |
+
constexpr size_type size() const noexcept;
|
| 5 |
+
```
|
| 6 |
+
|
| 7 |
+
*Returns:* `N`.
|
| 8 |
+
|
| 9 |
+
``` cpp
|
| 10 |
+
constexpr T* data() noexcept;
|
| 11 |
+
constexpr const T* data() const noexcept;
|
| 12 |
+
```
|
| 13 |
+
|
| 14 |
+
*Returns:* A pointer such that \[`data()`, `data() + size()`) is a valid
|
| 15 |
+
range. For a non-empty array, `data()` `==` `addressof(front())`.
|
| 16 |
+
|
| 17 |
+
``` cpp
|
| 18 |
+
constexpr void fill(const T& u);
|
| 19 |
+
```
|
| 20 |
+
|
| 21 |
+
*Effects:* As if by `fill_n(begin(), N, u)`.
|
| 22 |
+
|
| 23 |
+
``` cpp
|
| 24 |
+
constexpr void swap(array& y) noexcept(is_nothrow_swappable_v<T>);
|
| 25 |
+
```
|
| 26 |
+
|
| 27 |
+
*Effects:* Equivalent to `swap_ranges(begin(), end(), y.begin())`.
|
| 28 |
+
|
| 29 |
+
[*Note 1*: Unlike the `swap` function for other containers,
|
| 30 |
+
`array::swap` takes linear time, may exit via an exception, and does not
|
| 31 |
+
cause iterators to become associated with the other
|
| 32 |
+
container. — *end note*]
|
| 33 |
+
|