@@ -141,7 +141,7 @@ impl IntoIterator for ConfPath {
141
141
142
142
while !pos. is_root ( ) {
143
143
path. push ( pos. clone ( ) ) ;
144
- pos = pos. pop ( ) . unwrap ( ) . 1 ; // We already checked that this is not the root node. So unwraping pop() is ok here.
144
+ pos = pos. pop ( ) . unwrap ( ) . 1 ; // We already checked that this is not the root node. So unwrapping pop() is ok here.
145
145
}
146
146
147
147
path. into_iter ( ) . rev ( )
@@ -159,7 +159,7 @@ impl Display for ConfPath {
159
159
write ! ( f, "." ) ?;
160
160
}
161
161
162
- // We already checked that this is not the root node. So unwraping pop() and tail_component_name() is ok here.
162
+ // We already checked that this is not the root node. So unwrapping pop() and tail_component_name() is ok here.
163
163
write ! ( f, "{}" , pos. tail_component_name( ) . unwrap( ) ) ?;
164
164
pos = pos. pop ( ) . unwrap ( ) . 1 ;
165
165
@@ -415,7 +415,7 @@ mod tests {
415
415
assert_eq ! ( root1. push( "a" ) , root1. push( "a" ) ) ;
416
416
assert_eq ! ( root1. push_all( [ "a" , "b" ] ) , root1. clone( ) + "a" + "b" ) ;
417
417
418
- // Make sure different paths do not compare qeual
418
+ // Make sure different paths do not compare equal
419
419
assert_ne ! ( root1. push_all( [ "a" , "b" ] ) , root1. push( "a" ) ) ;
420
420
assert_ne ! ( root1. push_all( [ "a" , "b" ] ) , root1. push( "b" ) ) ;
421
421
@@ -502,13 +502,13 @@ mod tests {
502
502
// The order of the returned elements is not guaranteed. Therefore we've
503
503
// to remove the returned elements form the reference_set and later
504
504
// check if the set is empty.
505
- #[ allow( clippy:: mutable_key_type) ] // This is one of the false positives mentioned in the docoumentation .
505
+ #[ allow( clippy:: mutable_key_type) ] // This is one of the false positives mentioned in the documentation .
506
506
let mut reference_set: HashSet < ConfPath > = HashSet :: from_iter ( [ ConfPath :: from ( & [ "a" ] ) , ConfPath :: from ( & [ "b" ] ) ] . iter ( ) . cloned ( ) ) ;
507
507
cp. children ( ) . for_each ( |c| assert ! ( reference_set. remove( & c) , "Iterator returned too many elements." ) ) ;
508
508
assert_eq ! ( reference_set. len( ) , 0 , "Iterator returned not enough elements." ) ;
509
509
510
510
// Verify again with an intermediate node
511
- #[ allow( clippy:: mutable_key_type) ] // This is one of the false positives mentioned in the docoumentation .
511
+ #[ allow( clippy:: mutable_key_type) ] // This is one of the false positives mentioned in the documentation .
512
512
let mut reference_set: HashSet < ConfPath > = HashSet :: from_iter ( [ ConfPath :: from ( & [ "a" , "a1" ] ) ] . iter ( ) . cloned ( ) ) ;
513
513
cp. push ( "a" ) . children ( ) . for_each ( |c| assert ! ( reference_set. remove( & c) , "Iterator returned too many elements." ) ) ;
514
514
assert_eq ! ( reference_set. len( ) , 0 , "Iterator returned not enough elements." ) ;
@@ -528,7 +528,7 @@ mod tests {
528
528
// The order of the returned elements is not guaranteed. Therefore we've
529
529
// to remove the returned elements form the reference_set and later
530
530
// check if the set is empty.
531
- #[ allow( clippy:: mutable_key_type) ] // This is one of the false positives mentioned in the docoumentation .
531
+ #[ allow( clippy:: mutable_key_type) ] // This is one of the false positives mentioned in the documentation .
532
532
let mut reference_set: HashSet < ConfPath > = HashSet :: from_iter ( [ ConfPath :: from ( & [ "a" ] ) , ConfPath :: from ( & [ "b" ] ) ] . iter ( ) . cloned ( ) ) ;
533
533
root_child_iter. for_each ( |c| assert ! ( reference_set. remove( & c) , "Iterator returned to many elements." ) ) ;
534
534
assert_eq ! ( reference_set. len( ) , 0 , "Iterator returned not enough elements." ) ;
0 commit comments