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::{fmt::Debug, hash::Hash, mem};

use crate::path::Path;

use super::{DiffTree, NodeIDX, Tree};

impl<N, B> DiffTree<N, B>
where
    N: Debug + Clone + PartialEq,
    B: Clone + Debug + Default + PartialEq + Eq + PartialOrd + Ord + Hash,
{
    pub fn mirror_sub_tree(&mut self, tree: &Tree<N, B>, path: &Path<B>, now: bool) {
        let root_t = tree.get_idx(path, None).unwrap();
        let root_s = if let Ok(root_s) = self.get_idx(path, None) {
            root_s
        } else {
            self.extend(path, None)
        };
        self.mirror_sub_tree_at(tree, root_s, root_t, now)
    }
    pub(super) fn mirror_sub_tree_at(
        &mut self,
        tree: &Tree<N, B>,
        idx_s: NodeIDX,
        idx_t: NodeIDX,
        now: bool,
    ) {
        if now {
            self.nodes[idx_s].value.1 = Some(tree.nodes[idx_t].value.clone());
        } else {
            self.nodes[idx_s].value.0 = Some(tree.nodes[idx_t].value.clone());
        }
        self.mirror_sub_tree_rec(tree, idx_s, idx_t, now);
    }

    pub fn mirror_sub_tree_rec(
        &mut self,
        tree: &Tree<N, B>,
        idx_s: NodeIDX,
        idx_t: NodeIDX,
        now: bool,
    ) {
        for (branch, &c_idx_t) in &tree.nodes[idx_t].children {
            let c_idx_s = if let Some(&c_idx_s) = self.nodes[idx_s].children.get(branch) {
                if now {
                    self.nodes[c_idx_s].value.1 = Some(tree.nodes[c_idx_t].value.clone());
                } else {
                    self.nodes[c_idx_s].value.0 = Some(tree.nodes[c_idx_t].value.clone());
                }
                c_idx_s
            } else {
                self.insert_at(
                    idx_s,
                    branch.clone(),
                    if now {
                        (None, Some(tree.nodes[c_idx_t].value.clone()))
                    } else {
                        (Some(tree.nodes[c_idx_t].value.clone()), None)
                    },
                );
                self.nodes[idx_s].children[branch]
            };
            self.mirror_sub_tree_rec(tree, c_idx_s, c_idx_t, now);
        }
    }
}
impl<N, B> DiffTree<N, B>
where
    N: Debug + PartialEq,
    B: Clone + Debug + Default + PartialEq + Eq + PartialOrd + Ord + Hash,
{
    // Reverses a Differential
    pub fn rev(&mut self) {
        for node in self.nodes.iter_mut() {
            mem::swap(&mut node.value.0, &mut node.value.1);
        }
    }
}