-
Notifications
You must be signed in to change notification settings - Fork 141
/
diff.go
439 lines (368 loc) · 10 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
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
// Copyright 2023 The PipeCD Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package diff
import (
"fmt"
"reflect"
"strconv"
"strings"
"k8s.io/apimachinery/pkg/apis/meta/v1/unstructured"
)
type differ struct {
ignoreAddingMapKeys bool
equateEmpty bool
compareNumberAndNumericString bool
ignoredPaths map[string]struct{}
ignoreConfig map[string][]string
result *Result
}
type Option func(*differ)
// WithIgnoreAddingMapKeys configures differ to ignore all map keys
// that were added to the second object and missing in the first one.
func WithIgnoreAddingMapKeys() Option {
return func(d *differ) {
d.ignoreAddingMapKeys = true
}
}
// WithEquateEmpty configures differ to consider all maps/slides with a length of zero and nil to be equal.
func WithEquateEmpty() Option {
return func(d *differ) {
d.equateEmpty = true
}
}
// WithCompareNumberAndNumericString configures differ to compare a number with a numeric string.
// Differ parses the string to number before comparing their values.
// e.g. 1.5 == "1.5"
func WithCompareNumberAndNumericString() Option {
return func(d *differ) {
d.compareNumberAndNumericString = true
}
}
// WithIgnoreConfig configures ignored fields.
func WithIgnoreConfig(config map[string][]string) Option {
return func(d *differ) {
d.ignoreConfig = config
}
}
func (d *differ) initIgnoredPaths(key string) {
paths := d.ignoreConfig[key]
d.ignoredPaths = make(map[string]struct{}, len(paths))
for _, path := range paths {
d.ignoredPaths[path] = struct{}{}
}
}
// DiffUnstructureds calculates the diff between two unstructured objects.
func DiffUnstructureds(x, y unstructured.Unstructured, key string, opts ...Option) (*Result, error) {
var (
path = []PathStep{}
vx = reflect.ValueOf(x.Object)
vy = reflect.ValueOf(y.Object)
d = &differ{result: &Result{}}
)
for _, opt := range opts {
opt(d)
}
d.initIgnoredPaths(key)
if err := d.diff(path, vx, vy); err != nil {
return nil, err
}
d.result.sort()
return d.result, nil
}
func (d *differ) diff(path []PathStep, vx, vy reflect.Value) error {
if !vx.IsValid() {
if d.equateEmpty && isEmptyInterface(vy) {
return nil
}
d.addNode(path, nil, vy.Type(), vx, vy)
return nil
}
if !vy.IsValid() {
if d.equateEmpty && isEmptyInterface(vx) {
return nil
}
d.addNode(path, vx.Type(), nil, vx, vy)
return nil
}
if isNumberValue(vx) && isNumberValue(vy) {
return d.diffNumber(path, vx, vy)
}
if d.compareNumberAndNumericString {
if isNumberValue(vx) {
if y, ok := convertToNumber(vy); ok {
return d.diffNumber(path, vx, y)
}
}
if isNumberValue(vy) {
if x, ok := convertToNumber(vx); ok {
return d.diffNumber(path, x, vy)
}
}
}
if vx.Type() != vy.Type() {
d.addNode(path, vx.Type(), vy.Type(), vx, vy)
return nil
}
switch vx.Kind() {
case reflect.Map:
return d.diffMap(path, vx, vy)
case reflect.Slice, reflect.Array:
return d.diffSlice(path, vx, vy)
case reflect.Interface:
return d.diffInterface(path, vx, vy)
case reflect.String:
return d.diffString(path, vx, vy)
case reflect.Bool:
return d.diffBool(path, vx, vy)
default:
return fmt.Errorf("%v kind is not handled", vx.Kind())
}
}
func (d *differ) diffSlice(path []PathStep, vx, vy reflect.Value) error {
if vx.IsNil() || vy.IsNil() {
d.addNode(path, vx.Type(), vy.Type(), vx, vy)
return nil
}
minLen := vx.Len()
if minLen > vy.Len() {
minLen = vy.Len()
}
for i := 0; i < minLen; i++ {
nextPath := newSlicePath(path, i)
nextValueX := vx.Index(i)
nextValueY := vy.Index(i)
if err := d.diff(nextPath, nextValueX, nextValueY); err != nil {
return err
}
}
for i := minLen; i < vx.Len(); i++ {
nextPath := newSlicePath(path, i)
nextValueX := vx.Index(i)
d.addNode(nextPath, nextValueX.Type(), nextValueX.Type(), nextValueX, reflect.Value{})
}
for i := minLen; i < vy.Len(); i++ {
nextPath := newSlicePath(path, i)
nextValueY := vy.Index(i)
d.addNode(nextPath, nextValueY.Type(), nextValueY.Type(), reflect.Value{}, nextValueY)
}
return nil
}
func (d *differ) diffMap(path []PathStep, vx, vy reflect.Value) error {
if vx.IsNil() || vy.IsNil() {
d.addNode(path, vx.Type(), vy.Type(), vx, vy)
return nil
}
keys := append(vx.MapKeys(), vy.MapKeys()...)
checks := make(map[string]struct{})
for _, k := range keys {
if k.Kind() != reflect.String {
return fmt.Errorf("unsupport %v as key type of a map", k.Kind())
}
if _, ok := checks[k.String()]; ok {
continue
}
nextValueY := vy.MapIndex(k)
// Don't need to check the key existing in the first(LiveManifest) one but missing in the seccond(GitManifest) one
// when IgnoreAddingMapKeys is configured.
if d.ignoreAddingMapKeys && !nextValueY.IsValid() {
continue
}
nextPath := newMapPath(path, k.String())
nextValueX := vx.MapIndex(k)
checks[k.String()] = struct{}{}
if err := d.diff(nextPath, nextValueX, nextValueY); err != nil {
return err
}
}
return nil
}
func (d *differ) diffInterface(path []PathStep, vx, vy reflect.Value) error {
if isEmptyInterface(vx) && isEmptyInterface(vy) {
return nil
}
if vx.IsNil() || vy.IsNil() {
d.addNode(path, vx.Type(), vy.Type(), vx, vy)
return nil
}
vx, vy = vx.Elem(), vy.Elem()
return d.diff(path, vx, vy)
}
func (d *differ) diffString(path []PathStep, vx, vy reflect.Value) error {
if vx.String() == vy.String() {
return nil
}
d.addNode(path, vx.Type(), vy.Type(), vx, vy)
return nil
}
func (d *differ) diffBool(path []PathStep, vx, vy reflect.Value) error {
if vx.Bool() == vy.Bool() {
return nil
}
d.addNode(path, vx.Type(), vy.Type(), vx, vy)
return nil
}
func (d *differ) diffNumber(path []PathStep, vx, vy reflect.Value) error {
if floatNumber(vx) == floatNumber(vy) {
return nil
}
d.addNode(path, vx.Type(), vy.Type(), vx, vy)
return nil
}
// isEmptyInterface reports whether v is nil or zero value or its element is an empty map, an empty slice.
func isEmptyInterface(v reflect.Value) bool {
if !v.IsValid() || v.IsNil() || v.IsZero() {
return true
}
if v.Kind() != reflect.Interface {
return false
}
e := v.Elem()
// When the value that the interface v contains is a zero value (false boolean, zero number, empty string...).
if e.IsZero() {
return true
}
switch e.Kind() {
case reflect.Array, reflect.Slice, reflect.Map:
return e.Len() == 0
default:
return false
}
}
func floatNumber(v reflect.Value) float64 {
switch v.Kind() {
case reflect.Float32, reflect.Float64:
return v.Float()
default:
return float64(v.Int())
}
}
func isNumberValue(v reflect.Value) bool {
switch v.Kind() {
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64, reflect.Float32, reflect.Float64:
return true
default:
return false
}
}
func convertToNumber(v reflect.Value) (reflect.Value, bool) {
switch v.Kind() {
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64, reflect.Float32, reflect.Float64:
return v, true
case reflect.String:
if n, err := strconv.ParseFloat(v.String(), 64); err == nil {
return reflect.ValueOf(n), true
}
return v, false
default:
return v, false
}
}
func newSlicePath(path []PathStep, index int) []PathStep {
next := make([]PathStep, len(path))
copy(next, path)
next = append(next, PathStep{
Type: SliceIndexPathStep,
SliceIndex: index,
})
return next
}
func newMapPath(path []PathStep, index string) []PathStep {
next := make([]PathStep, len(path))
copy(next, path)
next = append(next, PathStep{
Type: MapIndexPathStep,
MapIndex: index,
})
return next
}
func (d *differ) addNode(path []PathStep, tx, ty reflect.Type, vx, vy reflect.Value) {
if len(d.ignoredPaths) > 0 {
pathString := makePathString(path)
if d.isIgnoredPath(pathString) {
return
}
nvx := d.ignoredValue(vx, pathString)
nvy := d.ignoredValue(vy, pathString)
d.result.addNode(path, tx, ty, nvx, nvy)
return
}
d.result.addNode(path, tx, ty, vx, vy)
}
func (d *differ) ignoredValue(v reflect.Value, prefix string) reflect.Value {
switch v.Kind() {
case reflect.Map:
nv := reflect.MakeMap(v.Type())
keys := v.MapKeys()
for _, k := range keys {
nprefix := prefix + "." + k.String()
if d.isIgnoredPath(nprefix) {
continue
}
sub := v.MapIndex(k)
filtered := d.ignoredValue(sub, nprefix)
if !filtered.IsValid() {
continue
}
nv.SetMapIndex(k, filtered)
}
return nv
case reflect.Slice, reflect.Array:
nv := reflect.MakeSlice(v.Type(), 0, 0)
for i := 0; i < v.Len(); i++ {
nprefix := prefix + "." + strconv.Itoa(i)
if d.isIgnoredPath(nprefix) {
continue
}
filtered := d.ignoredValue(v.Index(i), nprefix)
if !filtered.IsValid() {
continue
}
nv = reflect.Append(nv, filtered)
}
return nv
case reflect.Interface:
nprefix := prefix + "." + v.String()
if d.isIgnoredPath(nprefix) {
return reflect.New(v.Type())
}
return d.ignoredValue(v.Elem(), prefix)
case reflect.String:
return v
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64,
reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64:
return v
case reflect.Float32, reflect.Float64:
return v
default:
nprefix := prefix + "." + v.String()
if d.isIgnoredPath(nprefix) {
return reflect.New(v.Type())
}
return v
}
}
func (d *differ) isIgnoredPath(pathString string) bool {
var pathSubStr string
pathElms := strings.Split(pathString, ".")
for i, path := range pathElms {
if i != 0 {
pathSubStr += "."
}
pathSubStr += path
if _, found := d.ignoredPaths[pathSubStr]; found {
return true
}
}
return false
}