-
Notifications
You must be signed in to change notification settings - Fork 3.4k
/
random_array_gen.go
594 lines (514 loc) · 18.9 KB
/
random_array_gen.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
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package gen
import (
"math"
"github.com/apache/arrow/go/v16/arrow"
"github.com/apache/arrow/go/v16/arrow/array"
"github.com/apache/arrow/go/v16/arrow/bitutil"
"github.com/apache/arrow/go/v16/arrow/internal/debug"
"github.com/apache/arrow/go/v16/arrow/memory"
"golang.org/x/exp/rand"
"gonum.org/v1/gonum/stat/distuv"
)
// RandomArrayGenerator is a struct used for constructing Random Arrow arrays
// for use with testing.
type RandomArrayGenerator struct {
seed uint64
extra uint64
src rand.Source
seedRand *rand.Rand
mem memory.Allocator
}
// NewRandomArrayGenerator constructs a new generator with the requested Seed
func NewRandomArrayGenerator(seed uint64, mem memory.Allocator) RandomArrayGenerator {
src := rand.NewSource(seed)
return RandomArrayGenerator{seed, 0, src, rand.New(src), mem}
}
// GenerateBitmap generates a bitmap of n bits and stores it into buffer. Prob is the probability
// that a given bit will be zero, with 1-prob being the probability it will be 1. The return value
// is the number of bits that were left unset. The assumption being that buffer is currently
// zero initialized as this function does not clear any bits, it only sets 1s.
func (r *RandomArrayGenerator) GenerateBitmap(buffer []byte, n int64, prob float64) int64 {
count := int64(0)
r.extra++
// bernoulli distribution uses P to determine the probability of a 0 or a 1,
// which we'll use to generate the bitmap.
dist := distuv.Bernoulli{P: 1 - prob, Src: rand.NewSource(r.seed + r.extra)}
for i := 0; int64(i) < n; i++ {
if dist.Rand() != float64(0.0) {
bitutil.SetBit(buffer, i)
} else {
count++
}
}
return count
}
func (r *RandomArrayGenerator) Boolean(size int64, prob, nullProb float64) arrow.Array {
buffers := make([]*memory.Buffer, 2)
nullcount := int64(0)
buffers[0] = memory.NewResizableBuffer(r.mem)
buffers[0].Resize(int(bitutil.BytesForBits(size)))
defer buffers[0].Release()
nullcount = r.GenerateBitmap(buffers[0].Bytes(), size, nullProb)
buffers[1] = memory.NewResizableBuffer(r.mem)
buffers[1].Resize(int(bitutil.BytesForBits(size)))
defer buffers[1].Release()
r.GenerateBitmap(buffers[1].Bytes(), size, prob)
data := array.NewData(arrow.FixedWidthTypes.Boolean, int(size), buffers, nil, int(nullcount), 0)
defer data.Release()
return array.NewBooleanData(data)
}
func (r *RandomArrayGenerator) baseGenPrimitive(size int64, prob float64, byteWidth int) ([]*memory.Buffer, int64) {
buffers := make([]*memory.Buffer, 2)
nullCount := int64(0)
buffers[0] = memory.NewResizableBuffer(r.mem)
buffers[0].Resize(int(bitutil.BytesForBits(size)))
nullCount = r.GenerateBitmap(buffers[0].Bytes(), size, prob)
buffers[1] = memory.NewResizableBuffer(r.mem)
buffers[1].Resize(int(size) * byteWidth)
return buffers, nullCount
}
func (r *RandomArrayGenerator) Int8(size int64, min, max int8, prob float64) arrow.Array {
buffers, nullcount := r.baseGenPrimitive(size, prob, arrow.Int8SizeBytes)
for _, b := range buffers {
defer b.Release()
}
r.extra++
dist := rand.New(rand.NewSource(r.seed + r.extra))
out := arrow.Int8Traits.CastFromBytes(buffers[1].Bytes())
for i := int64(0); i < size; i++ {
out[i] = int8(dist.Intn(int(max)-int(min+1))) + min
}
data := array.NewData(arrow.PrimitiveTypes.Int8, int(size), buffers, nil, int(nullcount), 0)
defer data.Release()
return array.NewInt8Data(data)
}
func (r *RandomArrayGenerator) Uint8(size int64, min, max uint8, prob float64) arrow.Array {
buffers, nullcount := r.baseGenPrimitive(size, prob, arrow.Uint8SizeBytes)
for _, b := range buffers {
defer b.Release()
}
r.extra++
dist := rand.New(rand.NewSource(r.seed + r.extra))
out := arrow.Uint8Traits.CastFromBytes(buffers[1].Bytes())
for i := int64(0); i < size; i++ {
out[i] = uint8(dist.Intn(int(max)-int(min)+1)) + min
}
data := array.NewData(arrow.PrimitiveTypes.Uint8, int(size), buffers, nil, int(nullcount), 0)
defer data.Release()
return array.NewUint8Data(data)
}
func (r *RandomArrayGenerator) Int16(size int64, min, max int16, prob float64) arrow.Array {
buffers, nullcount := r.baseGenPrimitive(size, prob, arrow.Int16SizeBytes)
for _, b := range buffers {
defer b.Release()
}
r.extra++
dist := rand.New(rand.NewSource(r.seed + r.extra))
out := arrow.Int16Traits.CastFromBytes(buffers[1].Bytes())
for i := int64(0); i < size; i++ {
out[i] = int16(dist.Intn(int(max)-int(min)+1)) + min
}
data := array.NewData(arrow.PrimitiveTypes.Int16, int(size), buffers, nil, int(nullcount), 0)
defer data.Release()
return array.NewInt16Data(data)
}
func (r *RandomArrayGenerator) Uint16(size int64, min, max uint16, prob float64) arrow.Array {
buffers, nullcount := r.baseGenPrimitive(size, prob, arrow.Uint16SizeBytes)
for _, b := range buffers {
defer b.Release()
}
r.extra++
dist := rand.New(rand.NewSource(r.seed + r.extra))
out := arrow.Uint16Traits.CastFromBytes(buffers[1].Bytes())
for i := int64(0); i < size; i++ {
out[i] = uint16(dist.Intn(int(max)-int(min)+1)) + min
}
data := array.NewData(arrow.PrimitiveTypes.Uint16, int(size), buffers, nil, int(nullcount), 0)
defer data.Release()
return array.NewUint16Data(data)
}
func (r *RandomArrayGenerator) Int32(size int64, min, max int32, prob float64) arrow.Array {
buffers, nullcount := r.baseGenPrimitive(size, prob, arrow.Int32SizeBytes)
for _, b := range buffers {
defer b.Release()
}
r.extra++
dist := rand.New(rand.NewSource(r.seed + r.extra))
out := arrow.Int32Traits.CastFromBytes(buffers[1].Bytes())
for i := int64(0); i < size; i++ {
out[i] = int32(dist.Intn(int(max)-int(min)+1)) + min
}
data := array.NewData(arrow.PrimitiveTypes.Int32, int(size), buffers, nil, int(nullcount), 0)
defer data.Release()
return array.NewInt32Data(data)
}
func (r *RandomArrayGenerator) Uint32(size int64, min, max uint32, prob float64) arrow.Array {
buffers, nullcount := r.baseGenPrimitive(size, prob, arrow.Uint32SizeBytes)
for _, b := range buffers {
defer b.Release()
}
r.extra++
dist := rand.New(rand.NewSource(r.seed + r.extra))
out := arrow.Uint32Traits.CastFromBytes(buffers[1].Bytes())
for i := int64(0); i < size; i++ {
out[i] = uint32(dist.Uint64n(uint64(max)-uint64(min)+1)) + min
}
data := array.NewData(arrow.PrimitiveTypes.Uint32, int(size), buffers, nil, int(nullcount), 0)
defer data.Release()
return array.NewUint32Data(data)
}
func (r *RandomArrayGenerator) Int64(size int64, min, max int64, prob float64) arrow.Array {
buffers, nullcount := r.baseGenPrimitive(size, prob, arrow.Int64SizeBytes)
for _, b := range buffers {
defer b.Release()
}
r.extra++
dist := rand.New(rand.NewSource(r.seed + r.extra))
out := arrow.Int64Traits.CastFromBytes(buffers[1].Bytes())
if max == math.MaxInt64 && min == math.MinInt64 {
for i := int64(0); i < size; i++ {
out[i] = int64(dist.Uint64())
}
} else {
for i := int64(0); i < size; i++ {
out[i] = dist.Int63n(max-min+1) + min
}
}
data := array.NewData(arrow.PrimitiveTypes.Int64, int(size), buffers, nil, int(nullcount), 0)
defer data.Release()
return array.NewInt64Data(data)
}
func (r *RandomArrayGenerator) Uint64(size int64, min, max uint64, prob float64) arrow.Array {
buffers, nullcount := r.baseGenPrimitive(size, prob, arrow.Uint64SizeBytes)
for _, b := range buffers {
defer b.Release()
}
r.extra++
dist := rand.New(rand.NewSource(r.seed + r.extra))
out := arrow.Uint64Traits.CastFromBytes(buffers[1].Bytes())
if max == math.MaxUint64 {
for i := int64(0); i < size; i++ {
out[i] = dist.Uint64() + min
}
} else {
for i := int64(0); i < size; i++ {
out[i] = dist.Uint64n(max-min+1) + min
}
}
data := array.NewData(arrow.PrimitiveTypes.Uint64, int(size), buffers, nil, int(nullcount), 0)
defer data.Release()
return array.NewUint64Data(data)
}
func (r *RandomArrayGenerator) Float32(size int64, min, max float32, prob float64) arrow.Array {
buffers, nullcount := r.baseGenPrimitive(size, prob, arrow.Float32SizeBytes)
for _, b := range buffers {
defer b.Release()
}
r.extra++
dist := rand.New(rand.NewSource(r.seed + r.extra))
out := arrow.Float32Traits.CastFromBytes(buffers[1].Bytes())
for i := int64(0); i < size; i++ {
out[i] = min + dist.Float32()*(max+1-min)
}
data := array.NewData(arrow.PrimitiveTypes.Float32, int(size), buffers, nil, int(nullcount), 0)
defer data.Release()
return array.NewFloat32Data(data)
}
func (r *RandomArrayGenerator) Float64(size int64, min, max float64, prob float64) arrow.Array {
buffers, nullcount := r.baseGenPrimitive(size, prob, arrow.Float64SizeBytes)
for _, b := range buffers {
defer b.Release()
}
r.extra++
dist := rand.New(rand.NewSource(r.seed + r.extra))
out := arrow.Float64Traits.CastFromBytes(buffers[1].Bytes())
for i := int64(0); i < size; i++ {
out[i] = dist.NormFloat64() + (max - min)
}
data := array.NewData(arrow.PrimitiveTypes.Float64, int(size), buffers, nil, int(nullcount), 0)
defer data.Release()
return array.NewFloat64Data(data)
}
func (r *RandomArrayGenerator) String(size int64, minLength, maxLength int, nullprob float64) arrow.Array {
lengths := r.Int32(size, int32(minLength), int32(maxLength), nullprob).(*array.Int32)
defer lengths.Release()
bldr := array.NewStringBuilder(r.mem)
defer bldr.Release()
r.extra++
dist := rand.New(rand.NewSource(r.seed + r.extra))
buf := make([]byte, 0, maxLength)
gen := func(n int32) string {
out := buf[:n]
for i := range out {
out[i] = uint8(dist.Int31n(int32('z')-int32('A')+1) + int32('A'))
}
return string(out)
}
for i := 0; i < lengths.Len(); i++ {
if lengths.IsValid(i) {
bldr.Append(gen(lengths.Value(i)))
} else {
bldr.AppendNull()
}
}
return bldr.NewArray()
}
func (r *RandomArrayGenerator) LargeString(size int64, minLength, maxLength int64, nullprob float64) arrow.Array {
lengths := r.Int64(size, minLength, maxLength, nullprob).(*array.Int64)
defer lengths.Release()
bldr := array.NewLargeStringBuilder(r.mem)
defer bldr.Release()
r.extra++
dist := rand.New(rand.NewSource(r.seed + r.extra))
buf := make([]byte, 0, maxLength)
gen := func(n int64) string {
out := buf[:n]
for i := range out {
out[i] = uint8(dist.Int63n(int64('z')-int64('A')+1) + int64('A'))
}
return string(out)
}
for i := 0; i < lengths.Len(); i++ {
if lengths.IsValid(i) {
bldr.Append(gen(lengths.Value(i)))
} else {
bldr.AppendNull()
}
}
return bldr.NewArray()
}
func (r *RandomArrayGenerator) StringView(size int64, minLength, maxLength int64, nullProb float64) arrow.Array {
return r.generateBinaryView(arrow.BinaryTypes.StringView, size, minLength, maxLength, nullProb)
}
func (r *RandomArrayGenerator) generateBinaryView(dt arrow.DataType, size int64, minLength, maxLength int64, nullProb float64) arrow.Array {
lengths := r.Int32(size, int32(minLength), int32(maxLength), nullProb).(*array.Int32)
defer lengths.Release()
bldr := array.NewBuilder(r.mem, dt).(array.StringLikeBuilder)
defer bldr.Release()
r.extra++
dist := rand.New(rand.NewSource(r.seed + r.extra))
buf := make([]byte, 0, maxLength)
gen := func(n int32) string {
out := buf[:n]
for i := range out {
out[i] = uint8(dist.Int31n(int32('z')-int32('A')+1) + int32('A'))
}
return string(out)
}
for i := 0; i < lengths.Len(); i++ {
if lengths.IsNull(i) {
bldr.AppendNull()
continue
}
bldr.Append(gen(lengths.Value(i)))
}
return bldr.NewArray()
}
func (r *RandomArrayGenerator) Numeric(dt arrow.Type, size int64, min, max int64, nullprob float64) arrow.Array {
switch dt {
case arrow.INT8:
return r.Int8(size, int8(min), int8(max), nullprob)
case arrow.UINT8:
return r.Uint8(size, uint8(min), uint8(max), nullprob)
case arrow.INT16:
return r.Int16(size, int16(min), int16(max), nullprob)
case arrow.UINT16:
return r.Uint16(size, uint16(min), uint16(max), nullprob)
case arrow.INT32:
return r.Int32(size, int32(min), int32(max), nullprob)
case arrow.UINT32:
return r.Uint32(size, uint32(min), uint32(max), nullprob)
case arrow.INT64:
return r.Int64(size, int64(min), int64(max), nullprob)
case arrow.UINT64:
return r.Uint64(size, uint64(min), uint64(max), nullprob)
case arrow.FLOAT32:
return r.Float32(size, float32(min), float32(max), nullprob)
case arrow.FLOAT64:
return r.Float64(size, float64(min), float64(max), nullprob)
}
panic("invalid type for random numeric array")
}
// Generate an array of random offsets based on a given sizes array for
// list-view arrays.
//
// Pre-condition: every non-null sizes[i] <= valuesLength.
func viewOffsetsFromLengthsArray32(
seed uint64, avgLength int32, valuesLength int32,
sizesArray *array.Int32, forceEmptyNulls bool,
zeroUndefinedOffsets bool) *memory.Buffer {
sizes := sizesArray.Int32Values()
offsets := make([]int32, sizesArray.Len())
offsetDeltaRand := rand.New(rand.NewSource(seed))
sampleOffset := func(offsetBase int32) int32 {
delta := int32(offsetDeltaRand.Int63n(2*int64(avgLength)) - int64(avgLength))
offset := offsetBase + delta
if offset < 0 {
return 0
}
return offset
}
offsetBase := int32(0)
for i := 0; i < sizesArray.Len(); i += 1 {
isNull := sizesArray.IsNull(i)
if forceEmptyNulls && isNull {
sizes[i] = 0
}
if zeroUndefinedOffsets && (isNull || sizes[i] == 0) {
offsets[i] = 0
} else {
offset := sampleOffset(offsetBase)
if offset > valuesLength-sizes[i] {
offset = valuesLength - sizes[i]
}
offsets[i] = offset
}
offsetBase += avgLength
}
return memory.NewBufferBytes(arrow.Int32Traits.CastToBytes(offsets))
}
// Generate an array of random offsets based on a given sizes array for
// large list-view arrays.
//
// Pre-condition: every non-null sizes[i] <= valuesLength.
func viewOffsetsFromLengthsArray64(
seed uint64, avgLength int64, valuesLength int64,
sizesArray *array.Int64, forceEmptyNulls bool,
zeroUndefinedOffsets bool) *memory.Buffer {
sizes := sizesArray.Int64Values()
offsets := make([]int64, sizesArray.Len())
offsetDeltaRand := rand.New(rand.NewSource(seed))
sampleOffset := func(offsetBase int64) int64 {
delta := int64(offsetDeltaRand.Int63n(2*avgLength) - avgLength)
offset := offsetBase + delta
if offset < 0 {
return 0
}
return offset
}
offsetBase := int64(0)
for i := 0; i < sizesArray.Len(); i += 1 {
isNull := sizesArray.IsNull(i)
if forceEmptyNulls && isNull {
sizes[i] = 0
}
if zeroUndefinedOffsets && (isNull || sizes[i] == 0) {
offsets[i] = 0
} else {
offset := sampleOffset(offsetBase)
if offset > valuesLength-sizes[i] {
offset = valuesLength - sizes[i]
}
offsets[i] = offset
}
offsetBase += avgLength
}
return memory.NewBufferBytes(arrow.Int64Traits.CastToBytes(offsets))
}
// Generate a random data for ListView or LargeListView arrays.
func (r *RandomArrayGenerator) genListViewData(dt arrow.VarLenListLikeType, length int64,
minLength, maxLength int, nullprob float64,
forceEmptyNulls bool, zeroUndefinedOffsets bool) arrow.ArrayData {
offsetByteWidth := dt.Layout().Buffers[1].ByteWidth
var lengths arrow.Array
if offsetByteWidth == 4 {
lengths = r.Int32(length, int32(minLength), int32(maxLength), nullprob)
} else {
lengths = r.Int64(length, int64(minLength), int64(maxLength), nullprob)
}
defer lengths.Release()
// List-views don't have to be disjoint, so let's make the valuesLength a
// multiple of the average list-view size. To make sure every list view
// into the values array can fit, it should be at least maxLength.
avgLength := minLength + (maxLength-minLength)/2
valuesLength := int64(avgLength) * (length - int64(lengths.NullN()))
if valuesLength < int64(maxLength) {
valuesLength = int64(maxLength)
}
debug.Assert(offsetByteWidth == 8 || valuesLength < math.MaxInt32,
"valuesLength must be less than math.MaxInt32")
values := r.ArrayOf(dt.Elem().ID(), int64(valuesLength), 0.0)
defer values.Release()
var offsets *memory.Buffer
if offsetByteWidth == 4 {
lengths32 := lengths.(*array.Int32)
offsets = viewOffsetsFromLengthsArray32(r.seed, int32(avgLength), int32(valuesLength), lengths32,
forceEmptyNulls, zeroUndefinedOffsets)
} else {
lengths64 := lengths.(*array.Int64)
offsets = viewOffsetsFromLengthsArray64(r.seed, int64(avgLength), int64(valuesLength), lengths64,
forceEmptyNulls, zeroUndefinedOffsets)
}
defer offsets.Release()
buffers := []*memory.Buffer{
memory.NewBufferBytes(lengths.NullBitmapBytes()),
offsets,
memory.NewBufferBytes(lengths.Data().Buffers()[1].Bytes()),
}
childData := []arrow.ArrayData{values.Data()}
return array.NewData(dt, int(length), buffers, childData, int(lengths.NullN()), 0)
}
func (r *RandomArrayGenerator) ListView(dt arrow.VarLenListLikeType, length int64,
minLength, maxLength int32, nullprob float64) *array.ListView {
forceEmptyNulls := false
zeroUndefineOffsets := false
data := r.genListViewData(dt, length, int(minLength), int(maxLength), nullprob,
forceEmptyNulls, zeroUndefineOffsets)
defer data.Release()
return array.NewListViewData(data)
}
func (r *RandomArrayGenerator) LargeListView(dt arrow.VarLenListLikeType, length int64,
minLength, maxLength int64, nullprob float64) *array.LargeListView {
forceEmptyNulls := false
zeroUndefineOffsets := false
data := r.genListViewData(dt, length, int(minLength), int(maxLength), nullprob,
forceEmptyNulls, zeroUndefineOffsets)
defer data.Release()
return array.NewLargeListViewData(data)
}
func (r *RandomArrayGenerator) ArrayOf(dt arrow.Type, size int64, nullprob float64) arrow.Array {
switch dt {
case arrow.BOOL:
return r.Boolean(size, 0.50, nullprob)
case arrow.STRING:
return r.String(size, 0, 20, nullprob)
case arrow.LARGE_STRING:
return r.LargeString(size, 0, 20, nullprob)
case arrow.INT8:
return r.Int8(size, math.MinInt8, math.MaxInt8, nullprob)
case arrow.UINT8:
return r.Uint8(size, 0, math.MaxUint8, nullprob)
case arrow.INT16:
return r.Int16(size, math.MinInt16, math.MaxInt16, nullprob)
case arrow.UINT16:
return r.Uint16(size, 0, math.MaxUint16, nullprob)
case arrow.INT32:
return r.Int32(size, math.MinInt32, math.MaxInt32, nullprob)
case arrow.UINT32:
return r.Uint32(size, 0, math.MaxUint32, nullprob)
case arrow.INT64:
return r.Int64(size, math.MinInt64, math.MaxInt64, nullprob)
case arrow.UINT64:
return r.Uint64(size, 0, math.MaxUint64, nullprob)
case arrow.FLOAT32:
return r.Float32(size, -math.MaxFloat32, math.MaxFloat32, nullprob)
case arrow.FLOAT64:
return r.Float64(size, -math.MaxFloat64, math.MaxFloat64, nullprob)
}
panic("unimplemented ArrayOf type")
}