File tree Expand file tree Collapse file tree 1 file changed +3
-10
lines changed Expand file tree Collapse file tree 1 file changed +3
-10
lines changed Original file line number Diff line number Diff line change @@ -334,20 +334,13 @@ mod tests {
334
334
// Yes, what follows is a **terribly** inefficient set union
335
335
// implementation. Don't copy this code outside of this test!
336
336
337
- let original_size = self
338
- . reachable
339
- . entry ( node)
340
- . or_insert_with ( HashSet :: default)
341
- . len ( ) ;
337
+ let original_size = self . reachable . entry ( node) . or_default ( ) . len ( ) ;
342
338
343
339
for sub_node in self . graph . 0 [ & node] . iter ( ) {
344
340
self . reachable . get_mut ( & node) . unwrap ( ) . insert ( * sub_node) ;
345
341
346
- let sub_reachable = self
347
- . reachable
348
- . entry ( * sub_node)
349
- . or_insert_with ( HashSet :: default)
350
- . clone ( ) ;
342
+ let sub_reachable =
343
+ self . reachable . entry ( * sub_node) . or_default ( ) . clone ( ) ;
351
344
352
345
for transitive in sub_reachable {
353
346
self . reachable . get_mut ( & node) . unwrap ( ) . insert ( transitive) ;
You can’t perform that action at this time.
0 commit comments