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

//! GraphQL/OrderedArguments — arguments alphabetical within consecutive groups.

use tree_sitter::Node;

use super::helpers::{
    argument_name, consecutive_lines, correct_order, enclosing_class, is_argument_call, nested_class,
    DEPT_INCLUDE,
};
use crate::cop::{Cop, CopConfig};
use crate::diagnostic::Diagnostic;
use crate::parse::source::SourceFile;

pub struct OrderedArguments;

impl Cop for OrderedArguments {
    fn name(&self) -> &'static str {
        "GraphQL/OrderedArguments"
    }

    fn default_include(&self) -> &'static [&'static str] {
        DEPT_INCLUDE
    }

    fn interested_node_kinds(&self) -> &'static [&'static str] {
        &["class"]
    }

    fn check_node(
        &self,
        source: &SourceFile,
        node: Node<'_>,
        config: &CopConfig,
        diagnostics: &mut Vec<Diagnostic>,
        _corrections: Option<&mut Vec<crate::correction::Correction>>,
    ) {
        if nested_class(node) {
            return;
        }
        let order = super::helpers::config_string_list(config, "Order");
        let order_ref = (!order.is_empty()).then_some(order.as_slice());
        let mut args = Vec::new();
        collect_args(source, node, node, &mut args);
        for win in args.windows(2) {
            report_pair(self, source, win[0], win[1], order_ref, diagnostics);
        }
    }
}

fn report_pair(
    cop: &OrderedArguments,
    source: &SourceFile,
    prev: Node<'_>,
    curr: Node<'_>,
    order_ref: Option<&[String]>,
    diagnostics: &mut Vec<Diagnostic>,
) {
    if !consecutive_lines(prev, curr) {
        return;
    }
    let (Some(pn), Some(cn)) = (argument_name(source, prev), argument_name(source, curr)) else {
        return;
    };
    if correct_order(&pn, &cn, order_ref) {
        return;
    }
    let (line, col) = source.offset_to_line_col(curr.start_byte());
    diagnostics.push(cop.diagnostic(
        source,
        line,
        col,
        format!(
            "Arguments should be sorted in an alphabetical order within their section. Field `{cn}` should appear before `{pn}`."
        ),
    ));
}

fn collect_args<'a>(
    source: &SourceFile,
    node: Node<'a>,
    class_node: Node<'a>,
    out: &mut Vec<Node<'a>>,
) {
    if node.kind() == "class" && node.id() != class_node.id() {
        return;
    }
    if is_argument_call(source, node)
        && enclosing_class(node).is_some_and(|c| c.id() == class_node.id())
    {
        out.push(node);
    }
    let mut cur = node.walk();
    for child in node.children(&mut cur) {
        collect_args(source, child, class_node, out);
    }
}