/
collect.go
193 lines (164 loc) · 6.44 KB
/
collect.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
package sexp
import "reflect"
type Collectable interface {
Collect(f interface{}) (r interface{}, ok bool)
}
func makeContainer(container interface{}) (r interface{}) {
switch c := reflect.ValueOf(container); c.Kind() {
case reflect.Slice: r = reflect.MakeSlice(c.Type(), c.Len(), c.Len()).Interface()
case reflect.Map: r = reflect.MakeMap(c.Type()).Interface()
case reflect.Chan: r = reflect.MakeChan(c.Type(), c.Len()).Interface()
}
return
}
func collectIndexable(container Indexable, t interface{}) (r interface{}, ok bool) {
c := makeContainer(container).(Indexable)
end := c.Len()
switch t := t.(type) {
case func(interface{}) interface{}: for i := 0; i < end; i++ {
c.Set(i, t(container.At(i)))
}
ok = true
case func(int, interface{}) interface{}: for i := 0; i < end; i++ {
c.Set(i, t(i, container.At(i)))
}
ok = true
case func(interface{}, interface{}) interface{}: for i := 0; i < end; i++ {
c.Set(i, t(i, container.At(i)))
}
ok = true
default: if t := reflect.ValueOf(t); t.Kind() == reflect.Func {
switch t.Type().NumIn() {
case 1: for i := 0; i < end; i++ {
c.Set(i, t.Call(valueslice(container.At(i)))[0].Interface())
}
ok = true
case 2: for i := 0; i < end; i++ {
c.Set(i, t.Call(valueslice(i, container.At(i)))[0].Interface())
}
ok = true
}
}
}
if ok {
r = c
}
return
}
func collectMappable(container Mappable, f interface{}) (r interface{}, ok bool) {
switch f := f.(type) {
case func(interface{}) interface{}: if c, allocated := makeContainer(container).(Mappable); allocated {
for _, v := range container.Keys() {
c.Set(v, f(container.At(v)))
}
r, ok = c, true
}
case func(interface{}, interface{}) interface{}: if c, allocated := makeContainer(container).(Mappable); allocated {
for _, v := range container.Keys() {
c.Set(v, f(v, container.At(v)))
}
r, ok = c, true
}
default: if c, allocated := makeContainer(container).(Mappable); allocated {
if f := reflect.ValueOf(f); f.Kind() == reflect.Func {
switch f.Type().NumIn() {
case 1: for _, v := range container.Keys() {
c.Set(v, f.Call(valueslice(container.At(v))))
}
r, ok = c, true
case 2: for _, v := range container.Keys() {
c.Set(v, f.Call(valueslice(v, container.At(v))))
}
r, ok = c, true
}
}
}
}
return
}
func collectSlice(s reflect.Value, f interface{}) (r interface{}, ok bool) {
end := s.Len()
switch f := f.(type) {
case func(interface{}) interface{}: c := reflect.MakeSlice(s.Type(), end, end)
for i := 0; i < end; i++ {
c.Index(i).Set(reflect.ValueOf(f(s.Index(i).Interface())))
}
r = c.Interface()
ok = true
case func(int, interface{}) interface{}: c := reflect.MakeSlice(s.Type(), end, end)
for i := 0; i < end; i++ {
c.Index(i).Set(reflect.ValueOf(f(i, s.Index(i).Interface())))
}
r = c.Interface()
ok = true
case func(interface{}, interface{}) interface{}: c := reflect.MakeSlice(s.Type(), end, end)
for i := 0; i < end; i++ {
c.Index(i).Set(reflect.ValueOf(f(i, s.Index(i).Interface())))
}
r = c.Interface()
ok = true
default: if f := reflect.ValueOf(f); f.Kind() == reflect.Func {
end := s.Len()
c := reflect.MakeSlice(s.Type(), end, end)
switch f.Type().NumIn() {
case 1: for i := 0; i < end; i++ {
c.Index(i).Set(f.Call([]reflect.Value{ s.Index(i) })[0])
}
ok = true
case 2: for i := 0; i < end; i++ {
c.Index(i).Set(f.Call([]reflect.Value{ reflect.ValueOf(i), s.Index(i) })[0])
}
ok = true
}
if ok {
r = c.Interface()
}
}
}
return
}
func collectMap(m reflect.Value, f interface{}) (r interface{}, ok bool) {
switch f := f.(type) {
case func(interface{}) interface{}: c := reflect.MakeMap(m.Type())
for iter := m.MapRange(); iter.Next(); {
c.SetMapIndex(iter.Key(), reflect.ValueOf(f(iter.Value().Interface())))
}
r = c.Interface()
ok = true
case func(interface{}, interface{}) interface{}: c := reflect.MakeMap(m.Type())
for iter := m.MapRange(); iter.Next(); {
c.SetMapIndex(iter.Key(), reflect.ValueOf(f(iter.Key().Interface(), iter.Value().Interface())))
}
r = c.Interface()
ok = true
default: if f := reflect.ValueOf(f); f.Kind() == reflect.Func {
c := reflect.MakeMap(m.Type())
switch f.Type().NumIn() {
case 1: for iter := m.MapRange(); iter.Next(); {
c.SetMapIndex(iter.Key(), f.Call([]reflect.Value{ iter.Value() })[0])
}
ok = true
case 2: for iter := m.MapRange(); iter.Next(); {
c.SetMapIndex(iter.Key(), f.Call([]reflect.Value{ iter.Key(), iter.Value() })[0])
}
ok = true
}
if ok {
r = c.Interface()
}
}
}
return
}
func Collect(container interface{}, f interface{}) (r interface{}, ok bool) {
switch container := container.(type) {
case Collectable: r, ok = container.Collect(f)
case Indexable: r, ok = collectIndexable(container, f)
case Mappable: r, ok = collectMappable(container, f)
default: switch c := reflect.ValueOf(container); c.Kind() {
case reflect.Slice: r, ok = collectSlice(c, f)
case reflect.Map: r, ok = collectMap(c, f)
}
}
return
}