/
rarrow.go
369 lines (340 loc) · 9.02 KB
/
rarrow.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
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
// Copyright ©2019 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 rarrow handles conversion between ROOT and ARROW data models.
package rarrow // import "go-hep.org/x/hep/groot/rarrow"
import (
"fmt"
"reflect"
"strings"
"github.com/apache/arrow/go/arrow"
"github.com/apache/arrow/go/arrow/array"
"github.com/apache/arrow/go/arrow/memory"
"go-hep.org/x/hep/groot/root"
"go-hep.org/x/hep/groot/rtree"
)
// SchemaFrom returns an Arrow schema from the provided ROOT tree.
func SchemaFrom(t rtree.Tree) *arrow.Schema {
fields := make([]arrow.Field, len(t.Branches()))
for i, b := range t.Branches() {
fields[i] = fieldFromBranch(b)
}
return arrow.NewSchema(fields, nil) // FIXME(sbinet): add metadata.
}
func fieldFromBranch(b rtree.Branch) arrow.Field {
fields := make([]arrow.Field, len(b.Leaves()))
for i, leaf := range b.Leaves() {
fields[i] = arrow.Field{
Name: leaf.Name(),
Type: dataTypeFromLeaf(leaf),
}
}
if len(fields) == 1 {
fields[0].Name = b.Name()
return fields[0]
}
return arrow.Field{
Name: b.Name(),
Type: arrow.StructOf(fields...),
}
}
func dataTypeFromLeaf(leaf rtree.Leaf) arrow.DataType {
var (
unsigned = leaf.IsUnsigned()
kind = leaf.Kind()
typ = leaf.Type()
dt arrow.DataType
)
switch kind {
case reflect.Bool:
dt = arrow.FixedWidthTypes.Boolean
case reflect.Int8:
switch {
case unsigned:
dt = arrow.PrimitiveTypes.Uint8
default:
dt = arrow.PrimitiveTypes.Int8
}
case reflect.Int16:
switch {
case unsigned:
dt = arrow.PrimitiveTypes.Uint16
default:
dt = arrow.PrimitiveTypes.Int16
}
case reflect.Int32:
switch {
case unsigned:
dt = arrow.PrimitiveTypes.Uint32
default:
dt = arrow.PrimitiveTypes.Int32
}
case reflect.Int64:
switch {
case unsigned:
dt = arrow.PrimitiveTypes.Uint64
default:
dt = arrow.PrimitiveTypes.Int64
}
case reflect.Float32:
dt = arrow.PrimitiveTypes.Float32
case reflect.Float64:
dt = arrow.PrimitiveTypes.Float64
case reflect.String:
dt = arrow.BinaryTypes.String
case reflect.Struct:
dt = dataTypeFromGo(typ)
case reflect.Slice:
dt = dataTypeFromGo(typ)
default:
panic(fmt.Errorf("not implemented %#v (kind=%v)", leaf, kind))
}
switch {
case leaf.LeafCount() != nil:
dt = arrow.ListOf(dt)
case leaf.Len() > 1:
switch leaf.Kind() {
case reflect.String:
switch dims := leaf.ArrayDim(); dims {
case 0, 1:
// interpret as a single string
default:
// FIXME(sbinet): properly handle [N]string (but ROOT doesn't support that.)
// see: https://root-forum.cern.ch/t/char-t-in-a-branch/5591/2
// etype = reflect.ArrayOf(leaf.Len(), etype)
panic(fmt.Errorf("groot/rtree: invalid number of dimensions (%d)", dims))
}
default:
shape := leaf.Shape()
switch leaf.(type) {
case *rtree.LeafF16, *rtree.LeafD32:
// workaround for https://sft.its.cern.ch/jira/browse/ROOT-10149
shape = []int{leaf.Len()}
}
for i := range shape {
dt = arrow.FixedSizeListOf(int32(shape[len(shape)-1-i]), dt)
}
}
}
return dt
}
func dataTypeFromGo(typ reflect.Type) arrow.DataType {
switch typ.Kind() {
case reflect.Bool:
return arrow.FixedWidthTypes.Boolean
case reflect.Int8:
return arrow.PrimitiveTypes.Int8
case reflect.Int16:
return arrow.PrimitiveTypes.Int16
case reflect.Int32:
return arrow.PrimitiveTypes.Int32
case reflect.Int64:
return arrow.PrimitiveTypes.Int64
case reflect.Uint8:
return arrow.PrimitiveTypes.Uint8
case reflect.Uint16:
return arrow.PrimitiveTypes.Uint16
case reflect.Uint32:
return arrow.PrimitiveTypes.Uint32
case reflect.Uint64:
return arrow.PrimitiveTypes.Uint64
case reflect.Float32:
return arrow.PrimitiveTypes.Float32
case reflect.Float64:
return arrow.PrimitiveTypes.Float64
case reflect.Slice:
// special case []byte
if typ.Elem().Kind() == reflect.Uint8 {
return arrow.BinaryTypes.Binary
}
return arrow.ListOf(dataTypeFromGo(typ.Elem()))
case reflect.Array:
return arrow.FixedSizeListOf(int32(typ.Len()), dataTypeFromGo(typ.Elem()))
case reflect.String:
return arrow.BinaryTypes.String
case reflect.Struct:
fields := make([]arrow.Field, typ.NumField())
for i := range fields {
f := typ.Field(i)
name := f.Name
if v, ok := f.Tag.Lookup("groot"); ok {
name = v
}
if idx := strings.Index(name, "["); idx > 0 {
name = name[:idx]
}
fields[i] = arrow.Field{
Name: name,
Type: dataTypeFromGo(f.Type),
}
}
return arrow.StructOf(fields...)
default:
panic(fmt.Errorf("rarrow: unsupported Go type %v", typ))
}
}
func builderFrom(mem memory.Allocator, dt arrow.DataType, size int64) array.Builder {
var bldr array.Builder
switch dt := dt.(type) {
case *arrow.BooleanType:
bldr = array.NewBooleanBuilder(mem)
case *arrow.Int8Type:
bldr = array.NewInt8Builder(mem)
case *arrow.Int16Type:
bldr = array.NewInt16Builder(mem)
case *arrow.Int32Type:
bldr = array.NewInt32Builder(mem)
case *arrow.Int64Type:
bldr = array.NewInt64Builder(mem)
case *arrow.Uint8Type:
bldr = array.NewUint8Builder(mem)
case *arrow.Uint16Type:
bldr = array.NewUint16Builder(mem)
case *arrow.Uint32Type:
bldr = array.NewUint32Builder(mem)
case *arrow.Uint64Type:
bldr = array.NewUint64Builder(mem)
case *arrow.Float32Type:
bldr = array.NewFloat32Builder(mem)
case *arrow.Float64Type:
bldr = array.NewFloat64Builder(mem)
case *arrow.BinaryType:
bldr = array.NewBinaryBuilder(mem, dt)
case *arrow.StringType:
bldr = array.NewStringBuilder(mem)
case *arrow.ListType:
bldr = array.NewListBuilder(mem, dt.Elem())
case *arrow.FixedSizeListType:
bldr = array.NewFixedSizeListBuilder(mem, dt.Len(), dt.Elem())
case *arrow.StructType:
bldr = array.NewStructBuilder(mem, dt)
default:
panic(fmt.Errorf("groot/rarrow: invalid Arrow type %v", dt))
}
bldr.Reserve(int(size))
return bldr
}
func appendData(bldr array.Builder, v rtree.ReadVar, dt arrow.DataType) {
switch bldr := bldr.(type) {
case *array.BooleanBuilder:
bldr.Append(*v.Value.(*bool))
case *array.Int8Builder:
bldr.Append(*v.Value.(*int8))
case *array.Int16Builder:
bldr.Append(*v.Value.(*int16))
case *array.Int32Builder:
bldr.Append(*v.Value.(*int32))
case *array.Int64Builder:
bldr.Append(*v.Value.(*int64))
case *array.Uint8Builder:
bldr.Append(*v.Value.(*uint8))
case *array.Uint16Builder:
bldr.Append(*v.Value.(*uint16))
case *array.Uint32Builder:
bldr.Append(*v.Value.(*uint32))
case *array.Uint64Builder:
bldr.Append(*v.Value.(*uint64))
case *array.Float32Builder:
switch ptr := v.Value.(type) {
case *float32:
bldr.Append(*ptr)
case *root.Float16:
bldr.Append(float32(*ptr))
}
case *array.Float64Builder:
switch ptr := v.Value.(type) {
case *float64:
bldr.Append(*ptr)
case *root.Double32:
bldr.Append(float64(*ptr))
}
case *array.StringBuilder:
bldr.Append(*v.Value.(*string))
case *array.ListBuilder:
sub := bldr.ValueBuilder()
v := reflect.ValueOf(v.Value).Elem()
sub.Reserve(v.Len())
bldr.Append(true)
for i := 0; i < v.Len(); i++ {
appendValue(sub, v.Index(i).Interface())
}
case *array.FixedSizeListBuilder:
sub := bldr.ValueBuilder()
v := reflect.ValueOf(v.Value).Elem()
sub.Reserve(v.Len())
bldr.Append(true)
for i := 0; i < v.Len(); i++ {
appendValue(sub, v.Index(i).Interface())
}
case *array.StructBuilder:
bldr.Append(true)
v := reflect.ValueOf(v.Value).Elem()
for i := 0; i < bldr.NumField(); i++ {
f := bldr.FieldBuilder(i)
appendValue(f, v.Field(i).Interface())
}
default:
panic(fmt.Errorf("groot/rarrow: invalid Arrow builder type %T", bldr))
}
}
func appendValue(bldr array.Builder, v interface{}) {
switch b := bldr.(type) {
case *array.BooleanBuilder:
b.Append(v.(bool))
case *array.Int8Builder:
b.Append(v.(int8))
case *array.Int16Builder:
b.Append(v.(int16))
case *array.Int32Builder:
b.Append(v.(int32))
case *array.Int64Builder:
b.Append(v.(int64))
case *array.Uint8Builder:
b.Append(v.(uint8))
case *array.Uint16Builder:
b.Append(v.(uint16))
case *array.Uint32Builder:
b.Append(v.(uint32))
case *array.Uint64Builder:
b.Append(v.(uint64))
case *array.Float32Builder:
switch v := v.(type) {
case float32:
b.Append(v)
case root.Float16:
b.Append(float32(v))
}
case *array.Float64Builder:
switch v := v.(type) {
case float64:
b.Append(v)
case root.Double32:
b.Append(float64(v))
}
case *array.StringBuilder:
b.Append(v.(string))
case *array.ListBuilder:
b.Append(true)
sub := b.ValueBuilder()
v := reflect.ValueOf(v)
for i := 0; i < v.Len(); i++ {
appendValue(sub, v.Index(i).Interface())
}
case *array.FixedSizeListBuilder:
b.Append(true)
sub := b.ValueBuilder()
v := reflect.ValueOf(v)
for i := 0; i < v.Len(); i++ {
appendValue(sub, v.Index(i).Interface())
}
case *array.StructBuilder:
b.Append(true)
v := reflect.ValueOf(v)
for i := 0; i < b.NumField(); i++ {
f := b.FieldBuilder(i)
appendValue(f, v.Field(i).Interface())
}
default:
panic(fmt.Errorf("groot/rarrow: invalid Arrow builder type %T", b))
}
}