@@ -143,7 +143,7 @@ pub fn main() {
143143 v[ 0 ] . descend_into_self ( & mut c) ;
144144 assert ! ( !c. saw_prev_marked) ; // <-- different from below, b/c acyclic above
145145
146- if PRINT { println ! ( "" ) ; }
146+ if PRINT { println ! ( ) ; }
147147
148148 // Cycle 1: { v[0] -> v[1], v[1] -> v[0] };
149149 // does not exercise `v` itself
@@ -158,7 +158,7 @@ pub fn main() {
158158 v[ 0 ] . descend_into_self ( & mut c) ;
159159 assert ! ( c. saw_prev_marked) ;
160160
161- if PRINT { println ! ( "" ) ; }
161+ if PRINT { println ! ( ) ; }
162162
163163 // Cycle 2: { v[0] -> v, v[1] -> v }
164164 let v: V = Named :: new ( "v" ) ;
@@ -171,7 +171,7 @@ pub fn main() {
171171 v. descend_into_self ( & mut c) ;
172172 assert ! ( c. saw_prev_marked) ;
173173
174- if PRINT { println ! ( "" ) ; }
174+ if PRINT { println ! ( ) ; }
175175
176176 // Cycle 3: { hk0 -> hv0, hv0 -> hk0, hk1 -> hv1, hv1 -> hk1 };
177177 // does not exercise `h` itself
@@ -193,7 +193,7 @@ pub fn main() {
193193 assert ! ( c. saw_prev_marked) ;
194194 }
195195
196- if PRINT { println ! ( "" ) ; }
196+ if PRINT { println ! ( ) ; }
197197
198198 // Cycle 4: { h -> (hmk0,hmv0,hmk1,hmv1), {hmk0,hmv0,hmk1,hmv1} -> h }
199199
@@ -216,7 +216,7 @@ pub fn main() {
216216 // break;
217217 }
218218
219- if PRINT { println ! ( "" ) ; }
219+ if PRINT { println ! ( ) ; }
220220
221221 // Cycle 5: { vd[0] -> vd[1], vd[1] -> vd[0] };
222222 // does not exercise vd itself
@@ -232,7 +232,7 @@ pub fn main() {
232232 vd[ 0 ] . descend_into_self ( & mut c) ;
233233 assert ! ( c. saw_prev_marked) ;
234234
235- if PRINT { println ! ( "" ) ; }
235+ if PRINT { println ! ( ) ; }
236236
237237 // Cycle 6: { vd -> (vd0, vd1), {vd0, vd1} -> vd }
238238 let mut vd: VecDeque < VD > = VecDeque :: new ( ) ;
@@ -247,7 +247,7 @@ pub fn main() {
247247 vd[ 0 ] . descend_into_self ( & mut c) ;
248248 assert ! ( c. saw_prev_marked) ;
249249
250- if PRINT { println ! ( "" ) ; }
250+ if PRINT { println ! ( ) ; }
251251
252252 // Cycle 7: { vm -> (vm0, vm1), {vm0, vm1} -> vm }
253253 let mut vm: HashMap < usize , VM > = HashMap :: new ( ) ;
@@ -262,7 +262,7 @@ pub fn main() {
262262 vm[ & 0 ] . descend_into_self ( & mut c) ;
263263 assert ! ( c. saw_prev_marked) ;
264264
265- if PRINT { println ! ( "" ) ; }
265+ if PRINT { println ! ( ) ; }
266266
267267 // Cycle 8: { ll -> (ll0, ll1), {ll0, ll1} -> ll }
268268 let mut ll: LinkedList < LL > = LinkedList :: new ( ) ;
@@ -282,7 +282,7 @@ pub fn main() {
282282 // break;
283283 }
284284
285- if PRINT { println ! ( "" ) ; }
285+ if PRINT { println ! ( ) ; }
286286
287287 // Cycle 9: { bh -> (bh0, bh1), {bh0, bh1} -> bh }
288288 let mut bh: BinaryHeap < BH > = BinaryHeap :: new ( ) ;
@@ -302,7 +302,7 @@ pub fn main() {
302302 // break;
303303 }
304304
305- if PRINT { println ! ( "" ) ; }
305+ if PRINT { println ! ( ) ; }
306306
307307 // Cycle 10: { btm -> (btk0, btv1), {bt0, bt1} -> btm }
308308 let mut btm: BTreeMap < BTM , BTM > = BTreeMap :: new ( ) ;
@@ -323,7 +323,7 @@ pub fn main() {
323323 // break;
324324 }
325325
326- if PRINT { println ! ( "" ) ; }
326+ if PRINT { println ! ( ) ; }
327327
328328 // Cycle 10: { bts -> (bts0, bts1), {bts0, bts1} -> btm }
329329 let mut bts: BTreeSet < BTS > = BTreeSet :: new ( ) ;
@@ -343,7 +343,7 @@ pub fn main() {
343343 // break;
344344 }
345345
346- if PRINT { println ! ( "" ) ; }
346+ if PRINT { println ! ( ) ; }
347347
348348 // Cycle 11: { rc0 -> (rc1, rc2), rc1 -> (), rc2 -> rc0 }
349349 let ( rc0, rc1, rc2) : ( RCRC , RCRC , RCRC ) ;
@@ -361,7 +361,7 @@ pub fn main() {
361361 rc0. descend_into_self ( & mut c) ;
362362 assert ! ( c. saw_prev_marked) ;
363363
364- if PRINT { println ! ( "" ) ; }
364+ if PRINT { println ! ( ) ; }
365365
366366 // We want to take the previous Rc case and generalize it to Arc.
367367 //
@@ -395,7 +395,7 @@ pub fn main() {
395395 arc0. descend_into_self ( & mut c) ;
396396 assert ! ( c. saw_prev_marked) ;
397397
398- if PRINT { println ! ( "" ) ; }
398+ if PRINT { println ! ( ) ; }
399399
400400 // Cycle 13: { arc0 -> (arc1, arc2), arc1 -> (), arc2 -> arc0 }, rwlocks
401401 let ( arc0, arc1, arc2) : ( ARCRW , ARCRW , ARCRW ) ;
@@ -413,7 +413,7 @@ pub fn main() {
413413 arc0. descend_into_self ( & mut c) ;
414414 assert ! ( c. saw_prev_marked) ;
415415
416- if PRINT { println ! ( "" ) ; }
416+ if PRINT { println ! ( ) ; }
417417
418418 // Cycle 14: { arc0 -> (arc1, arc2), arc1 -> (), arc2 -> arc0 }, mutexs
419419 let ( arc0, arc1, arc2) : ( ARCM , ARCM , ARCM ) ;
0 commit comments