-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrecode.go
77 lines (66 loc) · 1.27 KB
/
recode.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
package recode
import (
"reflect"
)
type AnyRebuilder[T any] interface {
RebuildByType(param T) error
}
func deepIndirect(rv reflect.Value) reflect.Value {
for rv.Kind() == reflect.Ptr {
rv = reflect.Indirect(rv)
}
return rv
}
func RecursiveRebuild[T any](v any, param T) error {
return recursiveRebuild[T](reflect.ValueOf(v), param)
}
func rebuild[T any](rv reflect.Value, param T) error {
if !rv.CanAddr() {
return nil
}
rva := rv.Addr()
if !rva.CanInterface() {
return nil
}
rvi := rva.Interface()
v, ok := rvi.(AnyRebuilder[T])
if ok {
err := v.RebuildByType(param)
if err != nil {
return err
}
}
return nil
}
func recursiveRebuild[T any](rv reflect.Value, param T) error {
rv = deepIndirect(rv)
err := rebuild[T](rv, param)
if err != nil {
return err
}
switch rv.Kind() {
case reflect.Struct:
typ := rv.Type()
for i := 0; i < typ.NumField(); i++ {
err := recursiveRebuild[T](rv.Field(i), param)
if err != nil {
return err
}
}
case reflect.Map:
it := rv.MapRange()
for it.Next() {
recursiveRebuild[T](it.Value(), param)
}
case reflect.Array:
fallthrough
case reflect.Slice:
for i := 0; i < rv.Len(); i++ {
err := recursiveRebuild[T](rv.Index(i), param)
if err != nil {
return err
}
}
}
return nil
}