/
formula.go
223 lines (203 loc) · 4.96 KB
/
formula.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
// Copyright ©2020 The go-hep Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package rtree
import (
"fmt"
"reflect"
"go-hep.org/x/hep/groot/root"
)
type FormulaFunc struct {
rvars []reflect.Value
args []reflect.Value
out []reflect.Value
rfct reflect.Value // formula-created function to eval read-vars
ufct reflect.Value // user-provided function
}
func newFormulaFunc(r *Reader, branches []string, fct interface{}) (*FormulaFunc, error) {
rv := reflect.ValueOf(fct)
if rv.Kind() != reflect.Func {
return nil, fmt.Errorf("rtree: FormulaFunc expects a func")
}
if len(branches) != rv.Type().NumIn() {
return nil, fmt.Errorf("rtree: num-branches/func-arity mismatch")
}
if rv.Type().NumOut() != 1 {
// FIXME(sbinet): allow any kind of function?
return nil, fmt.Errorf("rtree: invalid number of return values")
}
rvars, missing := formulaAutoLoad(r, branches)
if len(rvars) != len(branches) {
return nil, fmt.Errorf("rtree: could not find all needed ReadVars (missing: %v)", missing)
}
for i, rvar := range rvars {
btyp := reflect.TypeOf(rvar.Value).Elem()
atyp := rv.Type().In(i)
if btyp != atyp {
return nil, fmt.Errorf(
"rtree: argument type %d mismatch: func=%T, read-var[%s]=%T",
i,
reflect.New(atyp).Elem().Interface(),
rvar.Name,
reflect.New(btyp).Elem().Interface(),
)
}
}
form := &FormulaFunc{
rvars: make([]reflect.Value, len(rvars)),
args: make([]reflect.Value, len(rvars)),
ufct: rv,
}
for i := range form.rvars {
form.args[i] = reflect.New(rv.Type().In(i)).Elem()
form.rvars[i] = reflect.ValueOf(rvars[i].Value)
}
var rfct reflect.Value
switch reflect.New(rv.Type().Out(0)).Elem().Interface().(type) {
case bool:
ufct := func() bool {
form.eval()
return form.out[0].Interface().(bool)
}
rfct = reflect.ValueOf(ufct)
case uint8:
ufct := func() uint8 {
form.eval()
return form.out[0].Interface().(uint8)
}
rfct = reflect.ValueOf(ufct)
case uint16:
ufct := func() uint16 {
form.eval()
return form.out[0].Interface().(uint16)
}
rfct = reflect.ValueOf(ufct)
case uint32:
ufct := func() uint32 {
form.eval()
return form.out[0].Interface().(uint32)
}
rfct = reflect.ValueOf(ufct)
case uint64:
ufct := func() uint64 {
form.eval()
return form.out[0].Interface().(uint64)
}
rfct = reflect.ValueOf(ufct)
case int8:
ufct := func() int8 {
form.eval()
return form.out[0].Interface().(int8)
}
rfct = reflect.ValueOf(ufct)
case int16:
ufct := func() int16 {
form.eval()
return form.out[0].Interface().(int16)
}
rfct = reflect.ValueOf(ufct)
case int32:
ufct := func() int32 {
form.eval()
return form.out[0].Interface().(int32)
}
rfct = reflect.ValueOf(ufct)
case int64:
ufct := func() int64 {
form.eval()
return form.out[0].Interface().(int64)
}
rfct = reflect.ValueOf(ufct)
case string:
ufct := func() string {
form.eval()
return form.out[0].Interface().(string)
}
rfct = reflect.ValueOf(ufct)
case root.Float16:
ufct := func() root.Float16 {
form.eval()
return form.out[0].Interface().(root.Float16)
}
rfct = reflect.ValueOf(ufct)
case float32:
ufct := func() float32 {
form.eval()
return form.out[0].Interface().(float32)
}
rfct = reflect.ValueOf(ufct)
case root.Double32:
ufct := func() root.Double32 {
form.eval()
return form.out[0].Interface().(root.Double32)
}
rfct = reflect.ValueOf(ufct)
case float64:
ufct := func() float64 {
form.eval()
return form.out[0].Float()
}
rfct = reflect.ValueOf(ufct)
default:
rfct = reflect.MakeFunc(
reflect.FuncOf(nil, []reflect.Type{rv.Type().Out(0)}, false),
func(in []reflect.Value) []reflect.Value {
form.eval()
return form.out
},
)
}
form.rfct = rfct
return form, nil
}
func (form *FormulaFunc) eval() {
for i, rvar := range form.rvars {
form.args[i].Set(rvar.Elem())
}
form.out = form.ufct.Call(form.args)
}
func (form *FormulaFunc) Eval() interface{} {
form.eval()
return form.out[0].Interface()
}
func (form *FormulaFunc) Func() interface{} {
return form.rfct.Interface()
}
var (
_ formula = (*FormulaFunc)(nil)
)
func formulaAutoLoad(r *Reader, idents []string) ([]*ReadVar, []string) {
var (
loaded = make(map[string]*ReadVar, len(r.rvars))
needed = make([]*ReadVar, 0, len(idents))
rvars = NewReadVars(r.tree)
all = make(map[string]*ReadVar, len(rvars))
missing []string
)
for i := range r.rvars {
rvar := &r.rvars[i]
loaded[rvar.Name] = rvar
all[rvar.Name] = rvar
}
for i := range rvars {
rvar := &rvars[i]
if _, ok := all[rvar.Name]; ok {
continue
}
all[rvar.Name] = rvar
}
for _, name := range idents {
rvar, ok := all[name]
if !ok {
missing = append(missing, name)
continue
}
if _, ok := loaded[name]; !ok {
r.rvars = append(r.rvars, *rvar)
rvar = &r.rvars[len(r.rvars)-1]
loaded[name] = rvar
}
needed = append(needed, rvar)
}
return needed, missing
}