-
Notifications
You must be signed in to change notification settings - Fork 273
/
samplePool.go
851 lines (747 loc) · 19.4 KB
/
samplePool.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
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
// Copyright 2021 Matrix Origin
//
// Licensed 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 sample
import (
"github.com/matrixorigin/matrixone/pkg/common/moerr"
"github.com/matrixorigin/matrixone/pkg/common/mpool"
"github.com/matrixorigin/matrixone/pkg/container/batch"
"github.com/matrixorigin/matrixone/pkg/container/nulls"
"github.com/matrixorigin/matrixone/pkg/container/vector"
"github.com/matrixorigin/matrixone/pkg/vm/process"
"math/rand"
)
// sPool is the pool for sample.
type sPool struct {
proc *process.Process
// requireReorder indicates whether the pool should do reorder for input batch's vectors before sample.
// if true, vectors will be reordered as [groupList, sampleList, other columns].
requireReorder bool
otherPartIndex []int
// sample type.
// same as the Type attribute of sample.Argument.
typ sPoolType
isMerge bool
// some fields for performance.
canCheckFull bool
// capacity for each group.
capacity int
// 1000 means 10.00%, 1234 means 12.34%
percents int
// pools for each group to do sample by only one column.
sPools []singlePool
// pools for each group to do sample by multi columns.
mPools []multiPool
// reused memory for sample vectors.
columns sampleColumnList
// reused memory to do real sample. there is no need to free it because all its memory is from outer batch and vectors.
reOrderedInput *batch.Batch
}
type sPoolType int
const (
rowSamplePool sPoolType = iota
percentSamplePool
)
func newSamplePoolByRows(proc *process.Process, capacity int, sampleColumnCount int) *sPool {
return &sPool{
proc: proc,
requireReorder: true,
typ: rowSamplePool,
isMerge: false,
canCheckFull: false,
capacity: capacity,
columns: make(sampleColumnList, sampleColumnCount),
}
}
func newSamplePoolByPercent(proc *process.Process, per float64, sampleColumnCount int) *sPool {
return &sPool{
proc: proc,
requireReorder: true,
typ: percentSamplePool,
isMerge: false,
canCheckFull: false,
percents: int(per * 100),
columns: make(sampleColumnList, sampleColumnCount),
}
}
func newSamplePoolByRowsForMerge(proc *process.Process, capacity int, sampleColumnCount int) *sPool {
return &sPool{
proc: proc,
requireReorder: false,
typ: rowSamplePool,
isMerge: true,
canCheckFull: false,
capacity: capacity,
columns: make(sampleColumnList, sampleColumnCount),
}
}
func (s *sPool) setPerfFields(isGroupBy bool) {
s.canCheckFull = !isGroupBy && !s.isMerge && s.typ == rowSamplePool
}
func (s *sPool) IsFull() bool {
if !s.canCheckFull {
return false
}
if len(s.sPools) > 0 {
return s.sPools[0].space == 0
}
if len(s.mPools) > 0 {
return s.mPools[0].isFull()
}
return false
}
func (s *sPool) Free() {
mp := s.proc.Mp()
for _, sp := range s.sPools {
sp.data.clean(mp)
}
for _, m := range s.mPools {
m.data.clean(mp)
}
}
func (s *sPool) growSiPool(target int) {
if target <= len(s.sPools) {
return
}
for len(s.sPools) < target {
sp := singlePool{
capacity: s.capacity,
seen: 0,
space: s.capacity,
data: poolData{validBatch: nil, invalidBatch: nil},
}
s.sPools = append(s.sPools, sp)
}
}
func (s *sPool) growMulPool(target int, colNumber int) {
if target <= len(s.mPools) {
return
}
for len(s.mPools) < target {
s1 := make([]int, colNumber)
for i := range s1 {
s1[i] = s.capacity
}
sp := multiPool{
full: false,
seen: 0,
have: 0,
space: s1,
data: poolData{validBatch: nil, invalidBatch: nil},
tSpace: make([]int, colNumber),
}
s.mPools = append(s.mPools, sp)
}
}
func (s *sPool) vectorReOrder(
sampleVectors, groupVectors []*vector.Vector, inputBatch *batch.Batch) *batch.Batch {
if !s.requireReorder {
return inputBatch
}
// get a reorder list at first time.
if s.otherPartIndex == nil {
offset := len(inputBatch.Vecs)
got := make([]bool, len(inputBatch.Vecs))
for _, vec1 := range groupVectors {
for j, vec2 := range inputBatch.Vecs {
if vec1 == vec2 {
got[j] = true
break
}
}
}
for _, vec1 := range sampleVectors {
for j, vec2 := range inputBatch.Vecs {
if vec1 == vec2 {
got[j] = true
break
}
}
}
s.reOrderedInput = batch.NewWithSize(offset)
s.otherPartIndex = make([]int, 0, len(inputBatch.Vecs))
for i, g := range got {
if !g {
s.otherPartIndex = append(s.otherPartIndex, i)
}
}
}
// reorder vectors.
s.reOrderedInput.Vecs = s.reOrderedInput.Vecs[:0]
s.reOrderedInput.Vecs = append(s.reOrderedInput.Vecs, groupVectors...)
s.reOrderedInput.Vecs = append(s.reOrderedInput.Vecs, sampleVectors...)
for _, index := range s.otherPartIndex {
s.reOrderedInput.Vecs = append(s.reOrderedInput.Vecs, inputBatch.Vecs[index])
}
s.reOrderedInput.SetRowCount(inputBatch.RowCount())
return s.reOrderedInput
}
func (s *sPool) Sample(groupIndex int, sampleVectors []*vector.Vector, groupVectors []*vector.Vector, inputBatch *batch.Batch) error {
s.reOrderedInput = s.vectorReOrder(sampleVectors, groupVectors, inputBatch)
if len(sampleVectors) > 1 {
return s.sampleFromColumns(groupIndex, sampleVectors, s.reOrderedInput)
}
return s.sampleFromColumn(groupIndex, sampleVectors[0], s.reOrderedInput)
}
func (s *sPool) sampleFromColumn(groupIndex int, sampleVec *vector.Vector, bat *batch.Batch) error {
if groupIndex == 0 {
return nil
}
s.growSiPool(groupIndex)
groupIndex--
s.updateReused1(sampleVec)
switch s.typ {
case rowSamplePool:
return s.sPools[groupIndex].addByRow(s.proc, s.columns[0], bat)
case percentSamplePool:
return s.sPools[groupIndex].addByPercent(s.proc, s.columns[0], bat, s.percents)
}
return moerr.NewInternalErrorNoCtx("unexpected sample type %d", s.typ)
}
func (s *sPool) sampleFromColumns(groupIndex int, sampleVectors []*vector.Vector, bat *batch.Batch) (err error) {
if groupIndex == 0 {
return
}
s.growMulPool(groupIndex, len(sampleVectors))
groupIndex--
s.updateReused2(sampleVectors)
switch s.typ {
case rowSamplePool:
return s.mPools[groupIndex].addByRow(s.proc, s.columns, bat)
case percentSamplePool:
return s.mPools[groupIndex].addByPercent(s.proc, s.columns, bat, s.percents)
}
return moerr.NewInternalErrorNoCtx("unexpected sample type %d", s.typ)
}
func (s *sPool) BatchSample(offset, length int, groupList []uint64, sampleVectors []*vector.Vector, groupVectors []*vector.Vector, inputBatch *batch.Batch) (err error) {
s.reOrderedInput = s.vectorReOrder(sampleVectors, groupVectors, inputBatch)
if len(sampleVectors) > 1 {
return s.batchSampleFromColumns(offset, length, groupList, sampleVectors, s.reOrderedInput)
}
return s.batchSampleFromColumn(offset, length, groupList, sampleVectors[0], s.reOrderedInput)
}
func (s *sPool) batchSampleFromColumn(offset, length int, groupList []uint64, sampleVec *vector.Vector, bat *batch.Batch) (err error) {
s.updateReused1(sampleVec)
mp := s.proc.Mp()
row := offset
switch s.typ {
case rowSamplePool:
for _, v := range groupList[:length] {
if v == 0 {
continue
}
groupIndex := int(v)
s.growSiPool(groupIndex)
groupIndex--
err = s.sPools[groupIndex].addRow(s.proc, mp, s.columns[0], bat, row)
if err != nil {
return err
}
row++
}
case percentSamplePool:
for _, v := range groupList[:length] {
if v == 0 {
continue
}
groupIndex := int(v)
s.growSiPool(groupIndex)
groupIndex--
err = s.sPools[groupIndex].addRowByPercent(s.proc, mp, s.columns[0], bat, row, s.percents)
if err != nil {
return err
}
row++
}
default:
return moerr.NewInternalErrorNoCtx("unexpected sample type %d", s.typ)
}
return nil
}
func (s *sPool) batchSampleFromColumns(offset, length int, groupList []uint64, sampleVectors []*vector.Vector, bat *batch.Batch) (err error) {
s.updateReused2(sampleVectors)
mp := s.proc.Mp()
row := offset
switch s.typ {
case rowSamplePool:
for _, v := range groupList[:length] {
if v == 0 {
continue
}
groupIndex := int(v)
s.growMulPool(groupIndex, len(sampleVectors))
groupIndex--
err = s.mPools[groupIndex].addRow(s.proc, mp, s.columns, bat, row)
if err != nil {
return err
}
row++
}
case percentSamplePool:
for _, v := range groupList[:length] {
if v == 0 {
continue
}
groupIndex := int(v)
s.growMulPool(groupIndex, len(sampleVectors))
groupIndex--
err = s.mPools[groupIndex].addRowByPercent(s.proc, mp, s.columns, bat, row, s.percents)
if err != nil {
return err
}
row++
}
default:
return moerr.NewInternalErrorNoCtx("unexpected sample type %d", s.typ)
}
return nil
}
func (s *sPool) updateReused1(col *vector.Vector) {
if col.IsConst() {
if col.IsConstNull() {
s.columns[0] = sColumnConst{isnull: true}
} else {
s.columns[0] = sColumnConst{isnull: false}
}
} else {
if col.GetNulls().IsEmpty() {
s.columns[0] = sColumnNormalWithoutNull{}
} else {
s.columns[0] = sColumnNormalWithNull{nsp: col.GetNulls()}
}
}
}
func (s *sPool) updateReused2(columns []*vector.Vector) {
for i, col := range columns {
if col.IsConst() {
if col.IsConstNull() {
s.columns[i] = sColumnConst{isnull: true}
} else {
s.columns[i] = sColumnConst{isnull: false}
}
} else {
if col.GetNulls().IsEmpty() {
s.columns[i] = sColumnNormalWithoutNull{}
} else {
s.columns[i] = sColumnNormalWithNull{nsp: col.GetNulls()}
}
}
}
}
func (s *sPool) Output(end bool) (bat *batch.Batch, err error) {
if !end {
if s.typ == rowSamplePool {
return batch.EmptyBatch, nil
}
}
mp := s.proc.Mp()
if len(s.sPools) > 0 {
bat = s.sPools[0].data.output()
if bat != nil {
for i := 1; i < len(s.sPools); i++ {
b := s.sPools[i].data.output()
if b == nil {
continue
}
bat, err = bat.Append(s.proc.Ctx, mp, b)
s.proc.PutBatch(b)
if err != nil {
s.proc.PutBatch(bat)
return nil, err
}
}
}
} else if len(s.mPools) > 0 {
bat = s.mPools[0].data.output()
for i := 1; i < len(s.mPools); i++ {
b := s.mPools[i].data.output()
if b == nil {
continue
}
bat, err = bat.Append(s.proc.Ctx, mp, b)
s.proc.PutBatch(b)
if err != nil {
s.proc.PutBatch(bat)
return nil, err
}
}
}
// If a middle result is empty, cannot return nil directly. It will cause the pipeline closed early.
if bat == nil && !end {
return batch.EmptyBatch, nil
}
return bat, nil
}
// pool for sample by single column.
type singlePool struct {
capacity int
// count of rows which has been seen.
seen int
// free space of pool.
space int
data poolData
}
func (sp *singlePool) addByRow(proc *process.Process, column sampleColumn, bat *batch.Batch) error {
k := bat.RowCount()
mp := proc.Mp()
randReplaceStart := 0
if sp.space > 0 {
if column.anyNull() {
offset, length := 0, 0
oldSpace := sp.space
// case: pool must have enough space to store all the values.
if k <= sp.space {
for i := 0; i < k; i++ {
if column.isNull(i) {
err := sp.data.appendInvalidRow(proc, mp, bat, i)
if err != nil {
return err
}
if length > 0 {
err = sp.data.appendValidRow(proc, mp, bat, offset, length)
if err != nil {
return err
}
sp.space -= length
length = 0
}
offset = i + 1
continue
}
length++
}
if offset < k && length > 0 {
err := sp.data.appendValidRow(proc, mp, bat, offset, length)
if err != nil {
return err
}
sp.space -= length
}
sp.seen += oldSpace - sp.space
return nil
}
// case: pool's space maybe unable to store all the values.
var i = 0
for ; i < k && sp.space >= length; i++ {
if column.isNull(i) {
err := sp.data.appendInvalidRow(proc, mp, bat, i)
if err != nil {
return err
}
if length > 0 {
err = sp.data.appendValidRow(proc, mp, bat, offset, length)
if err != nil {
return err
}
sp.space -= length
length = 0
}
offset = i + 1
continue
}
length++
}
if length > 0 {
if sp.space >= length {
err := sp.data.appendValidRow(proc, mp, bat, offset, length)
if err != nil {
return err
}
sp.space -= length
sp.seen += oldSpace
return nil
}
err := sp.data.appendValidRow(proc, mp, bat, offset, sp.space)
if err != nil {
return err
}
offset += sp.space
sp.space = 0
}
sp.seen += oldSpace - sp.space
randReplaceStart = offset
} else {
// case: pool can store.
if k <= sp.space {
sp.space -= k
sp.seen += k
err := sp.data.appendValidRow(proc, mp, bat, 0, k)
if err != nil {
return err
}
return nil
}
// case: pool can store part of rows.
randReplaceStart = sp.space
err := sp.data.appendValidRow(proc, mp, bat, 0, sp.space)
if err != nil {
return err
}
sp.seen += sp.space
sp.space = 0
}
}
// after some append action, batch still has rows need to add.
var r int
if column.anyNull() {
for i := randReplaceStart; i < k; i++ {
if column.isNull(i) {
err := sp.data.appendInvalidRow(proc, mp, bat, i)
if err != nil {
return err
}
continue
}
sp.seen++
r = rand.Intn(sp.seen)
if r < sp.capacity {
err := sp.data.replaceValidRow(mp, bat, r, i)
if err != nil {
return err
}
}
}
} else {
for i := randReplaceStart; i < k; i++ {
sp.seen++
r = rand.Intn(sp.seen)
if r < sp.capacity {
err := sp.data.replaceValidRow(mp, bat, r, i)
if err != nil {
return err
}
}
}
}
return nil
}
func (sp *singlePool) addByPercent(proc *process.Process, column sampleColumn, bat *batch.Batch, percent int) error {
if percent == 0 {
return nil
}
k := bat.RowCount()
mp := proc.Mp()
if column.anyNull() {
for i := 0; i < k; i++ {
if column.isNull(i) {
continue
}
if percent == 10000 || rand.Intn(10000) < percent {
if err := sp.data.appendValidRow(proc, mp, bat, i, 1); err != nil {
return err
}
}
}
} else {
for i := 0; i < k; i++ {
if percent == 10000 || rand.Intn(10000) < percent {
if err := sp.data.appendValidRow(proc, mp, bat, i, 1); err != nil {
return err
}
}
}
}
return nil
}
func (sp *singlePool) addRow(proc *process.Process, mp *mpool.MPool, column sampleColumn, bat *batch.Batch, row int) (err error) {
if column.isNull(row) {
return sp.data.appendInvalidRow(proc, mp, bat, row)
}
sp.seen++
if sp.space > 0 {
sp.space--
err = sp.data.appendValidRow(proc, mp, bat, row, 1)
} else {
r := rand.Intn(sp.seen)
if r < sp.capacity {
err = sp.data.replaceValidRow(mp, bat, r, row)
}
}
return err
}
func (sp *singlePool) addRowByPercent(proc *process.Process, mp *mpool.MPool, column sampleColumn, bat *batch.Batch, row int, percent int) (err error) {
if percent == 0 {
return
}
if column.isNull(row) {
return
}
if percent == 10000 || rand.Intn(10000) < percent {
err = sp.data.appendValidRow(proc, mp, bat, row, 1)
}
return
}
// pool for sample by multi columns.
type multiPool struct {
full bool
// free space for each column
space []int
// count of rows which has been seen.
seen int
// count of rows which has been stored.
have int
// reused.
tSpace []int
data poolData
}
func (p *multiPool) isFull() bool {
for _, sp := range p.space {
if sp > 0 {
return false
}
}
return true
}
func (p *multiPool) appendValidRow(proc *process.Process, mp *mpool.MPool, columns sampleColumnList, bat *batch.Batch, row int) (err error) {
err = p.data.appendValidRow(proc, mp, bat, row, 1)
for i, col := range columns {
if !col.isNull(row) {
p.space[i]--
}
}
p.have++
return err
}
func (p *multiPool) tryReplaceValidRow(mp *mpool.MPool, columns sampleColumnList, bat *batch.Batch, row1, row2 int) (err error) {
// the replacement action cannot destroy the original integrity of the sample pool.
for j := range p.space {
p.tSpace[j] = p.space[j]
if columns[j].isNull(row2) {
if p.space[j] < -1 {
p.tSpace[j]++
} else {
return
}
}
}
p.tSpace, p.space = p.space, p.tSpace
return p.data.replaceValidRow(mp, bat, row1, row2)
}
func (p *multiPool) addByRow(proc *process.Process, columns sampleColumnList, bat *batch.Batch) (err error) {
k := bat.RowCount()
var i = 0
if !p.full {
for ; i < k; i++ {
if p.isFull() {
break
}
p.seen++
for colIndex := range p.space {
if p.space[colIndex] > 0 && !columns[colIndex].isNull(i) {
err = p.appendValidRow(proc, proc.Mp(), columns, bat, i)
if err != nil {
return err
}
break
}
}
}
}
var r int
mp := proc.Mp()
for ; i < k; i++ {
if columns.isAllNull(i) {
continue
}
p.seen++
r = rand.Intn(p.seen)
if r < p.have {
err = p.tryReplaceValidRow(mp, columns, bat, r, i)
if err != nil {
return err
}
}
}
p.full = p.isFull()
return nil
}
func (p *multiPool) addByPercent(proc *process.Process, columns sampleColumnList, bat *batch.Batch, percent int) (err error) {
if percent == 0 {
return nil
}
k := bat.RowCount()
for i := 0; i < k; i++ {
if columns.isAllNull(i) {
continue
}
if percent == 10000 || rand.Intn(10000) < percent {
err = p.appendValidRow(proc, proc.Mp(), columns, bat, i)
if err != nil {
return err
}
}
}
return nil
}
func (p *multiPool) addRow(proc *process.Process, mp *mpool.MPool, columns sampleColumnList, bat *batch.Batch, row int) (err error) {
if columns.isAllNull(row) {
return p.data.appendInvalidRow(proc, mp, bat, row)
}
if !p.full {
p.seen++
for colIndex := range p.space {
if p.space[colIndex] > 0 && !columns[colIndex].isNull(row) {
err = p.appendValidRow(proc, proc.Mp(), columns, bat, row)
if err != nil {
return err
}
break
}
}
p.full = p.isFull()
} else {
p.seen++
r := rand.Intn(p.seen)
if r < p.have {
err = p.tryReplaceValidRow(mp, columns, bat, r, row)
if err != nil {
return err
}
}
}
return nil
}
func (p *multiPool) addRowByPercent(proc *process.Process, mp *mpool.MPool, columns sampleColumnList, bat *batch.Batch, row int, percent int) (err error) {
if percent == 0 {
return
}
if columns.isAllNull(row) {
return p.data.appendInvalidRow(proc, mp, bat, row)
}
if percent == 10000 || rand.Intn(10000) < percent {
err = p.appendValidRow(proc, mp, columns, bat, row)
}
return
}
type sampleColumn interface {
isNull(index int) bool
anyNull() bool
}
type sColumnConst struct{ isnull bool }
type sColumnNormalWithNull struct{ nsp *nulls.Nulls }
type sColumnNormalWithoutNull struct{}
func (s sColumnConst) isNull(_ int) bool { return s.isnull }
func (s sColumnNormalWithNull) isNull(index int) bool { return s.nsp.Contains(uint64(index)) }
func (s sColumnNormalWithoutNull) isNull(_ int) bool { return false }
func (s sColumnConst) anyNull() bool { return s.isnull }
func (s sColumnNormalWithNull) anyNull() bool { return true }
func (s sColumnNormalWithoutNull) anyNull() bool { return false }
type sampleColumnList []sampleColumn
func (l sampleColumnList) isAllNull(index int) bool {
for _, col := range l {
if !col.isNull(index) {
return false
}
}
return true
}