reconcile-text 0.12.0

Intelligent 3-way text merging with automated conflict resolution
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
104
105

use std::fmt::Debug;

use crate::Token;

/// Given two lists of tokens, returns `length` where the `old` list
/// somewhere within contains the `length` prefix of the `new` list
///
/// ## Example
///
/// ```not_rust
/// old: [0, 1, 9, 0, 2, 5]
/// new:       [9, 0, 2, 5, 1]
/// ```
/// > results in a length of 4
///
///
/// ```not_rust
/// old: [0, 1, 9, 0, 2, 5]
/// new:          [0, 2]
/// ```
/// > results in a length of 2
///
/// ```not_rust
/// old: [0, 1, 9, 0, 2, 5]
/// new:          [0, 4]
/// ```
/// > results in a length of 1
pub fn find_longest_prefix_contained_within<T>(old: &[Token<T>], new: &[Token<T>]) -> usize
where
    T: PartialEq + Clone + Debug,
{
    let max_possible = new.len().min(old.len());

    for len in (1..=max_possible).rev() {
        let prefix = &new[..len];
        if old.windows(len).any(|window| window == prefix) {
            return len;
        }
    }

    0
}

#[cfg(test)]
mod tests {
    use pretty_assertions::assert_eq;

    use super::*;

    #[test]
    fn test_common_overlap() {
        assert_eq!(
            find_longest_prefix_contained_within(&["".into()], &["".into()]),
            1
        );

        assert_eq!(
            find_longest_prefix_contained_within(
                &["a".into(), "b".into(), "c".into()],
                &["b".into(), "c".into(), "a".into()]
            ),
            2
        );

        assert_eq!(
            find_longest_prefix_contained_within(
                &["a".into(), "b".into(), "c".into()],
                &["b".into(), "c".into()]
            ),
            2
        );

        assert_eq!(
            find_longest_prefix_contained_within(
                &["a".into(), "b".into(), "c".into()],
                &["b".into()]
            ),
            1
        );

        assert_eq!(
            find_longest_prefix_contained_within(
                &["a".into(), "b".into(), "c".into(), "b".into(), "a".into()],
                &["b".into(), "a".into()]
            ),
            2
        );

        assert_eq!(
            find_longest_prefix_contained_within(
                &["a".into(), "a".into(), "a".into()],
                &["a".into(), "b".into(), "c".into()]
            ),
            1
        );

        assert_eq!(
            find_longest_prefix_contained_within(
                &["a".into(), "b".into(), "c".into()],
                &["d".into(), "e".into(), "a".into()]
            ),
            0
        );
    }
}