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
explain_lint! {
L0002: UnarySeriesLinter
}
use crate::linter::LintRule;
use crate::common::Span;
use crate::diagnostics::Diagnostic;
use crate::grammar::visit::StmtVisitor;
use crate::grammar::*;
pub struct UnarySeriesLinter<'a> {
source: &'a str,
diagnostics: Vec<Diagnostic>,
}
impl<'a> UnarySeriesLinter<'a> {
pub fn new(source: &'a str) -> Self {
Self {
source,
diagnostics: vec![],
}
}
}
impl<'a> StmtVisitor<'a> for UnarySeriesLinter<'a> {
fn visit_unary(&mut self, expr: &'a UnaryExpr<RcExpr>, start_span: Span) {
let mut is_neg = expr.op == UnaryOperator::SignNegative;
let mut nested = &expr.rhs;
let mut count = 1;
while let Expr::UnaryExpr(UnaryExpr { op, rhs }) = nested.as_ref() {
if op == &UnaryOperator::SignNegative {
is_neg = !is_neg;
}
nested = rhs;
count += 1;
}
if count > 1 {
let span = start_span.to(nested.span);
let inner_expr = nested.span.over(self.source);
let reduced_expr = format!("{}{}", if is_neg { "-" } else { "" }, inner_expr);
self.diagnostics.push(
Diagnostic::span_warn(
span,
"Trivially reducible unary operator chain",
Self::CODE,
None,
)
.with_help(format!(
r#"consider reducing this expression to "{}""#,
reduced_expr
)),
)
}
self.visit_expr(nested);
}
}
impl<'a> LintRule<'a, StmtList> for UnarySeriesLinter<'a> {
fn lint(stmt_list: &StmtList, source: &'a str) -> Vec<Diagnostic> {
let mut linter = Self::new(&source);
linter.visit_stmt_list(stmt_list);
linter.diagnostics
}
}