/
binaryscalarexpr.go
315 lines (277 loc) 路 7.39 KB
/
binaryscalarexpr.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
package physicalplan
import (
"bytes"
"context"
"errors"
"fmt"
"unsafe"
"github.com/apache/arrow/go/v16/arrow"
"github.com/apache/arrow/go/v16/arrow/array"
"github.com/apache/arrow/go/v16/arrow/compute"
"github.com/apache/arrow/go/v16/arrow/scalar"
"github.com/polarsignals/frostdb/query/logicalplan"
)
type ArrayRef struct {
ColumnName string
}
func (a *ArrayRef) ArrowArray(r arrow.Record) (arrow.Array, bool, error) {
fields := r.Schema().FieldIndices(a.ColumnName)
if len(fields) != 1 {
return nil, false, nil
}
return r.Column(fields[0]), true, nil
}
func (a *ArrayRef) String() string {
return a.ColumnName
}
type BinaryScalarExpr struct {
Left *ArrayRef
Op logicalplan.Op
Right scalar.Scalar
}
func (e BinaryScalarExpr) Eval(r arrow.Record) (*Bitmap, error) {
leftData, exists, err := e.Left.ArrowArray(r)
if err != nil {
return nil, err
}
if !exists {
res := NewBitmap()
switch e.Op {
case logicalplan.OpEq:
if e.Right.IsValid() { // missing column; looking for == non-nil
switch t := e.Right.(type) {
case *scalar.Binary:
if t.String() != "" { // treat empty string equivalent to nil
return res, nil
}
case *scalar.String:
if t.String() != "" { // treat empty string equivalent to nil
return res, nil
}
}
}
case logicalplan.OpNotEq: // missing column; looking for != nil
if !e.Right.IsValid() {
return res, nil
}
case logicalplan.OpLt, logicalplan.OpLtEq, logicalplan.OpGt, logicalplan.OpGtEq:
return res, nil
}
res.AddRange(0, uint64(r.NumRows()))
return res, nil
}
return BinaryScalarOperation(leftData, e.Right, e.Op)
}
func (e BinaryScalarExpr) String() string {
return e.Left.String() + " " + e.Op.String() + " " + e.Right.String()
}
var ErrUnsupportedBinaryOperation = errors.New("unsupported binary operation")
func BinaryScalarOperation(left arrow.Array, right scalar.Scalar, operator logicalplan.Op) (*Bitmap, error) {
switch operator {
case logicalplan.OpContains, logicalplan.OpNotContains:
switch arr := left.(type) {
case *array.Binary, *array.String:
return ArrayScalarContains(left, right, operator == logicalplan.OpNotContains)
case *array.Dictionary:
return DictionaryArrayScalarContains(arr, right, operator == logicalplan.OpNotContains)
default:
panic("unsupported array type " + fmt.Sprintf("%T", arr))
}
}
// TODO: Figure out dictionary arrays and lists with compute next
leftType := left.DataType()
switch arr := left.(type) {
case *array.Dictionary:
switch operator {
case logicalplan.OpEq:
return DictionaryArrayScalarEqual(arr, right)
case logicalplan.OpNotEq:
return DictionaryArrayScalarNotEqual(arr, right)
default:
return nil, fmt.Errorf("unsupported operator: %v", operator)
}
}
switch leftType.(type) {
case *arrow.ListType:
panic("TODO: list comparisons unimplemented")
}
return ArrayScalarCompute(operator.ArrowString(), left, right)
}
func ArrayScalarCompute(funcName string, left arrow.Array, right scalar.Scalar) (*Bitmap, error) {
leftData := compute.NewDatum(left)
defer leftData.Release()
rightData := compute.NewDatum(right)
defer rightData.Release()
equalsResult, err := compute.CallFunction(context.TODO(), funcName, nil, leftData, rightData)
if err != nil {
if errors.Unwrap(err).Error() == "not implemented" {
return nil, ErrUnsupportedBinaryOperation
}
return nil, fmt.Errorf("error calling equal function: %w", err)
}
defer equalsResult.Release()
equalsDatum, ok := equalsResult.(*compute.ArrayDatum)
if !ok {
return nil, fmt.Errorf("expected *compute.ArrayDatum, got %T", equalsResult)
}
equalsArray, ok := equalsDatum.MakeArray().(*array.Boolean)
if !ok {
return nil, fmt.Errorf("expected *array.Boolean, got %T", equalsDatum.MakeArray())
}
defer equalsArray.Release()
res := NewBitmap()
for i := 0; i < equalsArray.Len(); i++ {
if equalsArray.IsNull(i) {
continue
}
if equalsArray.Value(i) {
res.AddInt(i)
}
}
return res, nil
}
func DictionaryArrayScalarNotEqual(left *array.Dictionary, right scalar.Scalar) (*Bitmap, error) {
res := NewBitmap()
var data []byte
switch r := right.(type) {
case *scalar.Binary:
data = r.Data()
case *scalar.String:
data = r.Data()
}
// This is a special case for where the left side should not equal NULL
if right == scalar.ScalarNull {
for i := 0; i < left.Len(); i++ {
if !left.IsNull(i) {
res.Add(uint32(i))
}
}
return res, nil
}
for i := 0; i < left.Len(); i++ {
if left.IsNull(i) {
continue
}
switch dict := left.Dictionary().(type) {
case *array.Binary:
if !bytes.Equal(dict.Value(left.GetValueIndex(i)), data) {
res.Add(uint32(i))
}
case *array.String:
if dict.Value(left.GetValueIndex(i)) != string(data) {
res.Add(uint32(i))
}
}
}
return res, nil
}
func DictionaryArrayScalarEqual(left *array.Dictionary, right scalar.Scalar) (*Bitmap, error) {
res := NewBitmap()
var data []byte
switch r := right.(type) {
case *scalar.Binary:
data = r.Data()
case *scalar.String:
data = r.Data()
}
// This is a special case for where the left side should equal NULL
if right == scalar.ScalarNull {
for i := 0; i < left.Len(); i++ {
if left.IsNull(i) {
res.Add(uint32(i))
}
}
return res, nil
}
for i := 0; i < left.Len(); i++ {
if left.IsNull(i) {
continue
}
switch dict := left.Dictionary().(type) {
case *array.Binary:
if bytes.Equal(dict.Value(left.GetValueIndex(i)), data) {
res.Add(uint32(i))
}
case *array.String:
if dict.Value(left.GetValueIndex(i)) == string(data) {
res.Add(uint32(i))
}
}
}
return res, nil
}
func ArrayScalarContains(arr arrow.Array, right scalar.Scalar, not bool) (*Bitmap, error) {
var r []byte
switch s := right.(type) {
case *scalar.Binary:
r = s.Data()
case *scalar.String:
r = s.Data()
}
res := NewBitmap()
switch a := arr.(type) {
case *array.Binary:
for i := 0; i < a.Len(); i++ {
if a.IsNull(i) {
continue
}
contains := bytes.Contains(a.Value(i), r)
if contains && !not || !contains && not {
res.Add(uint32(i))
}
}
return res, nil
case *array.String:
for i := 0; i < a.Len(); i++ {
if a.IsNull(i) {
continue
}
contains := bytes.Contains(unsafeStringToBytes(a.Value(i)), r)
if contains && !not || !contains && not {
res.Add(uint32(i))
}
}
return res, nil
}
return nil, fmt.Errorf("contains not implemented for %T", arr)
}
func DictionaryArrayScalarContains(left *array.Dictionary, right scalar.Scalar, not bool) (*Bitmap, error) {
res := NewBitmap()
var data []byte
switch r := right.(type) {
case *scalar.Binary:
data = r.Data()
case *scalar.String:
data = r.Data()
}
// This is a special case for where the left side should not equal NULL
if right == scalar.ScalarNull {
for i := 0; i < left.Len(); i++ {
if !left.IsNull(i) {
res.Add(uint32(i))
}
}
return res, nil
}
for i := 0; i < left.Len(); i++ {
if left.IsNull(i) {
continue
}
switch dict := left.Dictionary().(type) {
case *array.Binary:
contains := bytes.Contains(dict.Value(left.GetValueIndex(i)), data)
if contains && !not || !contains && not {
res.Add(uint32(i))
}
case *array.String:
contains := bytes.Contains(unsafeStringToBytes(dict.Value(left.GetValueIndex(i))), data)
if contains && !not || !contains && not {
res.Add(uint32(i))
}
}
}
return res, nil
}
func unsafeStringToBytes(s string) []byte {
return unsafe.Slice(unsafe.StringData(s), len(s))
}