/
diff.go
72 lines (57 loc) · 1.14 KB
/
diff.go
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
package pkg
import (
"sort"
"strings"
)
func DiffPaths(pathsA []string, pathsB []string) ([]string, []string) {
sort.Strings(pathsA)
sort.Strings(pathsB)
missingA := []string{}
missingB := []string{}
prefix := "<NOT A PREFIX>"
var i, j int
for i < len(pathsA) && j < len(pathsB) {
pathA := pathsA[i]
pathB := pathsB[j]
pathAHasPrefix := strings.HasPrefix(pathA, prefix)
pathBHasPrefix := strings.HasPrefix(pathB, prefix)
if pathA == pathB {
prefix = pathA
i++
j++
continue
}
if pathBHasPrefix && pathAHasPrefix {
prefix = "<NOT A PREFIX>"
continue
}
if pathA < pathB {
if !pathAHasPrefix {
missingB = append(missingB, pathA)
}
i++
} else {
if !pathBHasPrefix {
missingA = append(missingA, pathB)
}
j++
}
}
for i < len(pathsA) {
pathA := pathsA[i]
pathAHasPrefix := strings.HasPrefix(pathA, prefix)
if !pathAHasPrefix {
missingB = append(missingB, pathA)
}
i++
}
for j < len(pathsB) {
pathB := pathsB[j]
pathBHasPrefix := strings.HasPrefix(pathB, prefix)
if !pathBHasPrefix {
missingA = append(missingA, pathB)
}
j++
}
return missingA, missingB
}