tmp/tmphv35xtzb/{from.md → to.md}
RENAMED
|
@@ -16,12 +16,12 @@ object is not empty if `N` > 0. An `array` meets some of the
|
|
| 16 |
requirements of a sequence container [[sequence.reqmts]]. Descriptions
|
| 17 |
are provided here only for operations on `array` that are not described
|
| 18 |
in one of these tables and for operations where there is additional
|
| 19 |
semantic information.
|
| 20 |
|
| 21 |
-
`array<T, N>` is a structural type [[
|
| 22 |
-
type. Two values `a1` and `a2` of type `array<T, N>` are
|
| 23 |
template-argument-equivalent [[temp.type]] if and only if each pair of
|
| 24 |
corresponding elements in `a1` and `a2` are
|
| 25 |
template-argument-equivalent.
|
| 26 |
|
| 27 |
The types `iterator` and `const_iterator` meet the constexpr iterator
|
|
@@ -64,19 +64,19 @@ namespace std {
|
|
| 64 |
constexpr const_iterator cend() const noexcept;
|
| 65 |
constexpr const_reverse_iterator crbegin() const noexcept;
|
| 66 |
constexpr const_reverse_iterator crend() const noexcept;
|
| 67 |
|
| 68 |
// capacity
|
| 69 |
-
|
| 70 |
constexpr size_type size() const noexcept;
|
| 71 |
constexpr size_type max_size() const noexcept;
|
| 72 |
|
| 73 |
// element access
|
| 74 |
constexpr reference operator[](size_type n);
|
| 75 |
constexpr const_reference operator[](size_type n) const;
|
| 76 |
-
constexpr reference at(size_type n);
|
| 77 |
-
constexpr const_reference at(size_type n) const;
|
| 78 |
constexpr reference front();
|
| 79 |
constexpr const_reference front() const;
|
| 80 |
constexpr reference back();
|
| 81 |
constexpr const_reference back() const;
|
| 82 |
|
|
|
|
| 16 |
requirements of a sequence container [[sequence.reqmts]]. Descriptions
|
| 17 |
are provided here only for operations on `array` that are not described
|
| 18 |
in one of these tables and for operations where there is additional
|
| 19 |
semantic information.
|
| 20 |
|
| 21 |
+
`array<T, N>` is a structural type [[term.structural.type]] if `T` is a
|
| 22 |
+
structural type. Two values `a1` and `a2` of type `array<T, N>` are
|
| 23 |
template-argument-equivalent [[temp.type]] if and only if each pair of
|
| 24 |
corresponding elements in `a1` and `a2` are
|
| 25 |
template-argument-equivalent.
|
| 26 |
|
| 27 |
The types `iterator` and `const_iterator` meet the constexpr iterator
|
|
|
|
| 64 |
constexpr const_iterator cend() const noexcept;
|
| 65 |
constexpr const_reverse_iterator crbegin() const noexcept;
|
| 66 |
constexpr const_reverse_iterator crend() const noexcept;
|
| 67 |
|
| 68 |
// capacity
|
| 69 |
+
constexpr bool empty() const noexcept;
|
| 70 |
constexpr size_type size() const noexcept;
|
| 71 |
constexpr size_type max_size() const noexcept;
|
| 72 |
|
| 73 |
// element access
|
| 74 |
constexpr reference operator[](size_type n);
|
| 75 |
constexpr const_reference operator[](size_type n) const;
|
| 76 |
+
constexpr reference at(size_type n); // freestanding-deleted
|
| 77 |
+
constexpr const_reference at(size_type n) const; // freestanding-deleted
|
| 78 |
constexpr reference front();
|
| 79 |
constexpr const_reference front() const;
|
| 80 |
constexpr reference back();
|
| 81 |
constexpr const_reference back() const;
|
| 82 |
|