@@ -143,7 +143,7 @@ pub fn main() {
143
143
v[ 0 ] . descend_into_self ( & mut c) ;
144
144
assert ! ( !c. saw_prev_marked) ; // <-- different from below, b/c acyclic above
145
145
146
- if PRINT { println ! ( "" ) ; }
146
+ if PRINT { println ! ( ) ; }
147
147
148
148
// Cycle 1: { v[0] -> v[1], v[1] -> v[0] };
149
149
// does not exercise `v` itself
@@ -158,7 +158,7 @@ pub fn main() {
158
158
v[ 0 ] . descend_into_self ( & mut c) ;
159
159
assert ! ( c. saw_prev_marked) ;
160
160
161
- if PRINT { println ! ( "" ) ; }
161
+ if PRINT { println ! ( ) ; }
162
162
163
163
// Cycle 2: { v[0] -> v, v[1] -> v }
164
164
let v: V = Named :: new ( "v" ) ;
@@ -171,7 +171,7 @@ pub fn main() {
171
171
v. descend_into_self ( & mut c) ;
172
172
assert ! ( c. saw_prev_marked) ;
173
173
174
- if PRINT { println ! ( "" ) ; }
174
+ if PRINT { println ! ( ) ; }
175
175
176
176
// Cycle 3: { hk0 -> hv0, hv0 -> hk0, hk1 -> hv1, hv1 -> hk1 };
177
177
// does not exercise `h` itself
@@ -193,7 +193,7 @@ pub fn main() {
193
193
assert ! ( c. saw_prev_marked) ;
194
194
}
195
195
196
- if PRINT { println ! ( "" ) ; }
196
+ if PRINT { println ! ( ) ; }
197
197
198
198
// Cycle 4: { h -> (hmk0,hmv0,hmk1,hmv1), {hmk0,hmv0,hmk1,hmv1} -> h }
199
199
@@ -216,7 +216,7 @@ pub fn main() {
216
216
// break;
217
217
}
218
218
219
- if PRINT { println ! ( "" ) ; }
219
+ if PRINT { println ! ( ) ; }
220
220
221
221
// Cycle 5: { vd[0] -> vd[1], vd[1] -> vd[0] };
222
222
// does not exercise vd itself
@@ -232,7 +232,7 @@ pub fn main() {
232
232
vd[ 0 ] . descend_into_self ( & mut c) ;
233
233
assert ! ( c. saw_prev_marked) ;
234
234
235
- if PRINT { println ! ( "" ) ; }
235
+ if PRINT { println ! ( ) ; }
236
236
237
237
// Cycle 6: { vd -> (vd0, vd1), {vd0, vd1} -> vd }
238
238
let mut vd: VecDeque < VD > = VecDeque :: new ( ) ;
@@ -247,7 +247,7 @@ pub fn main() {
247
247
vd[ 0 ] . descend_into_self ( & mut c) ;
248
248
assert ! ( c. saw_prev_marked) ;
249
249
250
- if PRINT { println ! ( "" ) ; }
250
+ if PRINT { println ! ( ) ; }
251
251
252
252
// Cycle 7: { vm -> (vm0, vm1), {vm0, vm1} -> vm }
253
253
let mut vm: HashMap < usize , VM > = HashMap :: new ( ) ;
@@ -262,7 +262,7 @@ pub fn main() {
262
262
vm[ & 0 ] . descend_into_self ( & mut c) ;
263
263
assert ! ( c. saw_prev_marked) ;
264
264
265
- if PRINT { println ! ( "" ) ; }
265
+ if PRINT { println ! ( ) ; }
266
266
267
267
// Cycle 8: { ll -> (ll0, ll1), {ll0, ll1} -> ll }
268
268
let mut ll: LinkedList < LL > = LinkedList :: new ( ) ;
@@ -282,7 +282,7 @@ pub fn main() {
282
282
// break;
283
283
}
284
284
285
- if PRINT { println ! ( "" ) ; }
285
+ if PRINT { println ! ( ) ; }
286
286
287
287
// Cycle 9: { bh -> (bh0, bh1), {bh0, bh1} -> bh }
288
288
let mut bh: BinaryHeap < BH > = BinaryHeap :: new ( ) ;
@@ -302,7 +302,7 @@ pub fn main() {
302
302
// break;
303
303
}
304
304
305
- if PRINT { println ! ( "" ) ; }
305
+ if PRINT { println ! ( ) ; }
306
306
307
307
// Cycle 10: { btm -> (btk0, btv1), {bt0, bt1} -> btm }
308
308
let mut btm: BTreeMap < BTM , BTM > = BTreeMap :: new ( ) ;
@@ -323,7 +323,7 @@ pub fn main() {
323
323
// break;
324
324
}
325
325
326
- if PRINT { println ! ( "" ) ; }
326
+ if PRINT { println ! ( ) ; }
327
327
328
328
// Cycle 10: { bts -> (bts0, bts1), {bts0, bts1} -> btm }
329
329
let mut bts: BTreeSet < BTS > = BTreeSet :: new ( ) ;
@@ -343,7 +343,7 @@ pub fn main() {
343
343
// break;
344
344
}
345
345
346
- if PRINT { println ! ( "" ) ; }
346
+ if PRINT { println ! ( ) ; }
347
347
348
348
// Cycle 11: { rc0 -> (rc1, rc2), rc1 -> (), rc2 -> rc0 }
349
349
let ( rc0, rc1, rc2) : ( RCRC , RCRC , RCRC ) ;
@@ -361,7 +361,7 @@ pub fn main() {
361
361
rc0. descend_into_self ( & mut c) ;
362
362
assert ! ( c. saw_prev_marked) ;
363
363
364
- if PRINT { println ! ( "" ) ; }
364
+ if PRINT { println ! ( ) ; }
365
365
366
366
// We want to take the previous Rc case and generalize it to Arc.
367
367
//
@@ -395,7 +395,7 @@ pub fn main() {
395
395
arc0. descend_into_self ( & mut c) ;
396
396
assert ! ( c. saw_prev_marked) ;
397
397
398
- if PRINT { println ! ( "" ) ; }
398
+ if PRINT { println ! ( ) ; }
399
399
400
400
// Cycle 13: { arc0 -> (arc1, arc2), arc1 -> (), arc2 -> arc0 }, rwlocks
401
401
let ( arc0, arc1, arc2) : ( ARCRW , ARCRW , ARCRW ) ;
@@ -413,7 +413,7 @@ pub fn main() {
413
413
arc0. descend_into_self ( & mut c) ;
414
414
assert ! ( c. saw_prev_marked) ;
415
415
416
- if PRINT { println ! ( "" ) ; }
416
+ if PRINT { println ! ( ) ; }
417
417
418
418
// Cycle 14: { arc0 -> (arc1, arc2), arc1 -> (), arc2 -> arc0 }, mutexs
419
419
let ( arc0, arc1, arc2) : ( ARCM , ARCM , ARCM ) ;
0 commit comments