chore: add rust formatter (doocs#1946)

close doocs#1853

Author: yanglbme

.github/workflows/pr-checker.yml

@@ -19,7 +19,7 @@ jobs:
 
             我们项目中各种编程语言代码（包括文档）所采用的格式化工具不同，提交 pr 之前必须确保代码、文档正确格式化。
 
-            -   .{md,js,ts,php,sql} 采用 prettier
+            -   .{md,js,ts,php,sql,rs} 采用 prettier
             -   .{c,cpp,java} 采用 clang-format
             -   .{py} 采用 black
             -   .{go} 采用 gofmt
@@ -47,7 +47,7 @@ jobs:
 
             We use different formatting tools for various programming languages (including documentation) in our project. You must ensure that the code and documentation are correctly formatted before submitting a pr.
 
-            -   .{md,js,ts,php,sql} use prettier
+            -   .{md,js,ts,php,sql,rs} use prettier
             -   .{c,cpp,java} use clang-format
             -   .{py} use black
             -   .{go} use gofmt

.github/workflows/prettier.yml

@@ -25,7 +25,7 @@ jobs:
       - name: Run prettier
         run: |
           git config --global core.quotepath off
-          changed_files=$(git diff --name-only "${{ github.event.pull_request.base.sha }}" | grep -E '\.md$|\.js$|\.ts$|\.php|\.sql$' || true)
+          changed_files=$(git diff --name-only "${{ github.event.pull_request.base.sha }}" | grep -E '\.js$|\.ts$|\.php$|\.sql$|\.rs$|\.md$' || true)
           if [ -n "$changed_files" ]; then
             echo "Running prettier on the changed files"
             echo "$changed_files" | xargs -d '\n' npx prettier --write

basic/sorting/HeapSort/README.md

@@ -207,13 +207,19 @@ fn sink(nums: &mut Vec<i32>, mut i: usize, n: usize) {
 fn main() -> io::Result<()> {
     let mut s = String::new();
     io::stdin().read_line(&mut s)?;
-    let s: Vec<usize> = s.split(' ').map(|s| s.trim().parse().unwrap()).collect();
+    let s: Vec<usize> = s
+        .split(' ')
+        .map(|s| s.trim().parse().unwrap())
+        .collect();
     // let n = s[0];
     let m = s[1];
 
     let mut nums = String::new();
     io::stdin().read_line(&mut nums)?;
-    let mut nums: Vec<i32> = nums.split(' ').map(|s| s.trim().parse().unwrap()).collect();
+    let mut nums: Vec<i32> = nums
+        .split(' ')
+        .map(|s| s.trim().parse().unwrap())
+        .collect();
 
     heap_sort(&mut nums);
     for num in nums.iter().take(m) {

basic/sorting/InsertionSort/InsertionSort.rs

@@ -3,7 +3,7 @@ fn insertion_sort(nums: &mut Vec<i32>) {
     for i in 1..n {
         let mut j = i - 1;
         let temp = nums[i];
-        while j >= 0 as usize && nums[j] > temp {
+        while j >= (0 as usize) && nums[j] > temp {
             nums[j + 1] = nums[j];
             j -= 1;
         }

basic/sorting/InsertionSort/README.md

@@ -136,7 +136,7 @@ fn insertion_sort(nums: &mut Vec<i32>) {
     for i in 1..n {
         let mut j = i - 1;
         let temp = nums[i];
-        while j >= 0 as usize && nums[j] > temp {
+        while j >= (0 as usize) && nums[j] > temp {
             nums[j + 1] = nums[j];
             j -= 1;
         }

basic/sorting/MergeSort/Main.rs

@@ -43,7 +43,10 @@ fn main() -> io::Result<()> {
 
     let mut nums = String::new();
     io::stdin().read_line(&mut nums)?;
-    let mut nums: Vec<i32> = nums.split(' ').map(|s| s.trim().parse().unwrap()).collect();
+    let mut nums: Vec<i32> = nums
+        .split(' ')
+        .map(|s| s.trim().parse().unwrap())
+        .collect();
 
     merge_sort(&mut nums, 0, n - 1);
     for num in nums.iter() {

basic/sorting/MergeSort/README.md

@@ -359,7 +359,10 @@ fn main() -> io::Result<()> {
 
     let mut nums = String::new();
     io::stdin().read_line(&mut nums)?;
-    let mut nums: Vec<i32> = nums.split(' ').map(|s| s.trim().parse().unwrap()).collect();
+    let mut nums: Vec<i32> = nums
+        .split(' ')
+        .map(|s| s.trim().parse().unwrap())
+        .collect();
 
     merge_sort(&mut nums, 0, n - 1);
     for num in nums.iter() {

basic/sorting/QuickSort/Main.rs

@@ -37,7 +37,10 @@ fn main() -> io::Result<()> {
 
     let mut nums = String::new();
     io::stdin().read_line(&mut nums)?;
-    let mut nums: Vec<i32> = nums.split(' ').map(|s| s.trim().parse().unwrap()).collect();
+    let mut nums: Vec<i32> = nums
+        .split(' ')
+        .map(|s| s.trim().parse().unwrap())
+        .collect();
 
     quick_sort(&mut nums, 0, n - 1);
     for num in nums.iter() {

basic/sorting/QuickSort/README.md

@@ -280,7 +280,10 @@ fn main() -> io::Result<()> {
 
     let mut nums = String::new();
     io::stdin().read_line(&mut nums)?;
-    let mut nums: Vec<i32> = nums.split(' ').map(|s| s.trim().parse().unwrap()).collect();
+    let mut nums: Vec<i32> = nums
+        .split(' ')
+        .map(|s| s.trim().parse().unwrap())
+        .collect();
 
     quick_sort(&mut nums, 0, n - 1);
     for num in nums.iter() {

basic/sorting/ShellSort/README.md

@@ -104,7 +104,7 @@ fn shell_sort(nums: &mut Vec<i32>) {
         for i in gap..n {
             let mut j = i - gap;
             let temp = nums[i];
-            while j >= 0 as usize && nums[j] > temp {
+            while j >= (0 as usize) && nums[j] > temp {
                 nums[j + gap] = nums[j];
                 j -= gap;
             }