-
Notifications
You must be signed in to change notification settings - Fork 0
/
merge.go
76 lines (65 loc) · 1.21 KB
/
merge.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
package main
import "reflect"
type arrayStrategy string
const (
ReplaceStrategy arrayStrategy = "replace"
ExtendStrategy arrayStrategy = "extend"
MergeStrategy arrayStrategy = "merge"
)
func ZipLongest(a, b []any) [][2]any {
var z [][2]any
for i := 0; i < len(a) || i < len(b); i++ {
var pair [2]any
pair[0] = nil
pair[1] = nil
if i < len(a) {
pair[0] = a[i]
}
if i < len(b) {
pair[1] = b[i]
}
z = append(z, pair)
}
return z
}
func Merge(a, b any, strategy arrayStrategy) any {
if a == nil {
return b
}
if b == nil {
return a
}
aType := reflect.TypeOf(a)
bType := reflect.TypeOf(b)
if aType != bType {
return b
}
switch aType.Kind() {
case reflect.Map:
ma := a.(map[string]any)
mb := b.(map[string]any)
for k, v := range mb {
ma[k] = Merge(ma[k], v, strategy)
}
return ma
case reflect.Slice:
sa := a.([]any)
sb := b.([]any)
switch strategy {
case ReplaceStrategy:
return b
case ExtendStrategy:
return append(sa, sb...)
case MergeStrategy:
var m []any
for _, pair := range ZipLongest(sa, sb) {
m = append(m, Merge(pair[0], pair[1], strategy))
}
return m
default:
panic("unknown array merge strategy")
}
default:
return b
}
}