treereduce 0.4.1

Fast, syntax-aware, multi-language program reducer based on delta debugging
Documentation 
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

use std::collections::{HashMap, HashSet};
use tree_sitter::{Node, Tree};
use tree_sitter_edit::Editor;

use crate::id::NodeId;

#[derive(Clone, Debug)]
pub struct Edits {
    omit: HashSet<NodeId>,
    replace: HashMap<NodeId, String>,
}

impl Edits {
    #[must_use]
    pub fn new() -> Edits {
        Edits {
            omit: HashSet::new(),
            replace: HashMap::new(),
        }
    }

    #[must_use]
    pub fn is_empty(&self) -> bool {
        self.omit.is_empty()
    }

    #[must_use]
    pub fn omit(mut self, node: &Node<'_>) -> Self {
        self.omit.insert(NodeId::new(node));
        self
    }

    #[must_use]
    pub fn omit_id(mut self, node_id: NodeId) -> Self {
        self.omit.insert(node_id);
        self
    }

    #[must_use]
    pub fn omit_ids(mut self, node_ids: &[NodeId]) -> Self {
        for node_id in node_ids {
            self.omit.insert(*node_id);
        }
        self
    }

    #[must_use]
    pub fn replace(mut self, node: &Node<'_>, s: String) -> Self {
        self.replace.insert(NodeId::new(node), s);
        self
    }

    #[must_use]
    pub fn replace_id(mut self, node_id: NodeId, s: String) -> Self {
        self.replace.insert(node_id, s);
        self
    }

    #[must_use]
    pub fn should_omit(&self, node: &Node<'_>) -> bool {
        self.omit.contains(&NodeId::new(node))
    }

    #[must_use]
    pub fn should_omit_id(&self, node_id: &NodeId) -> bool {
        self.omit.contains(node_id)
    }

    #[must_use]
    pub fn should_replace(&self, node: &Node<'_>) -> bool {
        self.replace.contains_key(&NodeId::new(node))
    }

    #[must_use]
    pub fn should_replace_id(&self, node_id: &NodeId) -> bool {
        self.replace.contains_key(node_id)
    }
}

impl Default for Edits {
    fn default() -> Self {
        Self::new()
    }
}

impl Editor for Edits {
    fn has_edit(&self, _tree: &Tree, node: &Node<'_>) -> bool {
        self.should_omit(node) || self.should_replace(node)
    }

    fn edit(&self, _source: &[u8], tree: &Tree, node: &Node<'_>) -> Vec<u8> {
        debug_assert!(self.has_edit(tree, node));
        if self.should_omit(node) {
            Vec::new()
        } else {
            self.replace
                .get(&NodeId::new(node))
                .unwrap()
                .clone()
                .into_bytes()
        }
    }
}