forked from cplusplus/fundamentals-ts
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcontainer.html
217 lines (182 loc) · 9.79 KB
/
container.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
<cxx-clause id="container">
<h1>Containers</h1>
<cxx-section id="container.erasure">
<h1>Uniform container erasure</h1>
<cxx-section id="container.erasure.syn">
<h1>Header synopsis</h1>
<p>
For brevity, this section specifies the contents of 9 headers,
each of which behaves as described by <cxx-ref to="general.namespaces"></cxx-ref>.
</p>
<pre><code>namespace std {
namespace experimental {
inline namespace fundamentals_v2 {
<cxx-ref insynopsis="" to="container.erasure.erase_if"></cxx-ref>
<cxx-ref insynopsis="" to="container.erasure.erase"></cxx-ref>
// <experimental/string>
template <class charT, class traits, class A, class Predicate>
void erase_if(basic_string<charT, traits, A>& c, Predicate pred);
template <class charT, class traits, class A, class U>
void erase(basic_string<charT, traits, A>& c, const U& value);
// <experimental/deque>
template <class T, class A, class Predicate>
void erase_if(deque<T, A>& c, Predicate pred);
template <class T, class A, class U>
void erase(deque<T, A>& c, const U& value);
// <experimental/vector>
template <class T, class A, class Predicate>
void erase_if(vector<T, A>& c, Predicate pred);
template <class T, class A, class U>
void erase(vector<T, A>& c, const U& value);
// <experimental/forward_list>
template <class T, class A, class Predicate>
void erase_if(forward_list<T, A>& c, Predicate pred);
template <class T, class A, class U>
void erase(forward_list<T, A>& c, const U& value);
// <experimental/list>
template <class T, class A, class Predicate>
void erase_if(list<T, A>& c, Predicate pred);
template <class T, class A, class U>
void erase(list<T, A>& c, const U& value);
// <experimental/map>
template <class K, class T, class C, class A, class Predicate>
void erase_if(map<K, T, C, A>& c, Predicate pred);
template <class K, class T, class C, class A, class Predicate>
void erase_if(multimap<K, T, C, A>& c, Predicate pred);
// <experimental/set>
template <class K, class C, class A, class Predicate>
void erase_if(set<K, C, A>& c, Predicate pred);
template <class K, class C, class A, class Predicate>
void erase_if(multiset<K, C, A>& c, Predicate pred);
// <experimental/unordered_map>
template <class K, class T, class H, class P, class A, class Predicate>
void erase_if(unordered_map<K, T, H, P, A>& c, Predicate pred);
template <class K, class T, class H, class P, class A, class Predicate>
void erase_if(unordered_multimap<K, T, H, P, A>& c, Predicate pred);
// <experimental/unordered_set>
template <class K, class H, class P, class A, class Predicate>
void erase_if(unordered_set<K, H, P, A>& c, Predicate pred);
template <class K, class H, class P, class A, class Predicate>
void erase_if(unordered_multiset<K, H, P, A>& c, Predicate pred);
} // inline namespace fundamentals_v2
} // namespace experimental
} // namespace std</code></pre>
</cxx-section>
<cxx-section id="container.erasure.erase_if">
<h1>Function template <code>erase_if</code></h1>
<cxx-function>
<cxx-signature>template <class charT, class traits, class A, class Predicate>
void erase_if(basic_string<charT, traits, A>& c, Predicate pred);</cxx-signature>
<cxx-signature>template <class T, class A, class Predicate>
void erase_if(deque<T, A>& c, Predicate pred);</cxx-signature>
<cxx-signature>template <class T, class A, class Predicate>
void erase_if(vector<T, A>& c, Predicate pred);</cxx-signature>
<cxx-effects>Equivalent to: <code>c.erase(remove_if(c.begin(), c.end(), pred), c.end());</code></cxx-effects>
</cxx-function>
<cxx-function>
<cxx-signature>template <class T, class A, class Predicate>
void erase_if(forward_list<T, A>& c, Predicate pred);</cxx-signature>
<cxx-signature>template <class T, class A, class Predicate>
void erase_if(list<T, A>& c, Predicate pred);</cxx-signature>
<cxx-effects>Equivalent to: <code>c.remove_if(pred);</code></cxx-effects>
</cxx-function>
<cxx-function>
<cxx-signature>template <class K, class T, class C, class A, class Predicate>
void erase_if(map<K, T, C, A>& c, Predicate pred);</cxx-signature>
<cxx-signature>template <class K, class T, class C, class A, class Predicate>
void erase_if(multimap<K, T, C, A>& c, Predicate pred);</cxx-signature>
<cxx-signature>template <class K, class C, class A, class Predicate>
void erase_if(set<K, C, A>& c, Predicate pred);</cxx-signature>
<cxx-signature>template <class K, class C, class A, class Predicate>
void erase_if(multiset<K, C, A>& c, Predicate pred);</cxx-signature>
<cxx-signature>template <class K, class T, class H, class P, class A, class Predicate>
void erase_if(unordered_map<K, T, H, P, A>& c, Predicate pred);</cxx-signature>
<cxx-signature>template <class K, class T, class H, class P, class A, class Predicate>
void erase_if(unordered_multimap<K, T, H, P, A>& c, Predicate pred);</cxx-signature>
<cxx-signature>template <class K, class H, class P, class A, class Predicate>
void erase_if(unordered_set<K, H, P, A>& c, Predicate pred);</cxx-signature>
<cxx-signature>template <class K, class H, class P, class A, class Predicate>
void erase_if(unordered_multiset<K, H, P, A>& c, Predicate pred);</cxx-signature>
<cxx-effects>Equivalent to:
<pre><code>for (auto i = c.begin(), last = c.end(); i != last; ) {
if (pred(*i)) {
i = c.erase(i);
} else {
++i;
}
}</code></pre></cxx-effects>
</cxx-function>
</cxx-section>
<cxx-section id="container.erasure.erase">
<h1>Function template erase</h1>
<cxx-function>
<cxx-signature>template <class charT, class traits, class A, class U>
void erase(basic_string<charT, traits, A>& c, const U& value);</cxx-signature>
<cxx-signature>template <class T, class A, class U>
void erase(deque<T, A>& c, const U& value);</cxx-signature>
<cxx-signature>template <class T, class A, class U>
void erase(vector<T, A>& c, const U& value);</cxx-signature>
<cxx-effects>Equivalent to: <code>c.erase(remove(c.begin(), c.end(), value), c.end());</code></cxx-effects>
</cxx-function>
<cxx-function>
<cxx-signature>template <class T, class A, class U>
void erase(forward_list<T, A>& c, const U& value);</cxx-signature>
<cxx-signature>template <class T, class A, class U>
void erase(list<T, A>& c, const U& value);</cxx-signature>
<cxx-effects>Equivalent to: <code>erase_if(c, [&](auto& elem) { return elem == value; });</code></cxx-effects>
</cxx-function>
<cxx-note>
Overloads of <code>erase()</code> for associative containers and unordered associative containers are intentionally not provided.
</cxx-note>
</cxx-section>
</cxx-section>
<cxx-section id="container.array">
<h1>Class template <code>array</code></h1>
<cxx-section id="header.array.synop">
<h1>Header <experimental/array> synopsis</h1>
<pre><code>#include <array>
namespace std {
namespace experimental {
inline namespace fundamentals_v2 {
<cxx-ref insynopsis to="container.array.creation"></cxx-ref>
template <class D = void, class... Types>
constexpr array<<i>VT</i>, sizeof...(Types)> make_array(Types&&... t);
template <class T, size_t N>
constexpr array<remove_cv_t<T>, N> to_array(T (&a)[N]);
} // inline namespace fundamentals_v2
} // namespace experimental
} // namespace std</code></pre>
</cxx-section>
<cxx-section id="container.array.creation">
<h1>Array creation functions</h1>
<cxx-function>
<cxx-signature>template <class D = void, class... Types>
constexpr array<<i>VT</i>, sizeof...(Types)> make_array(Types&&... t);</cxx-signature>
<p>
Let <em>Ui</em> be <code>decay_t<</code><em>Ti</em><code>></code> for each <em>Ti</em> in <code>Types</code>.
</p>
<cxx-remarks>
The program is ill-formed if <code>D</code> is <code>void</code> and at least one <em>Ui</em> is a specialization of <code>reference_wrapper</code>.
</cxx-remarks>
<cxx-returns>
<code>array<<var>VT</var>, sizeof...(Types)>{ std::forward<Types>(t)... }</code>, where <code><var>VT</var></code> is <code>common_type_t<Types...></code> if <code>D</code> is <code>void</code>, otherwise <code><var>VT</var></code> is <code>D</code>.
</cxx-returns>
<cxx-example>
<pre><code>int i = 1; int& ri = i;
auto a1 = make_array(i, ri); // a1<i> is of type </i>array<int, 2>
auto a2 = make_array(i, ri, 42L); // a2<i> is of type </i>array<long, 3>
auto a3 = make_array<long>(i, ri); // a3<i> is of type </i>array<long, 2>
auto a4 = make_array<long>(); // a4<i> is of type </i>array<long, 0>
auto a5 = make_array(); // <i>ill-formed</i></code></pre>
</cxx-example>
</cxx-function>
<cxx-function>
<cxx-signature>template <class T, size_t N>
constexpr array<remove_cv_t<T>, N> to_array(T (&a)[N]);</cxx-signature>
<cxx-returns>
An <code>array<remove_cv_t<T>, N></code> such that each element is copy-initialized with the corresponding element of <code>a</code>.
</cxx-returns>
</cxx-function>
</cxx-section>
</cxx-section>
</cxx-clause>