abcop 0.16.0

Blazing-fast, opinionated ABC complexity linter for humans and LLM agents
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
52
53
54
55
56
57

//! Debug helper: pretty-print a parsed syntax tree.

use std::fs;

use crate::paths::lang_for;

pub fn dump_tree(path: &str) -> Result<(), Box<dyn std::error::Error>> {
    let src = fs::read(path)?;
    let lang = lang_for(std::path::Path::new(path));
    let tree = crate::paths::parse_file_lang(&src, lang).ok_or("parse failed")?;
    let mut cursor = tree.walk();
    rec(&mut cursor, 0, &src);
    Ok(())
}

fn indent(depth: usize) -> String {
    "  ".repeat(depth)
}

fn shorten(text: &str) -> String {
    if text.len() <= 60 {
        text.replace('\n', "\\n")
    } else {
        format!("{}…", text[..60].replace('\n', "\\n"))
    }
}

fn rec(cursor: &mut tree_sitter::TreeCursor, depth: usize, src: &[u8]) {
    loop {
        emit(cursor, src, depth);
        if cursor.goto_first_child() {
            rec(cursor, depth + 1, src);
            cursor.goto_parent();
        }
        if !cursor.goto_next_sibling() {
            break;
        }
    }
}

fn emit(cursor: &mut tree_sitter::TreeCursor, src: &[u8], depth: usize) {
    let n = cursor.node();
    let field = cursor.field_name().unwrap_or("");
    let prefix = if field.is_empty() {
        String::new()
    } else {
        format!("@{field}: ")
    };
    println!(
        "{ind}{prefix}{kind} [{row}:{col}] {text}",
        ind = indent(depth),
        kind = n.kind(),
        row = n.start_position().row + 1,
        col = n.start_position().column,
        text = shorten(n.utf8_text(src).unwrap_or(""))
    );
}