rrubocop 0.8.15

10x faster RuboCop drop-in. Same output format and configs, without maintaining RuboCop gems.
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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146

//! Heuristic matchers for breadth-first Style cops.
use tree_sitter::Node;
use crate::cop::CopConfig;
use crate::parse::source::SourceFile;

pub fn matches_empty_heredoc(source: &SourceFile, node: Node<'_>, _config: &CopConfig) -> bool {
    if node.kind() != "heredoc_body" { return false; }
    let mut cur = node.walk();
    node.children(&mut cur)
        .find(|ch| ch.kind() == "heredoc_content")
        .is_some_and(|c| {
        let b = &source.as_bytes()[c.start_byte()..c.end_byte()];
        b.is_empty() || b == b"\n"
    })
}

pub fn matches_hash_syntax(source: &SourceFile, node: Node<'_>, config: &CopConfig) -> bool {
    if node.kind() != "pair" {
        return false;
    }
    let style = config.get_str("EnforcedStyle", "ruby19");
    let has_rocket = has_anon_child(node, "=>");
    match style {
        // RuboCop ruby19: only rewrite when *every* key is a word symbol.
        "ruby19" | "ruby19_no_mixed_keys" => {
            has_rocket && pair_key_is_symbol(source, node) && hash_all_word_symbol_keys(source, node)
        }
        "hash_rockets" => has_anon_child(node, ":"),
        _ => false,
    }
}

fn hash_all_word_symbol_keys(source: &SourceFile, pair: Node<'_>) -> bool {
    let pairs = sibling_pairs(pair);
    !pairs.is_empty() && pairs.iter().all(|p| pair_key_is_symbol(source, *p))
}

fn sibling_pairs(pair: Node<'_>) -> Vec<Node<'_>> {
    let Some(parent) = pair.parent() else {
        return vec![pair];
    };
    if !matches!(parent.kind(), "hash" | "argument_list") {
        return vec![pair];
    }
    let mut cur = parent.walk();
    parent
        .named_children(&mut cur)
        .filter(|n| n.kind() == "pair")
        .collect()
}

fn has_anon_child(node: Node<'_>, kind: &str) -> bool {
    let mut cur = node.walk();
    node.children(&mut cur).any(|ch| !ch.is_named() && ch.kind() == kind)
}

fn pair_key_is_symbol(source: &SourceFile, node: Node<'_>) -> bool {
    let mut c3 = node.walk();
    let Some(key) = node.named_children(&mut c3).next() else {
        return false;
    };
    if !matches!(key.kind(), "simple_symbol" | "hash_key_symbol") {
        return false;
    }
    let bytes = &source.as_bytes()[key.start_byte()..key.end_byte()];
    // RuboCop `acceptable_19_syntax_symbol?`: word symbols only (not :@ivar / :$g / :foo=).
    acceptable_19_symbol(bytes)
}

fn acceptable_19_symbol(bytes: &[u8]) -> bool {
    let name = strip_leading_colon(bytes);
    // Setter symbols and non-word forms cannot use `key:` label syntax.
    if name.ends_with(b"=") || name.starts_with(b"@") || name.starts_with(b"$") {
        return false;
    }
    if name.starts_with(b"'") || name.starts_with(b"\"") {
        return true;
    }
    word_symbol_name(name)
}

fn strip_leading_colon(bytes: &[u8]) -> &[u8] {
    if bytes.starts_with(b":") {
        &bytes[1..]
    } else {
        bytes
    }
}

/// RuboCop `/\A[_a-z]\w*[?!]?\z/i` on a symbol name (no leading `:`).
fn word_symbol_name(name: &[u8]) -> bool {
    let Ok(s) = std::str::from_utf8(name) else {
        return false;
    };
    let mut chars = s.chars();
    let Some(first) = chars.next() else {
        return false;
    };
    if first != '_' && !first.is_ascii_alphabetic() {
        return false;
    }
    let rest: String = chars.collect();
    if rest.is_empty() {
        return true;
    }
    word_symbol_rest(&rest)
}

fn word_symbol_rest(rest: &str) -> bool {
    let (body, last) = rest.split_at(rest.len() - 1);
    let last_ch = last.chars().next().unwrap();
    if last_ch == '?' || last_ch == '!' {
        return body.chars().all(|c| c.is_ascii_alphanumeric() || c == '_');
    }
    rest.chars().all(|c| c.is_ascii_alphanumeric() || c == '_')
}

pub fn matches_symbol_array(_source: &SourceFile, node: Node<'_>, config: &CopConfig) -> bool {
    let style = config.get_str("EnforcedStyle", "percent_i");
    match node.kind() {
        "array" => {
            if style != "percent_i" { return false; }
            let mut cur = node.walk();
            let elems: Vec<_> = node.named_children(&mut cur).collect();
            if elems.len() < 2 { return false; }
            elems.iter().all(|e| matches!(e.kind(), "simple_symbol" | "delimited_symbol"))
        }
        "symbol_array" => style == "brackets",
        _ => false,
    }
}

pub fn matches_word_array(_source: &SourceFile, node: Node<'_>, config: &CopConfig) -> bool {
    let style = config.get_str("EnforcedStyle", "percent_w");
    match node.kind() {
        "array" => {
            if style != "percent_w" { return false; }
            let mut cur = node.walk();
            let elems: Vec<_> = node.named_children(&mut cur).collect();
            if elems.len() < 2 { return false; }
            elems.iter().all(|e| e.kind() == "string")
        }
        "string_array" => style == "brackets",
        _ => false,
    }
}