ruffly-all 0.1.1

Generating a migration path to ruff from anywhere
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51

mod ruff_code;

use ruff_code::RuffCode;
use std::collections::HashSet;
use std::process::Command;
use std::str::FromStr;

fn main() {
    let output = Command::new("ruff")
        .arg("check")
        .arg("--select")
        .arg("ALL")
        .arg("--output-format")
        .arg("concise")
        .output()
        .expect("failed to execute process");
    let out = String::from_utf8_lossy(&output.stdout);

    let mut unique_groups = HashSet::new();

    for line in out.lines() {
        let maybe_code = &line
            .split_whitespace()
            .nth(1)
            .expect("line without second word encountered");
        if maybe_code
            .chars()
            .next()
            .expect("no char")
            .is_ascii_alphabetic()
            && *maybe_code != "invalid-syntax:"
            && *maybe_code != "checks"
        {
            let code = RuffCode::from_str(maybe_code).expect("could not parse");
            unique_groups.insert(code.group);
        }
    }

    let mut listed: Vec<String> = unique_groups.into_iter().collect();
    listed.sort();

    println!("[tool.ruff]");
    println!("lint.select = [ ALL ]");
    println!("lint.ignore = [");
    println!("  \"D203\",    # incompatible to D211");
    println!("  \"D212\",    # incompatible to D213");
    for group in listed {
        println!("  \"{}\",", &group);
    }
    println!("]");
}