@@ -70,14 +70,14 @@ struct SequenceContainerChecks : BasicContainerChecks<Container, CT> {
70
70
71
71
private:
72
72
static void SanityTest () {
73
- CHECKPOINT ( " sanity test" );
73
+ // sanity test
74
74
Container C = {1 , 1 , 1 , 1 };
75
75
::DoNotOptimize (&C);
76
76
}
77
77
78
78
static void RemoveFirstElem () {
79
79
// See llvm.org/PR35564
80
- CHECKPOINT ( " remove(<first-elem>)" );
80
+ // remove(<first-elem>)
81
81
{
82
82
Container C = makeContainer (1 );
83
83
auto FirstVal = *(C.begin ());
@@ -94,7 +94,7 @@ struct SequenceContainerChecks : BasicContainerChecks<Container, CT> {
94
94
95
95
static void SpliceFirstElem () {
96
96
// See llvm.org/PR35564
97
- CHECKPOINT ( " splice(<first-elem>)" );
97
+ // splice(<first-elem>)
98
98
{
99
99
Container C = makeContainer (1 );
100
100
Container C2;
@@ -108,14 +108,14 @@ struct SequenceContainerChecks : BasicContainerChecks<Container, CT> {
108
108
}
109
109
110
110
static void SpliceSameContainer () {
111
- CHECKPOINT ( " splice(<same-container>)" );
111
+ // splice(<same-container>)
112
112
Container C = {1 , 1 };
113
113
C.splice (C.end (), C, C.begin ());
114
114
}
115
115
116
116
static void SpliceFirstElemAfter () {
117
117
// See llvm.org/PR35564
118
- CHECKPOINT ( " splice(<first-elem>)" );
118
+ // splice(<first-elem>)
119
119
{
120
120
Container C = makeContainer (1 );
121
121
Container C2;
@@ -129,7 +129,7 @@ struct SequenceContainerChecks : BasicContainerChecks<Container, CT> {
129
129
}
130
130
131
131
static void AssignInvalidates () {
132
- CHECKPOINT ( " assign(Size, Value)" );
132
+ // assign(Size, Value)
133
133
Container C (allocator_type{});
134
134
iterator it1, it2, it3;
135
135
auto reset = [&]() {
@@ -147,7 +147,7 @@ struct SequenceContainerChecks : BasicContainerChecks<Container, CT> {
147
147
C.assign (2 , makeValueType (4 ));
148
148
check ();
149
149
reset ();
150
- CHECKPOINT ( " assign(Iter, Iter)" );
150
+ // assign(Iter, Iter)
151
151
std::vector<value_type> V = {
152
152
makeValueType (1 ),
153
153
makeValueType (2 ),
@@ -156,13 +156,13 @@ struct SequenceContainerChecks : BasicContainerChecks<Container, CT> {
156
156
C.assign (V.begin (), V.end ());
157
157
check ();
158
158
reset ();
159
- CHECKPOINT ( " assign(initializer_list)" );
159
+ // assign(initializer_list)
160
160
C.assign ({makeValueType (1 ), makeValueType (2 ), makeValueType (3 )});
161
161
check ();
162
162
}
163
163
164
164
static void BackOnEmptyContainer () {
165
- CHECKPOINT ( " testing back on empty" );
165
+ // testing back on empty
166
166
Container C = makeContainer (1 );
167
167
Container const & CC = C;
168
168
(void )C.back ();
@@ -173,7 +173,7 @@ struct SequenceContainerChecks : BasicContainerChecks<Container, CT> {
173
173
}
174
174
175
175
static void FrontOnEmptyContainer () {
176
- CHECKPOINT ( " testing front on empty" );
176
+ // testing front on empty
177
177
Container C = makeContainer (1 );
178
178
Container const & CC = C;
179
179
(void )C.front ();
@@ -184,7 +184,7 @@ struct SequenceContainerChecks : BasicContainerChecks<Container, CT> {
184
184
}
185
185
186
186
static void EraseIterIter () {
187
- CHECKPOINT ( " testing erase iter iter invalidation" );
187
+ // testing erase iter iter invalidation
188
188
Container C1 = makeContainer (3 );
189
189
iterator it1 = C1.begin ();
190
190
iterator it1_next = ++C1.begin ();
@@ -206,7 +206,7 @@ struct SequenceContainerChecks : BasicContainerChecks<Container, CT> {
206
206
}
207
207
208
208
static void PopBack () {
209
- CHECKPOINT ( " testing pop_back() invalidation" );
209
+ // testing pop_back() invalidation
210
210
Container C1 = makeContainer (2 );
211
211
iterator it1 = C1.end ();
212
212
--it1;
@@ -218,7 +218,7 @@ struct SequenceContainerChecks : BasicContainerChecks<Container, CT> {
218
218
}
219
219
220
220
static void PopFront () {
221
- CHECKPOINT ( " testing pop_front() invalidation" );
221
+ // testing pop_front() invalidation
222
222
Container C1 = makeContainer (2 );
223
223
iterator it1 = C1.begin ();
224
224
C1.pop_front ();
@@ -229,7 +229,7 @@ struct SequenceContainerChecks : BasicContainerChecks<Container, CT> {
229
229
}
230
230
231
231
static void InsertIterValue () {
232
- CHECKPOINT ( " testing insert(iter, value)" );
232
+ // testing insert(iter, value)
233
233
Container C1 = makeContainer (2 );
234
234
iterator it1 = C1.begin ();
235
235
iterator it1_next = it1;
@@ -254,7 +254,7 @@ struct SequenceContainerChecks : BasicContainerChecks<Container, CT> {
254
254
}
255
255
256
256
static void EmplaceIterValue () {
257
- CHECKPOINT ( " testing emplace(iter, value)" );
257
+ // testing emplace(iter, value)
258
258
Container C1 = makeContainer (2 );
259
259
iterator it1 = C1.begin ();
260
260
iterator it1_next = it1;
@@ -274,7 +274,7 @@ struct SequenceContainerChecks : BasicContainerChecks<Container, CT> {
274
274
}
275
275
276
276
static void InsertIterSizeValue () {
277
- CHECKPOINT ( " testing insert(iter, size, value)" );
277
+ // testing insert(iter, size, value)
278
278
Container C1 = makeContainer (2 );
279
279
iterator it1 = C1.begin ();
280
280
iterator it1_next = it1;
@@ -293,7 +293,7 @@ struct SequenceContainerChecks : BasicContainerChecks<Container, CT> {
293
293
}
294
294
295
295
static void InsertIterIterIter () {
296
- CHECKPOINT ( " testing insert(iter, iter, iter)" );
296
+ // testing insert(iter, iter, iter)
297
297
Container C1 = makeContainer (2 );
298
298
iterator it1 = C1.begin ();
299
299
iterator it1_next = it1;
0 commit comments