/
deep.go
207 lines (163 loc) · 3.6 KB
/
deep.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
package anyx
import "reflect"
func deepValueEqual(v1, v2 reflect.Value) bool {
if !v1.IsValid() || !v2.IsValid() {
return v1.IsValid() == v2.IsValid()
}
if v1.Type() != v2.Type() {
return false
}
switch v1.Kind() {
case reflect.Map:
if v1.IsNil() || v2.IsNil() {
return v1.IsNil() == v2.IsNil()
}
if v1.Len() != v2.Len() {
return false
}
if v1.UnsafePointer() == v2.UnsafePointer() {
return true
}
for _, k := range v1.MapKeys() {
val1 := v1.MapIndex(k)
val2 := v2.MapIndex(k)
if !val1.IsValid() || !val2.IsValid() || !deepValueEqual(val1, val2) {
return false
}
}
return true
case reflect.Slice:
if v1.IsNil() != v2.IsNil() {
return false
}
if v1.Len() != v2.Len() {
return false
}
if v1.UnsafePointer() == v2.UnsafePointer() {
return true
}
for i := 0; i < v1.Len(); i++ {
if !deepValueEqual(v1.Index(i), v2.Index(i)) {
return false
}
}
return true
case reflect.Ptr:
if v1.IsNil() || v2.IsNil() {
return v1.IsNil() == v2.IsNil()
}
return deepValueEqual(v1.Elem(), v2.Elem())
case reflect.Array:
if v1.UnsafePointer() == v2.UnsafePointer() {
return true
}
for i := 0; i < v1.Len(); i++ {
if !deepValueEqual(v1.Index(i), v2.Index(i)) {
return false
}
}
return true
case reflect.Struct:
for i := 0; i < v1.NumField(); i++ {
if !deepValueEqual(v1.Field(i), v2.Field(i)) {
return false
}
}
return true
case reflect.Interface:
if v1.IsNil() || v2.IsNil() {
return v1.IsNil() == v2.IsNil()
}
return deepValueEqual(v1.Elem(), v2.Elem())
default:
return v1.Interface() == v2.Interface()
}
}
func DeepEqual[M any](x, y M) bool {
v1 := reflect.ValueOf(x)
v2 := reflect.ValueOf(y)
return deepValueEqual(v1, v2)
}
func deepCopyValue(v1, v2 reflect.Value) {
if !v1.IsValid() || !v2.IsValid() {
return
}
if v1.Type() != v2.Type() {
return
}
switch v1.Kind() {
case reflect.Map:
if v1.IsNil() || v2.IsNil() {
v2.Set(v1)
return
}
if v1.UnsafePointer() == v2.UnsafePointer() {
return
}
v2.Set(reflect.MakeMap(v1.Type()))
for _, k := range v1.MapKeys() {
val1 := v1.MapIndex(k)
val2 := reflect.New(v2.Type().Elem()).Elem()
deepCopyValue(val1, val2)
v2.SetMapIndex(k, val2)
}
case reflect.Slice:
if v1.IsNil() || v2.IsNil() {
v2.Set(v1)
return
}
if v1.UnsafePointer() == v2.UnsafePointer() {
return
}
v2.Set(reflect.MakeSlice(v1.Type(), v1.Len(), v1.Len()))
for i := 0; i < v1.Len(); i++ {
val1 := v1.Index(i)
val2 := reflect.New(v2.Type().Elem()).Elem()
deepCopyValue(val1, val2)
v2.Index(i).Set(val2)
}
case reflect.Ptr:
if v1.IsNil() || v2.IsNil() {
v2.Set(v1)
return
}
if v1.UnsafePointer() == v2.UnsafePointer() {
return
}
val2 := reflect.New(v2.Type().Elem()).Elem()
deepCopyValue(v1.Elem(), val2)
v2.Elem().Set(val2)
case reflect.Array:
if v1.UnsafePointer() == v2.UnsafePointer() {
return
}
for i := 0; i < v1.Len(); i++ {
val1 := v1.Index(i)
val2 := reflect.New(v2.Type().Elem()).Elem()
deepCopyValue(val1, val2)
v2.Index(i).Set(val2)
}
case reflect.Struct:
for i := 0; i < v1.NumField(); i++ {
val1 := v1.Field(i)
val2 := reflect.New(v2.Field(i).Type()).Elem()
deepCopyValue(val1, val2)
v2.Field(i).Set(val2)
}
case reflect.Interface:
if v1.IsNil() || v2.IsNil() {
v2.Set(v1)
return
}
val2 := reflect.New(v2.Elem().Type()).Elem()
deepCopyValue(v1.Elem(), val2)
v2.Elem().Set(val2)
default:
v2.Set(v1)
}
}
func DeepCopy[M any](src, dst M) {
v1 := reflect.ValueOf(src)
v2 := reflect.ValueOf(dst)
deepCopyValue(v1, v2)
}