arity 0.3.0

An LSP, formatter, and linter for R
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

//! Fix application: turn a set of [`Fix`] edits into rewritten source text.
//!
//! Shared by `lint --fix` (CLI) and the LSP code-action path. The engine is a
//! pure function over `(source, fixes, include_unsafe)`; it never reads or
//! writes files.

use super::diagnostic::{Applicability, Fix};

/// Result of applying a batch of fixes to a source string.
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct FixOutcome {
    /// The rewritten source.
    pub output: String,
    /// Number of fixes applied.
    pub applied: usize,
    /// Number of fixes dropped because they overlapped an already-applied fix.
    pub skipped_conflicts: usize,
}

/// Apply `fixes` to `source`, returning the rewritten text.
///
/// `Unsafe` fixes are skipped unless `include_unsafe` is set. Remaining fixes
/// are applied in source order; any fix overlapping a previously-applied one is
/// dropped (counted in [`FixOutcome::skipped_conflicts`]) so the output stays
/// well-formed. Edits are spliced right-to-left so earlier byte offsets remain
/// valid as later ones are rewritten.
pub fn apply_fixes(source: &str, fixes: &[Fix], include_unsafe: bool) -> FixOutcome {
    // Eligible fixes, sorted by start (then end) so overlap detection is a
    // single left-to-right sweep.
    let mut eligible: Vec<&Fix> = fixes
        .iter()
        .filter(|f| include_unsafe || f.applicability == Applicability::Safe)
        .collect();
    eligible.sort_by_key(|f| (f.start, f.end));

    let mut accepted: Vec<&Fix> = Vec::with_capacity(eligible.len());
    let mut skipped_conflicts = 0usize;
    let mut last_end = 0usize;
    for fix in eligible {
        // Skip malformed or backwards spans defensively.
        if fix.start > fix.end || fix.end > source.len() {
            skipped_conflicts += 1;
            continue;
        }
        if !accepted.is_empty() && fix.start < last_end {
            skipped_conflicts += 1;
            continue;
        }
        last_end = fix.end;
        accepted.push(fix);
    }

    let applied = accepted.len();
    let mut output = source.to_string();
    // Apply right-to-left so each splice leaves earlier offsets untouched.
    for fix in accepted.iter().rev() {
        output.replace_range(fix.start..fix.end, &fix.content);
    }

    FixOutcome {
        output,
        applied,
        skipped_conflicts,
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    fn safe(start: usize, end: usize, content: &str) -> Fix {
        Fix::safe(start, end, content, "test")
    }

    #[test]
    fn applies_single_fix() {
        let out = apply_fixes("if (x = 1) y", &[safe(6, 7, "==")], false);
        assert_eq!(out.output, "if (x == 1) y");
        assert_eq!(out.applied, 1);
        assert_eq!(out.skipped_conflicts, 0);
    }

    #[test]
    fn applies_multiple_fixes_right_to_left() {
        // Two non-overlapping replacements; the earlier one must not be shifted
        // by the later one.
        let out = apply_fixes("a = b = c", &[safe(2, 3, "=="), safe(6, 7, "==")], false);
        assert_eq!(out.output, "a == b == c");
        assert_eq!(out.applied, 2);
    }

    #[test]
    fn skips_unsafe_unless_opted_in() {
        let fixes = [Fix::unsafe_(0, 6, "", "delete")];
        let kept = apply_fixes("x <- 1\n", &fixes, false);
        assert_eq!(kept.output, "x <- 1\n");
        assert_eq!(kept.applied, 0);

        let applied = apply_fixes("x <- 1\n", &fixes, true);
        assert_eq!(applied.output, "\n");
        assert_eq!(applied.applied, 1);
    }

    #[test]
    fn drops_overlapping_fixes() {
        let out = apply_fixes("abcdef", &[safe(0, 3, "X"), safe(2, 5, "Y")], false);
        // First wins; second overlaps and is dropped.
        assert_eq!(out.output, "Xdef");
        assert_eq!(out.applied, 1);
        assert_eq!(out.skipped_conflicts, 1);
    }

    #[test]
    fn adjacent_fixes_do_not_conflict() {
        let out = apply_fixes("abcd", &[safe(0, 2, "X"), safe(2, 4, "Y")], false);
        assert_eq!(out.output, "XY");
        assert_eq!(out.applied, 2);
        assert_eq!(out.skipped_conflicts, 0);
    }
}