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
147
148
149
use crate::{
errors::{FilterExpressionParseErrors, ParseSingleError, State},
parsing::{parse, ParsedExpr, Span},
};
use guppy::{graph::PackageGraph, PackageId};
use miette::SourceSpan;
use std::{cell::RefCell, collections::HashSet};
#[derive(Debug, Clone)]
pub enum NameMatcher {
Equal(String),
Contains(String),
Regex(regex::Regex),
}
impl PartialEq for NameMatcher {
fn eq(&self, other: &Self) -> bool {
match (self, other) {
(Self::Contains(s1), Self::Contains(s2)) => s1 == s2,
(Self::Equal(s1), Self::Equal(s2)) => s1 == s2,
(Self::Regex(r1), Self::Regex(r2)) => r1.as_str() == r2.as_str(),
_ => false,
}
}
}
impl Eq for NameMatcher {}
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum FilteringSet {
Packages(HashSet<PackageId>),
Test(NameMatcher, SourceSpan),
All,
None,
}
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum FilteringExpr {
Not(Box<FilteringExpr>),
Union(Box<FilteringExpr>, Box<FilteringExpr>),
Intersection(Box<FilteringExpr>, Box<FilteringExpr>),
Set(FilteringSet),
}
impl NameMatcher {
pub(crate) fn is_match(&self, input: &str) -> bool {
match self {
Self::Equal(text) => text == input,
Self::Contains(text) => input.contains(text),
Self::Regex(reg) => reg.is_match(input),
}
}
}
impl FilteringSet {
fn includes(&self, package_id: &PackageId, name: &str) -> bool {
match self {
Self::All => true,
Self::None => false,
Self::Test(matcher, _) => matcher.is_match(name),
Self::Packages(packages) => packages.contains(package_id),
}
}
}
impl FilteringExpr {
pub fn parse(
input: &str,
graph: &PackageGraph,
) -> Result<FilteringExpr, FilterExpressionParseErrors> {
let errors = RefCell::new(Vec::new());
match parse(Span::new_extra(input, State::new(&errors))) {
Ok(parsed_expr) => {
let errors = errors.into_inner();
if !errors.is_empty() {
return Err(FilterExpressionParseErrors::new(input, errors));
}
match parsed_expr {
ParsedExpr::Valid(expr) => crate::compile::compile(&expr, graph)
.map_err(|errors| FilterExpressionParseErrors::new(input, errors)),
_ => {
Err(FilterExpressionParseErrors::new(
input,
vec![ParseSingleError::Unknown],
))
}
}
}
Err(_) => {
Err(FilterExpressionParseErrors::new(
input,
vec![ParseSingleError::Unknown],
))
}
}
}
pub fn includes(&self, package_id: &PackageId, name: &str) -> bool {
match self {
Self::Set(set) => set.includes(package_id, name),
Self::Not(expr) => !expr.includes(package_id, name),
Self::Union(expr_1, expr_2) => {
expr_1.includes(package_id, name) || expr_2.includes(package_id, name)
}
Self::Intersection(expr_1, expr_2) => {
expr_1.includes(package_id, name) && expr_2.includes(package_id, name)
}
}
}
pub fn needs_deps(raw_expr: &str) -> bool {
raw_expr.contains("deps")
}
}