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
use std::path::PathBuf;
use crate::node::Node;
use crate::dump::*;
use crate::traits::*;
pub fn find<'a, T: ParserTrait>(parser: &'a T, filters: &[String]) -> Option<Vec<Node<'a>>> {
let filters = parser.get_filters(filters);
let node = parser.get_root();
let mut cursor = node.object().walk();
let mut stack = Vec::new();
let mut good = Vec::new();
let mut children = Vec::new();
stack.push(node);
while let Some(node) = stack.pop() {
if filters.any(&node) {
good.push(node);
}
cursor.reset(node.object());
if cursor.goto_first_child() {
loop {
children.push(Node::new(cursor.node()));
if !cursor.goto_next_sibling() {
break;
}
}
for child in children.drain(..).rev() {
stack.push(child);
}
}
}
Some(good)
}
pub struct FindCfg {
pub path: PathBuf,
pub filters: Vec<String>,
pub line_start: Option<usize>,
pub line_end: Option<usize>,
}
pub struct Find {
_guard: (),
}
impl Callback for Find {
type Res = std::io::Result<()>;
type Cfg = FindCfg;
fn call<T: ParserTrait>(cfg: Self::Cfg, parser: &T) -> Self::Res {
if let Some(good) = find(parser, &cfg.filters) {
if !good.is_empty() {
println!("In file {}", cfg.path.to_str().unwrap());
for node in good {
dump_node(parser.get_code(), &node, 1, cfg.line_start, cfg.line_end)?;
}
println!();
}
}
Ok(())
}
}