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

use crate::ds::key_node::KeyNode;
use crate::enums::{DiffType, ValueType};

#[derive(Debug, PartialEq)]
pub struct Mismatch {
    pub left_only_keys: KeyNode,
    pub right_only_keys: KeyNode,
    pub keys_in_both: KeyNode,
}

impl Mismatch {
    pub fn new(l: KeyNode, r: KeyNode, u: KeyNode) -> Mismatch {
        Mismatch {
            left_only_keys: l,
            right_only_keys: r,
            keys_in_both: u,
        }
    }

    pub fn empty() -> Self {
        Mismatch {
            left_only_keys: KeyNode::Nil,
            keys_in_both: KeyNode::Nil,
            right_only_keys: KeyNode::Nil,
        }
    }

    pub fn all_diffs(&self) -> Vec<(DiffType, ValueType)> {
        self.all_diffs_trunc(None)
    }

    pub fn all_diffs_trunc(&self, truncation_length: Option<usize>) -> Vec<(DiffType, ValueType)> {
        let both = self
            .keys_in_both
            .absolute_keys_to_vec(truncation_length)
            .into_iter()
            .map(|k| (DiffType::Mismatch, k));
        let left = self
            .left_only_keys
            .absolute_keys_to_vec(truncation_length)
            .into_iter()
            .map(|k| (DiffType::LeftExtra, k));
        let right = self
            .right_only_keys
            .absolute_keys_to_vec(truncation_length)
            .into_iter()
            .map(|k| (DiffType::RightExtra, k));

        both.chain(left).chain(right).collect()
    }
}

#[cfg(test)]
mod test {
    use super::*;
    #[test]
    fn empty_diffs() {
        let empty = Mismatch::empty();
        let all_diffs = empty.all_diffs();
        assert!(all_diffs.is_empty());
    }
}