rustfmt the recent change

src/uu/factor/src/factor.rs

@@ -125,7 +125,7 @@ fn _factor<A: Arithmetic + miller_rabin::Basis>(num: u64, f: Factors) -> Factors
     let n = A::new(num);
     let divisor = match miller_rabin::test::<A>(n) {
         Prime => {
-            #[cfg(feature="coz")]
+            #[cfg(feature = "coz")]
             coz::progress!("factor found");
             let mut r = f;
             r.push(num);
@@ -141,7 +141,7 @@ fn _factor<A: Arithmetic + miller_rabin::Basis>(num: u64, f: Factors) -> Factors
 }
 
 pub fn factor(mut n: u64) -> Factors {
-    #[cfg(feature="coz")]
+    #[cfg(feature = "coz")]
     coz::begin!("factorization");
     let mut factors = Factors::one();
 
@@ -156,7 +156,7 @@ pub fn factor(mut n: u64) -> Factors {
     }
 
     if n == 1 {
-        #[cfg(feature="coz")]
+        #[cfg(feature = "coz")]
         coz::end!("factorization");
         return factors;
     }
@@ -169,7 +169,7 @@ pub fn factor(mut n: u64) -> Factors {
         _factor::<Montgomery<u64>>(n, factors)
     };
 
-    #[cfg(feature="coz")]
+    #[cfg(feature = "coz")]
     coz::end!("factorization");
 
     return r;

src/uu/factor/src/table.rs

@@ -33,7 +33,7 @@ pub(crate) fn factor(mut num: u64, mut factors: Factors) -> (Factors, u64) {
             if x <= ceil {
                 num = x;
                 k += 1;
-                #[cfg(feature="coz")]
+                #[cfg(feature = "coz")]
                 coz::progress!("factor found");
             } else {
                 if k > 0 {

tests/by-util/test_sort.rs

@@ -16,15 +16,15 @@ fn test_helper(file_name: &str, args: &str) {
 }
 
 // FYI, the initialization size of our Line struct is 96 bytes.
-//  
-// At very small buffer sizes, with that overhead we are certainly going 
-// to overrun our buffer way, way, way too quickly because of these excess 
+//
+// At very small buffer sizes, with that overhead we are certainly going
+// to overrun our buffer way, way, way too quickly because of these excess
 // bytes for the struct.
 //
 // For instance, seq 0..20000 > ...text = 108894 bytes
 // But overhead is 1920000 + 108894 = 2028894 bytes
 //
-// Or kjvbible-random.txt = 4332506 bytes, but minimum size of its 
+// Or kjvbible-random.txt = 4332506 bytes, but minimum size of its
 // 99817 lines in memory * 96 bytes = 9582432 bytes
 //
 // Here, we test 108894 bytes with a 50K buffer
@@ -59,7 +59,7 @@ fn test_human_numeric_whitespace() {
     test_helper("human-numeric-whitespace", "-h");
 }
 
-// This tests where serde often fails when reading back JSON 
+// This tests where serde often fails when reading back JSON
 // if it finds a null value
 #[test]
 fn test_extsort_as64_bailout() {

tests/by-util/test_truncate.rs

@@ -224,8 +224,14 @@ fn test_size_and_reference() {
     let mut file1 = at.make_file(TFILE1);
     let mut file2 = at.make_file(TFILE2);
     file1.write_all(b"1234567890").unwrap();
-    ucmd.args(&["--reference", TFILE1, "--size", "+5", TFILE2]).succeeds();
+    ucmd.args(&["--reference", TFILE1, "--size", "+5", TFILE2])
+        .succeeds();
     file2.seek(SeekFrom::End(0)).unwrap();
     let actual = file2.seek(SeekFrom::Current(0)).unwrap();
-    assert!(expected == actual, "expected '{}' got '{}'", expected, actual);
+    assert!(
+        expected == actual,
+        "expected '{}' got '{}'",
+        expected,
+        actual
+    );
 }