-
Notifications
You must be signed in to change notification settings - Fork 1
/
reflect.go
234 lines (215 loc) · 5.19 KB
/
reflect.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
package utils
import (
"container/list"
"reflect"
"regexp"
"strings"
"gorm.io/gorm/schema"
)
// IsBlank gets whether the specified object is considered empty or not.
// fork from: github.com/stretchr/testify@v1.8.0/assert/assertions.go
func IsBlank(object any) bool {
// get nil case out of the way
if object == nil {
return true
}
objVal, ok := object.(reflect.Value)
if !ok {
objVal = reflect.ValueOf(object)
}
switch objVal.Kind() {
// collection types are empty when they have no element
case reflect.Chan, reflect.Map, reflect.Slice:
return objVal.Len() == 0
// pointers are empty if nil or if the value they point to is empty
case reflect.Ptr:
if objVal.IsNil() {
return true
}
deref := objVal.Elem().Interface()
return IsBlank(deref)
// for all other types, compare against the zero value
// array types are empty when they match their zero-initialized state
default:
zero := reflect.Zero(objVal.Type())
return reflect.DeepEqual(objVal.Interface(), zero.Interface())
}
}
func TraverseValue(data any, indirect bool, handler func(reflect.StructField, reflect.Value) (end, stepIn bool)) {
v, ok := data.(reflect.Value)
if !ok {
v = reflect.ValueOf(data)
}
v = IndirectValue(v)
l := list.New()
l.PushBack(v)
TraverseStruct:
for l.Len() > 0 {
e := IndirectValue(l.Remove(l.Front()).(reflect.Value))
if !e.IsValid() {
continue
}
t := IndirectType(e.Type())
switch e.Kind() {
case reflect.Array, reflect.Slice:
for i, num := 0, e.Len(); i < num; i++ {
l.PushBack(e.Index(i))
}
case reflect.Map:
for iter := e.MapRange(); iter.Next(); {
l.PushBack(iter.Key())
l.PushBack(iter.Value())
}
case reflect.Struct:
for i, num := 0, e.NumField(); i < num; i++ {
ff := t.Field(i)
fv := e.Field(i)
if !fv.IsValid() {
continue
}
if indirect {
fv = IndirectValue(fv)
ff.Type = IndirectType(ff.Type)
}
end, stepIn := handler(ff, fv)
if end {
break TraverseStruct
}
if stepIn {
l.PushBack(fv)
}
}
default:
// do nothing
}
}
}
func GetFieldByTag(data any, tag, key string) (r reflect.Value, e error) {
TraverseValue(data, true, func(field reflect.StructField, value reflect.Value) (end, stepIn bool) {
if !value.IsValid() {
return false, false
}
if value.Type().Kind() == reflect.Struct {
return false, true
}
tagV := field.Tag.Get(tag)
if tagV == key {
r = value
end = true
return
}
return
})
return
}
func GetFieldByTagWithKeys(data any, tag string, keys []string) (r reflect.Value, e error) {
keySet := NewSet[string](keys...)
TraverseValue(data, true, func(field reflect.StructField, value reflect.Value) (end, stepIn bool) {
if !value.IsValid() {
return false, false
}
if value.Type().Kind() == reflect.Struct {
return false, true
}
if keySet.Contains(field.Tag.Get(tag)) {
r = value
end = true
return
}
return
})
return
}
func GetFieldTagValue(data any, tag string, pattern *regexp.Regexp) (tagValue string, e error) {
TraverseValue(data, true, func(field reflect.StructField, value reflect.Value) (end, stepIn bool) {
if !value.IsValid() {
return false, false
}
if value.Type().Kind() == reflect.Struct {
return false, true
}
tagV := field.Tag.Get(tag)
if pattern.Match([]byte(tagV)) {
tagValue = tagV
end = true
return
}
return
})
return
}
func GetGormColumnValue(data any, column string) (columnVal reflect.Value, ok bool) {
tagKey := strings.ToUpper(column)
TraverseValue(data, true, func(field reflect.StructField, value reflect.Value) (end, stepIn bool) {
if !value.IsValid() {
return false, false
}
if value.Type().Kind() == reflect.Struct {
return false, true
}
tagSetting := schema.ParseTagSetting(field.Tag.Get("gorm"), ";")
if _, ok := tagSetting[tagKey]; ok || tagSetting["COLUMN"] == column {
columnVal = value
end = true
return
}
return
})
return
}
// EmbedsType Returns true if t embeds e or if any of the types embedded by t embed e.
// Forked from go.uber.org/dig@v1.16.1/inout.embedsType
func EmbedsType(i any, e reflect.Type) bool {
// given `type A foo { *In }`, this function would return false for
// embedding dig.In, which makes for some extra error checking in places
// that call this function. Might be worthwhile to consider reflect.Indirect
// usage to clean up the callers.
if i == nil {
return false
}
// maybe it's already a reflect.Type
t, ok := i.(reflect.Type)
if !ok {
// take the type if it's not
t = IndirectType(reflect.TypeOf(i))
}
// We are going to do a breadth-first search of all embedded fields.
types := list.New()
types.PushBack(t)
for types.Len() > 0 {
t := types.Remove(types.Front()).(reflect.Type)
if t == e {
return true
}
if t.Kind() != reflect.Struct {
continue
}
for i := 0; i < t.NumField(); i++ {
f := t.Field(i)
if f.Anonymous {
types.PushBack(f.Type)
}
}
}
return false
}
func IndirectValue(s reflect.Value) (d reflect.Value) {
if !s.IsValid() {
return s
}
d = s
for d.Kind() == reflect.Ptr {
d = d.Elem()
}
return
}
func IndirectType(s reflect.Type) (d reflect.Type) {
if s == nil {
return s
}
d = s
for d.Kind() == reflect.Ptr {
d = d.Elem()
}
return
}