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
use std::fs;
use crate::ast::Solution;
use jwalk::{Parallelism, WalkDir};
use std::option::Option::Some;
pub mod ast;
mod lex;
pub mod msbuild;
mod parser;
#[macro_use]
extern crate lalrpop_util;
extern crate jwalk;
extern crate petgraph;
#[cfg(test)]
#[macro_use]
extern crate spectral;
#[cfg(test)]
#[macro_use]
extern crate table_test;
lalrpop_mod!(
#[allow(clippy::all)]
#[allow(unused)]
pub solp
);
pub trait Consume {
fn ok(&mut self, path: &str, solution: &Solution);
fn err(&self, path: &str);
fn is_debug(&self) -> bool;
}
pub fn parse(path: &str, consumer: &mut dyn Consume) {
match fs::read_to_string(path) {
Ok(contents) => {
if let Some(solution) = parser::parse_str(&contents, consumer.is_debug()) {
consumer.ok(path, &solution);
} else {
consumer.err(path);
}
}
Err(e) => eprintln!("{} - {}", path, e),
}
}
pub fn scan(path: &str, extension: &str, consumer: &mut dyn Consume) -> usize {
let parallelism = Parallelism::RayonNewPool(num_cpus::get_physical());
let iter = WalkDir::new(path)
.skip_hidden(false)
.follow_links(false)
.parallelism(parallelism);
let ext = extension.trim_start_matches('.');
iter.into_iter()
.filter(Result::is_ok)
.map(Result::unwrap)
.filter(|f| f.file_type().is_file())
.map(|f| f.path())
.filter(|p| {
return match p.extension() {
Some(s) => s == ext,
None => false,
};
})
.map(|f| f.to_str().unwrap_or("").to_string())
.inspect(|fp| parse(fp, consumer))
.count()
}
fn cut_from_back_until(s: &str, ch: char, skip: usize) -> &str {
let cut = cut_count(s, ch, skip);
&s[..s.len() - cut]
}
fn cut_count(s: &str, ch: char, skip: usize) -> usize {
let mut counter = 0;
let count = s
.chars()
.rev()
.take_while(|c| {
if *c == ch {
counter += 1;
}
counter <= skip
})
.count();
if count == s.len() {
s.len()
} else {
count + 1
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn cut_from_back_until_tests() {
let cases = vec![
("a.b.c.d", "a.b"),
("a.b.c", "a"),
("a..b.c", "a."),
("...", "."),
("..", ""),
(".", ""),
("a.b", ""),
("ab", ""),
];
for (validator, input, expected) in table_test!(cases) {
let actual = cut_from_back_until(input, '.', 1);
validator
.given(&format!("from {}", input))
.when("cut_from_back_until")
.then(&format!("it should be {}", expected))
.assert_eq(expected, actual);
}
}
}