-
-
Notifications
You must be signed in to change notification settings - Fork 7
/
diff.go
395 lines (312 loc) · 7.86 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
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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
package yamldiff
import (
"fmt"
"reflect"
"github.com/goccy/go-yaml"
)
type DiffStatus int
const (
DiffStatusSame DiffStatus = 1
DiffStatusDiff DiffStatus = 2
DiffStatus1Missing DiffStatus = 3
DiffStatus2Missing DiffStatus = 4
fakeForMissingKey = "000_unexpected-key_000"
)
type (
rawType = interface{}
rawTypeMap = yaml.MapSlice
rawTypeArray = []rawType
_missingKey struct{}
diff struct {
a rawType
b rawType
children *diffChildren
status DiffStatus
diffCount int
treeLevel int
}
diffChildrenArray = []*diff
diffChildrenMap = map[string]*diff
diffChildren struct {
a diffChildrenArray
m diffChildrenMap
}
)
//nolint:gochecknoglobals
var missingKey = _missingKey{}
func (r *runner) performDiff(rawA rawType, rawB rawType, level int) *diff {
if rawA == nil || rawB == nil || rawA == missingKey || rawB == missingKey {
return r.handlePrimitive(rawA, rawB, level)
}
if res := r.handleMap(rawA, rawB, level); res != nil {
return res
}
if res := r.handleArray(rawA, rawB, level); res != nil {
return res
}
// other case -> handle as primitive (int/float/bool/string)
return r.handlePrimitive(rawA, rawB, level)
}
func (r *runner) handleMap(rawA rawType, rawB rawType, level int) *diff {
result := &diff{
a: rawA,
b: rawB,
treeLevel: level,
}
mapA, mapAok := tryMap(rawA)
mapB, mapBok := tryMap(rawB)
// if both are not map
if !mapAok && !mapBok {
return nil
}
// if A is not map but B is map -> it's different data
if !mapAok || !mapBok {
result.status = DiffStatusDiff
result.diffCount = r.handlePrimitive(rawA, rawB, level).diffCount
return result
}
// if both are map
result.children = &diffChildren{
m: diffChildrenMap{},
}
result.status = DiffStatusSame
// if B is map -> check the same key children
for _, valA := range mapA {
keyA, ok := valA.Key.(string)
if !ok {
keyA = fakeForMissingKey
}
foundKey := false
for _, valB := range mapB {
keyB, ok := valB.Key.(string)
if !ok {
keyB = fakeForMissingKey
}
if keyA != keyB {
continue
}
result.children.m[keyA] = r.performDiff(valA.Value, valB.Value, level+1)
if result.children.m[keyA].status != DiffStatusSame {
result.status = DiffStatusDiff // top level diff can't specify actual reason
}
foundKey = true
break
}
if !foundKey {
result.children.m[keyA] = r.performDiff(valA.Value, missingKey, level+1)
if result.children.m[keyA].status != DiffStatusSame {
result.status = DiffStatusDiff // top level diff can't specify actual reason
}
}
}
// finding missing keyA
for _, valB := range mapB {
keyB, ok := valB.Key.(string)
if !ok {
keyB = fakeForMissingKey
}
foundKey := false
for _, valA := range mapA {
keyA, ok := valA.Key.(string)
if !ok {
keyA = fakeForMissingKey
}
if keyB != keyA {
continue
}
foundKey = true
break
}
if !foundKey {
result.children.m[keyB] = r.performDiff(missingKey, valB.Value, level+1)
if result.children.m[keyB].status != DiffStatusSame {
result.status = DiffStatusDiff // top level diff can't specify actual reason
}
}
}
sum := 0
for _, v := range result.children.m {
sum += v.diffCount
}
result.diffCount = sum
return result
}
func (r *runner) handleArray(rawA rawType, rawB rawType, level int) *diff {
result := &diff{
a: rawA,
b: rawB,
treeLevel: level,
}
arrayA, arrayAok := tryArray(rawA)
arrayB, arrayBok := tryArray(rawB)
// if both are not array
if !arrayAok && !arrayBok {
return nil
}
// if A is not array but B is array -> it's different data
if !arrayAok || !arrayBok {
result.status = DiffStatusDiff
result.diffCount = r.handlePrimitive(rawA, rawB, level).diffCount
return result
}
// if both are array
result.children = &diffChildren{
a: diffChildrenArray{},
}
result.status = DiffStatusSame
// check each elements is same or not
diffs := map[string]*diff{}
foundA := map[int]struct{}{}
foundB := map[int]struct{}{}
for keyA, valA := range arrayA {
for keyB, valB := range arrayB {
key := fmt.Sprintf("%d-%d", keyA, keyB)
diffs[key] = r.performDiff(valA, valB, level+1)
if diffs[key].status == DiffStatusSame {
// store result and mark as confirmed
result.children.a = append(result.children.a, diffs[key])
foundA[keyA] = struct{}{}
foundB[keyB] = struct{}{}
break
}
}
}
// found all elements, it's same array
if len(foundA) == len(arrayA) && len(foundB) == len(arrayB) {
return result
}
result.status = DiffStatusDiff
// check diff elements
for {
// all confirmed arrayA, need to consider arrayB
if len(foundA) == len(arrayA) {
for k, v := range arrayB {
if _, ok := foundB[k]; ok {
continue
}
result.children.a = append(result.children.a, r.performDiff(nil, v, level+1))
}
break
}
// all confirmed arrayB, need to consider in arrayA
if len(foundB) == len(arrayB) {
for k, v := range arrayA {
if _, ok := foundA[k]; ok {
continue
}
result.children.a = append(result.children.a, r.performDiff(v, nil, level+1))
}
break
}
smallestDiff := &diff{diffCount: 100000} // FIXME
smallestKeyA := 0
smallestKeyB := 0
for keyA := range arrayA {
if _, ok := foundA[keyA]; ok {
continue
}
for keyB := range arrayB {
if _, ok := foundB[keyB]; ok {
continue
}
key := fmt.Sprintf("%d-%d", keyA, keyB)
if diffs[key].status == DiffStatusSame {
continue // unexpected case
}
if smallestDiff.diffCount > diffs[key].diffCount {
smallestDiff = diffs[key]
smallestKeyA = keyA
smallestKeyB = keyB
}
}
}
result.children.a = append(result.children.a, smallestDiff)
foundA[smallestKeyA] = struct{}{}
foundB[smallestKeyB] = struct{}{}
}
sum := 0
for _, v := range result.children.a {
sum += v.diffCount
}
result.diffCount = sum
return result
}
func (r *runner) handlePrimitive(rawA rawType, rawB rawType, level int) *diff {
result := &diff{
a: rawA,
b: rawB,
treeLevel: level,
}
strA := []rune(fmt.Sprint(rawA))
strB := []rune(fmt.Sprint(rawB))
switch {
case rawA == nil && rawB == nil:
result.status = DiffStatusSame
case rawA == missingKey:
switch {
case r.option.emptyAsNull && (rawB == nil || string(strB) == "{}" || string(strB) == "[]"),
r.option.zeroAsNull && (reflect.ValueOf(rawB).IsValid() && reflect.ValueOf(rawB).IsZero()):
result.status = DiffStatusSame
default:
result.a = nil
result.status = DiffStatus1Missing
result.diffCount = len(strB)
}
case rawB == missingKey:
switch {
case r.option.emptyAsNull && rawA == nil,
r.option.zeroAsNull && (reflect.ValueOf(rawA).IsValid() && reflect.ValueOf(rawA).IsZero()):
result.status = DiffStatusSame
default:
result.b = nil
result.status = DiffStatus2Missing
result.diffCount = len(strA)
}
case rawA == nil:
result.status = DiffStatusDiff
result.diffCount = len(strB)
case rawB == nil:
result.status = DiffStatusDiff
result.diffCount = len(strA)
case rawA == rawB:
result.status = DiffStatusSame
default:
result.status = DiffStatusDiff
}
// calculate diff size for diff
if result.status == DiffStatusDiff {
maxLen := len(strA)
if lenB := len(strB); maxLen < lenB {
maxLen = lenB
}
for nA, a := range strA {
// lenA > lenB
if len(strB) <= nA {
result.diffCount = maxLen - nA
break
}
// found diff in A and B strings
if b := strB[nA]; a != b {
result.diffCount = maxLen - nA
break
}
}
// guess lenA < lemB
if result.diffCount == 0 {
result.diffCount = maxLen - len(strA)
}
}
return result
}
func tryMap(x rawType) (rawTypeMap, bool) {
m, ok := x.(yaml.MapSlice)
return m, ok
}
func tryMapItem(x rawType) (yaml.MapItem, bool) {
m, ok := x.(yaml.MapItem)
return m, ok
}
func tryArray(x rawType) (rawTypeArray, bool) {
a, ok := x.([]interface{})
return a, ok
}