@@ -169,11 +169,11 @@ TEST(ProtocolBufferWithRequiredFields, OptionalFieldIsEventuallySet) {
169
169
absl::BitGen bitgen;
170
170
Value val (domain, bitgen);
171
171
172
- ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value . DebugString () ;
172
+ ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value ;
173
173
174
174
for (int i = 0 ; i < 1000 ; ++i) {
175
175
val.Mutate (domain, bitgen, false );
176
- ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value . DebugString () ;
176
+ ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value ;
177
177
if (val.user_value .has_i32 ()) break ;
178
178
}
179
179
@@ -187,14 +187,14 @@ TEST(ProtocolBufferWithRequiredFields, OptionalFieldIsEventuallyUnset) {
187
187
absl::BitGen bitgen;
188
188
Value val (domain, bitgen);
189
189
190
- ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value . DebugString () ;
190
+ ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value ;
191
191
192
192
// With the restricted domain, the probability of unsetting the field i32 is
193
193
// at least 1/800. Hence, within 11000 iterations we'll fail to observe this
194
194
// event with probability at most 10^(-6).
195
195
for (int i = 0 ; i < 11000 ; ++i) {
196
196
val.Mutate (domain, bitgen, false );
197
- ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value . DebugString () ;
197
+ ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value ;
198
198
if (!val.user_value .has_i32 ()) break ;
199
199
}
200
200
@@ -208,11 +208,11 @@ TEST(ProtocolBufferWithRequiredFields, OptionalFieldInSubprotoIsEventuallySet) {
208
208
absl::BitGen bitgen;
209
209
Value val (domain, bitgen);
210
210
211
- ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value . DebugString () ;
211
+ ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value ;
212
212
213
213
for (int i = 0 ; i < 1000 ; ++i) {
214
214
val.Mutate (domain, bitgen, false );
215
- ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value . DebugString () ;
215
+ ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value ;
216
216
if (val.user_value .has_req_sub () &&
217
217
val.user_value .req_sub ().has_subproto_i32 ())
218
218
break ;
@@ -230,14 +230,14 @@ TEST(ProtocolBufferWithRequiredFields,
230
230
absl::BitGen bitgen;
231
231
Value val (domain, bitgen);
232
232
233
- ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value . DebugString () ;
233
+ ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value ;
234
234
235
235
// With the restricted domain, the probability of unsetting the field
236
236
// req_sub.subproto_i32 is at least 1/800. Hence, within 11000 iterations
237
237
// we'll fail to observe this event with probability at most 10^(-6).
238
238
for (int i = 0 ; i < 11000 ; ++i) {
239
239
val.Mutate (domain, bitgen, false );
240
- ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value . DebugString () ;
240
+ ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value ;
241
241
if (val.user_value .has_req_sub () &&
242
242
!val.user_value .req_sub ().has_subproto_i32 ())
243
243
break ;
@@ -265,14 +265,13 @@ TEST(ProtocolBufferWithRequiredFields,
265
265
absl::BitGen bitgen;
266
266
Value val (domain, bitgen);
267
267
268
- ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value . DebugString () ;
268
+ ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value ;
269
269
270
270
for (int i = 0 ; i < 1000 ; ++i) {
271
271
val.Mutate (domain, bitgen, false );
272
- ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value . DebugString () ;
272
+ ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value ;
273
273
if (val.user_value .has_sub_req ()) {
274
- ASSERT_TRUE (val.user_value .sub_req ().IsInitialized ())
275
- << val.user_value .DebugString ();
274
+ ASSERT_TRUE (val.user_value .sub_req ().IsInitialized ()) << val.user_value ;
276
275
break ;
277
276
}
278
277
}
@@ -292,15 +291,15 @@ TEST(ProtocolBufferWithRequiredFields, MapFieldIsEventuallyPopulated) {
292
291
absl::BitGen bitgen;
293
292
Value val (domain, bitgen);
294
293
295
- ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value . DebugString () ;
294
+ ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value ;
296
295
297
296
bool found = false ;
298
297
for (int i = 0 ; i < 1000 && !found; ++i) {
299
298
val.Mutate (domain, bitgen, false );
300
- ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value . DebugString () ;
299
+ ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value ;
301
300
for (const auto & pair : val.user_value .map_sub_req ()) {
302
301
found = true ;
303
- ASSERT_TRUE (pair.second .IsInitialized ()) << pair.second . DebugString () ;
302
+ ASSERT_TRUE (pair.second .IsInitialized ()) << pair.second ;
304
303
}
305
304
}
306
305
@@ -319,11 +318,11 @@ TEST(ProtocolBufferWithRequiredFields, ShrinkingNeverRemovesRequiredFields) {
319
318
absl::BitGen bitgen;
320
319
Value val (domain, bitgen);
321
320
322
- ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value . DebugString () ;
321
+ ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value ;
323
322
324
323
for (int i = 0 ; i < 1000 ; ++i) {
325
324
val.Mutate (domain, bitgen, /* only_shrink=*/ false );
326
- ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value . DebugString () ;
325
+ ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value ;
327
326
}
328
327
329
328
const auto is_minimal = [](const auto & v) {
@@ -334,7 +333,7 @@ TEST(ProtocolBufferWithRequiredFields, ShrinkingNeverRemovesRequiredFields) {
334
333
335
334
while (!is_minimal (val.user_value )) {
336
335
val.Mutate (domain, bitgen, /* only_shrink=*/ true );
337
- ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value . DebugString () ;
336
+ ASSERT_TRUE (val.user_value .IsInitialized ()) << val.user_value ;
338
337
}
339
338
}
340
339
0 commit comments