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
|
//! A type that represents the union of a set of regular expressions.
use regex::RegexSet as RxSet;
// Yeah, I'm aware this is sorta crappy, should be cheaper to compile a regex
// ORing all the patterns, I guess...
/// A dynamic set of regular expressions.
#[derive(Debug)]
pub struct RegexSet {
items: Vec<String>,
set: Option<RxSet>,
}
impl RegexSet {
/// Is this set empty?
pub fn is_empty(&self) -> bool {
self.items.is_empty()
}
/// Extend this set with every regex in the iterator.
pub fn extend<I, S>(&mut self, iter: I)
where
I: IntoIterator<Item = S>,
S: AsRef<str>,
{
for s in iter.into_iter() {
self.insert(s)
}
}
/// Insert a new regex into this set.
pub fn insert<S>(&mut self, string: S)
where
S: AsRef<str>,
{
self.items.push(format!("^{}$", string.as_ref()));
self.set = None;
}
/// Returns slice of String from its field 'items'
pub fn get_items(&self) -> &[String] {
&self.items[..]
}
/// Returns reference of its field 'set'
pub fn get_set(&self) -> Option<&RxSet> {
self.set.as_ref()
}
/// Construct a RegexSet from the set of entries we've accumulated.
///
/// Must be called before calling `matches()`, or it will always return
/// false.
pub fn build(&mut self) {
self.set = match RxSet::new(&self.items) {
Ok(x) => Some(x),
Err(e) => {
error!("Invalid regex in {:?}: {:?}", self.items, e);
None
}
}
}
/// Does the given `string` match any of the regexes in this set?
pub fn matches<S>(&self, string: S) -> bool
where
S: AsRef<str>,
{
let s = string.as_ref();
self.set.as_ref().map(|set| set.is_match(s)).unwrap_or(
false,
)
}
}
impl Default for RegexSet {
fn default() -> Self {
RegexSet {
items: vec![],
set: None,
}
}
}
|
