tmp/tmp7t_qi8e4/{from.md → to.md}
RENAMED
|
@@ -1,149 +1,6 @@
|
|
| 1 |
### In general <a id="sequences.general">[[sequences.general]]</a>
|
| 2 |
|
| 3 |
The headers `<array>`, `<deque>`, `<forward_list>`, `<list>`, and
|
| 4 |
-
`<vector>` define
|
| 5 |
sequence containers.
|
| 6 |
|
| 7 |
-
The headers `<queue>` and `<stack>` define container adaptors (
|
| 8 |
-
[[container.adaptors]]) that also meet the requirements for sequence
|
| 9 |
-
containers.
|
| 10 |
-
|
| 11 |
-
\synopsis{Header \texttt{\<array\>} synopsis}
|
| 12 |
-
|
| 13 |
-
``` cpp
|
| 14 |
-
#include <initializer_list>
|
| 15 |
-
|
| 16 |
-
namespace std {
|
| 17 |
-
template <class T, size_t N> struct array;
|
| 18 |
-
template <class T, size_t N>
|
| 19 |
-
bool operator==(const array<T,N>& x, const array<T,N>& y);
|
| 20 |
-
template <class T, size_t N>
|
| 21 |
-
bool operator!=(const array<T,N>& x, const array<T,N>& y);
|
| 22 |
-
template <class T, size_t N>
|
| 23 |
-
bool operator<(const array<T,N>& x, const array<T,N>& y);
|
| 24 |
-
template <class T, size_t N>
|
| 25 |
-
bool operator>(const array<T,N>& x, const array<T,N>& y);
|
| 26 |
-
template <class T, size_t N>
|
| 27 |
-
bool operator<=(const array<T,N>& x, const array<T,N>& y);
|
| 28 |
-
template <class T, size_t N>
|
| 29 |
-
bool operator>=(const array<T,N>& x, const array<T,N>& y);
|
| 30 |
-
template <class T, size_t N>
|
| 31 |
-
void swap(array<T,N>& x, array<T,N>& y) noexcept(noexcept(x.swap(y)));
|
| 32 |
-
|
| 33 |
-
template <class T> class tuple_size;
|
| 34 |
-
template <size_t I, class T> class tuple_element;
|
| 35 |
-
template <class T, size_t N>
|
| 36 |
-
struct tuple_size<array<T, N> >;
|
| 37 |
-
template <size_t I, class T, size_t N>
|
| 38 |
-
struct tuple_element<I, array<T, N> >;
|
| 39 |
-
template <size_t I, class T, size_t N>
|
| 40 |
-
constexpr T& get(array<T, N>&) noexcept;
|
| 41 |
-
template <size_t I, class T, size_t N>
|
| 42 |
-
constexpr T&& get(array<T, N>&&) noexcept;
|
| 43 |
-
template <size_t I, class T, size_t N>
|
| 44 |
-
constexpr const T& get(const array<T, N>&) noexcept;
|
| 45 |
-
}
|
| 46 |
-
```
|
| 47 |
-
|
| 48 |
-
\synopsis{Header \texttt{\<deque\>} synopsis}
|
| 49 |
-
|
| 50 |
-
``` cpp
|
| 51 |
-
#include <initializer_list>
|
| 52 |
-
|
| 53 |
-
namespace std {
|
| 54 |
-
template <class T, class Allocator = allocator<T> > class deque;
|
| 55 |
-
template <class T, class Allocator>
|
| 56 |
-
bool operator==(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
|
| 57 |
-
template <class T, class Allocator>
|
| 58 |
-
bool operator<(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
|
| 59 |
-
template <class T, class Allocator>
|
| 60 |
-
bool operator!=(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
|
| 61 |
-
template <class T, class Allocator>
|
| 62 |
-
bool operator>(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
|
| 63 |
-
template <class T, class Allocator>
|
| 64 |
-
bool operator>=(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
|
| 65 |
-
template <class T, class Allocator>
|
| 66 |
-
bool operator<=(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
|
| 67 |
-
template <class T, class Allocator>
|
| 68 |
-
void swap(deque<T,Allocator>& x, deque<T,Allocator>& y);
|
| 69 |
-
}
|
| 70 |
-
```
|
| 71 |
-
|
| 72 |
-
\synopsis{Header \texttt{\<forward_list\>} synopsis}
|
| 73 |
-
|
| 74 |
-
``` cpp
|
| 75 |
-
#include <initializer_list>
|
| 76 |
-
|
| 77 |
-
namespace std {
|
| 78 |
-
template <class T, class Allocator = allocator<T> > class forward_list;
|
| 79 |
-
template <class T, class Allocator>
|
| 80 |
-
bool operator==(const forward_list<T,Allocator>& x, const forward_list<T,Allocator>& y);
|
| 81 |
-
template <class T, class Allocator>
|
| 82 |
-
bool operator< (const forward_list<T,Allocator>& x, const forward_list<T,Allocator>& y);
|
| 83 |
-
template <class T, class Allocator>
|
| 84 |
-
bool operator!=(const forward_list<T,Allocator>& x, const forward_list<T,Allocator>& y);
|
| 85 |
-
template <class T, class Allocator>
|
| 86 |
-
bool operator> (const forward_list<T,Allocator>& x, const forward_list<T,Allocator>& y);
|
| 87 |
-
template <class T, class Allocator>
|
| 88 |
-
bool operator>=(const forward_list<T,Allocator>& x, const forward_list<T,Allocator>& y);
|
| 89 |
-
template <class T, class Allocator>
|
| 90 |
-
bool operator<=(const forward_list<T,Allocator>& x, const forward_list<T,Allocator>& y);
|
| 91 |
-
template <class T, class Allocator>
|
| 92 |
-
void swap(forward_list<T,Allocator>& x, forward_list<T,Allocator>& y);
|
| 93 |
-
}
|
| 94 |
-
```
|
| 95 |
-
|
| 96 |
-
\synopsis{Header \texttt{\<list\>} synopsis}
|
| 97 |
-
|
| 98 |
-
``` cpp
|
| 99 |
-
#include <initializer_list>
|
| 100 |
-
|
| 101 |
-
namespace std {
|
| 102 |
-
template <class T, class Allocator = allocator<T> > class list;
|
| 103 |
-
template <class T, class Allocator>
|
| 104 |
-
bool operator==(const list<T,Allocator>& x, const list<T,Allocator>& y);
|
| 105 |
-
template <class T, class Allocator>
|
| 106 |
-
bool operator< (const list<T,Allocator>& x, const list<T,Allocator>& y);
|
| 107 |
-
template <class T, class Allocator>
|
| 108 |
-
bool operator!=(const list<T,Allocator>& x, const list<T,Allocator>& y);
|
| 109 |
-
template <class T, class Allocator>
|
| 110 |
-
bool operator> (const list<T,Allocator>& x, const list<T,Allocator>& y);
|
| 111 |
-
template <class T, class Allocator>
|
| 112 |
-
bool operator>=(const list<T,Allocator>& x, const list<T,Allocator>& y);
|
| 113 |
-
template <class T, class Allocator>
|
| 114 |
-
bool operator<=(const list<T,Allocator>& x, const list<T,Allocator>& y);
|
| 115 |
-
template <class T, class Allocator>
|
| 116 |
-
void swap(list<T,Allocator>& x, list<T,Allocator>& y);
|
| 117 |
-
}
|
| 118 |
-
```
|
| 119 |
-
|
| 120 |
-
\synopsis{Header \texttt{\<vector\>} synopsis}
|
| 121 |
-
|
| 122 |
-
``` cpp
|
| 123 |
-
#include <initializer_list>
|
| 124 |
-
|
| 125 |
-
namespace std {
|
| 126 |
-
template <class T, class Allocator = allocator<T> > class vector;
|
| 127 |
-
template <class T, class Allocator>
|
| 128 |
-
bool operator==(const vector<T,Allocator>& x,const vector<T,Allocator>& y);
|
| 129 |
-
template <class T, class Allocator>
|
| 130 |
-
bool operator< (const vector<T,Allocator>& x,const vector<T,Allocator>& y);
|
| 131 |
-
template <class T, class Allocator>
|
| 132 |
-
bool operator!=(const vector<T,Allocator>& x,const vector<T,Allocator>& y);
|
| 133 |
-
template <class T, class Allocator>
|
| 134 |
-
bool operator> (const vector<T,Allocator>& x,const vector<T,Allocator>& y);
|
| 135 |
-
template <class T, class Allocator>
|
| 136 |
-
bool operator>=(const vector<T,Allocator>& x,const vector<T,Allocator>& y);
|
| 137 |
-
template <class T, class Allocator>
|
| 138 |
-
bool operator<=(const vector<T,Allocator>& x,const vector<T,Allocator>& y);
|
| 139 |
-
template <class T, class Allocator>
|
| 140 |
-
void swap(vector<T,Allocator>& x, vector<T,Allocator>& y);
|
| 141 |
-
|
| 142 |
-
template <class Allocator> class vector<bool,Allocator>;
|
| 143 |
-
|
| 144 |
-
// hash support
|
| 145 |
-
template <class T> struct hash;
|
| 146 |
-
template <class Allocator> struct hash<vector<bool, Allocator> >;
|
| 147 |
-
}
|
| 148 |
-
```
|
| 149 |
-
|
|
|
|
| 1 |
### In general <a id="sequences.general">[[sequences.general]]</a>
|
| 2 |
|
| 3 |
The headers `<array>`, `<deque>`, `<forward_list>`, `<list>`, and
|
| 4 |
+
`<vector>` define class templates that meet the requirements for
|
| 5 |
sequence containers.
|
| 6 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|