-
Notifications
You must be signed in to change notification settings - Fork 0
/
node_query.go
410 lines (338 loc) · 9.11 KB
/
node_query.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
/*
Copyright NetFoundry, Inc.
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
https://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 ast
import (
"fmt"
"github.com/michaelquigley/pfxlog"
"reflect"
"strings"
"github.com/pkg/errors"
)
type untypedQueryNode struct {
predicate Node
sortBy *SortByNode
skip *SkipExprNode
limit *LimitExprNode
}
func (node *untypedQueryNode) String() string {
return node.predicate.String() + " " + node.sortBy.String() + " " + node.limit.String()
}
func (node *untypedQueryNode) GetType() NodeType {
return NodeTypeBool
}
func (node *untypedQueryNode) Accept(visitor Visitor) {
visitor.VisitUntypedQueryNodeStart(node)
node.predicate.Accept(visitor)
node.sortBy.Accept(visitor)
node.skip.Accept(visitor)
node.limit.Accept(visitor)
visitor.VisitUntypedQueryNodeEnd(node)
}
func (node *untypedQueryNode) EvalBool(Symbols) bool {
pfxlog.Logger().Errorf("cannot evaluate transitory untyped query node %v", node)
return false
}
func (node *untypedQueryNode) TypeTransformBool(s SymbolTypes) (BoolNode, error) {
if err := transformTypes(s, &node.predicate); err != nil {
return node, err
}
if _, err := node.sortBy.TypeTransform(s); err != nil {
return node, err
}
boolNode, ok := node.predicate.(BoolNode)
if !ok {
return node, errors.Errorf("query expr predicate must be a boolean expr. contains %v", reflect.TypeOf(node.predicate))
}
return &queryNode{
Predicate: boolNode,
SortBy: node.sortBy,
Skip: node.skip,
Limit: node.limit,
}, nil
}
func (node *untypedQueryNode) IsConst() bool {
return node.predicate.IsConst()
}
type queryNode struct {
Predicate BoolNode
SortBy *SortByNode
Skip *SkipExprNode
Limit *LimitExprNode
}
func (node *queryNode) SetSkip(skip int64) {
node.Skip = &SkipExprNode{Int64ConstNode{value: skip}}
}
func (node *queryNode) SetLimit(limit int64) {
node.Limit = &LimitExprNode{Int64ConstNode{value: limit}}
}
func (node *queryNode) TypeTransformBool(s SymbolTypes) (BoolNode, error) {
if err := transformBools(s, &node.Predicate); err != nil {
return node, err
}
if _, err := node.SortBy.TypeTransform(s); err != nil {
return node, err
}
return node, nil
}
func (node *queryNode) EvalBool(s Symbols) bool {
return node.Predicate.EvalBool(s)
}
func (node *queryNode) GetPredicate() BoolNode {
return node.Predicate
}
func (node *queryNode) SetPredicate(predicate BoolNode) {
node.Predicate = predicate
}
func (node *queryNode) GetSortFields() []SortField {
return node.SortBy.getSortFields()
}
func (node *queryNode) AdoptSortFields(query Query) error {
qn, ok := query.(*queryNode)
if !ok {
return errors.Errorf("unhanded query type: %v. expecting queryNode", reflect.TypeOf(query))
}
node.SortBy = qn.SortBy
return nil
}
func (node *queryNode) GetSkip() *int64 {
if node.Skip == nil {
return nil
}
return &node.Skip.value
}
func (node *queryNode) GetLimit() *int64 {
if node.Limit == nil {
return nil
}
return &node.Limit.value
}
func (node *queryNode) String() string {
builder := strings.Builder{}
builder.WriteString(node.Predicate.String())
if node.SortBy != nil && len(node.SortBy.SortFields) > 0 {
builder.WriteString(" ")
builder.WriteString(node.SortBy.String())
}
if node.Limit != nil {
builder.WriteString(" ")
builder.WriteString(node.Limit.String())
}
return builder.String()
}
func (node *queryNode) GetType() NodeType {
return NodeTypeBool
}
func (node *queryNode) Accept(visitor Visitor) {
visitor.VisitQueryNodeStart(node)
node.Predicate.Accept(visitor)
node.SortBy.Accept(visitor)
node.Skip.Accept(visitor)
node.Limit.Accept(visitor)
visitor.VisitQueryNodeEnd(node)
}
func (node *queryNode) IsConst() bool {
return node.Predicate.IsConst()
}
type SortByNode struct {
SortFields []*SortFieldNode
}
func (node *SortByNode) getSortFields() []SortField {
if node == nil {
return nil
}
var result []SortField
for _, sortField := range node.SortFields {
result = append(result, sortField)
}
return result
}
func (node *SortByNode) TypeTransform(s SymbolTypes) (Node, error) {
if node != nil {
for _, sortField := range node.SortFields {
if _, err := sortField.TypeTransform(s); err != nil {
return node, err
}
}
}
return node, nil
}
func (node *SortByNode) String() string {
builder := strings.Builder{}
builder.WriteString("sort by ")
if node == nil || len(node.SortFields) == 0 {
builder.WriteString("<default>")
} else {
builder.WriteString(node.SortFields[0].String())
for _, sortField := range node.SortFields[1:] {
builder.WriteString(", ")
builder.WriteString(sortField.String())
}
}
return builder.String()
}
func (node *SortByNode) GetType() NodeType {
return NodeTypeOther
}
func (node *SortByNode) Accept(visitor Visitor) {
if node != nil {
for _, sortField := range node.SortFields {
sortField.Accept(visitor)
}
visitor.VisitSortByNode(node)
}
}
func (node *SortByNode) IsConst() bool {
return false
}
func NewSortFieldNode(symbol string, isAscending bool) SortField {
return &SortFieldNode{
symbol: &UntypedSymbolNode{
symbol: symbol,
},
isAscending: isAscending,
}
}
type SortFieldNode struct {
symbol SymbolNode
isAscending bool
}
func (node *SortFieldNode) Symbol() string {
return node.symbol.Symbol()
}
func (node *SortFieldNode) IsAscending() bool {
return node.isAscending
}
func (node *SortFieldNode) TypeTransform(s SymbolTypes) (Node, error) {
var symbolNode Node = node.symbol
err := transformTypes(s, &symbolNode)
node.symbol = symbolNode.(SymbolNode)
return node, err
}
func (node *SortFieldNode) String() string {
if node.isAscending {
return fmt.Sprintf("%v ASC", node.symbol)
}
return fmt.Sprintf("%v DESC", node.symbol)
}
func (node *SortFieldNode) GetType() NodeType {
return NodeTypeOther
}
func (node *SortFieldNode) Accept(visitor Visitor) {
node.symbol.Accept(visitor)
visitor.VisitSortFieldNode(node)
}
func (node *SortFieldNode) IsConst() bool {
return false
}
type SortDirection bool
const (
SortAscending SortDirection = true
SortDescending SortDirection = false
)
type LimitExprNode struct {
Int64ConstNode
}
func (node *LimitExprNode) String() string {
if node == nil || node.value == -1 {
return "limit none"
}
return fmt.Sprintf("limit %v", node.value)
}
func (node *LimitExprNode) Accept(visitor Visitor) {
if node != nil {
visitor.VisitLimitExprNode(node)
}
}
type SkipExprNode struct {
Int64ConstNode
}
func (node *SkipExprNode) String() string {
if node == nil {
return "skip 0"
}
return fmt.Sprintf("skip %v", node.value)
}
func (node *SkipExprNode) Accept(visitor Visitor) {
if node != nil {
visitor.VisitSkipExprNode(node)
}
}
type UntypedSubQueryNode struct {
symbol SymbolNode
query Node
}
func (node *UntypedSubQueryNode) Symbol() string {
return node.symbol.Symbol()
}
func (node *UntypedSubQueryNode) Accept(visitor Visitor) {
visitor.VisitUntypedSubQueryNodeStart(node)
node.symbol.Accept(visitor)
node.query.Accept(visitor)
visitor.VisitUntypedSubQueryNodeEnd(node)
}
func (node *UntypedSubQueryNode) TypeTransform(s SymbolTypes) (Node, error) {
var symbolAsNode Node = node.symbol
if err := transformTypes(s, &symbolAsNode); err != nil {
return node, err
}
subQuerySymbolTypes := s.GetSetSymbolTypes(node.Symbol())
if subQuerySymbolTypes == nil {
return node, errors.Errorf("symbol for sub-query is not an entity type %v", node.Symbol())
}
if err := transformTypes(subQuerySymbolTypes, &node.query); err != nil {
return node, err
}
symbolNode, ok := symbolAsNode.(SymbolNode)
if !ok {
return node, errors.Errorf("from symbol must be an expr. contains %v", reflect.TypeOf(symbolAsNode))
}
queryNode, ok := node.query.(Query)
if !ok {
return node, errors.Errorf("from query must be a query instance. contains %v", reflect.TypeOf(node.query))
}
return &subQueryNode{
symbol: symbolNode,
query: queryNode,
}, nil
}
func (node *UntypedSubQueryNode) String() string {
return fmt.Sprintf("from(%v where %v)", node.symbol.String(), node.query.String())
}
func (node *UntypedSubQueryNode) GetType() NodeType {
return NodeTypeOther
}
func (node *UntypedSubQueryNode) IsConst() bool {
return node.query.IsConst()
}
type subQueryNode struct {
symbol SymbolNode
query Query
}
func (node *subQueryNode) Symbol() string {
return node.symbol.Symbol()
}
func (node *subQueryNode) Accept(visitor Visitor) {
visitor.VisitSubQueryNodeStart(node)
node.symbol.Accept(visitor)
node.query.Accept(visitor)
visitor.VisitSubQueryNodeEnd(node)
}
func (node *subQueryNode) String() string {
return fmt.Sprintf("from(%v where %v)", node.symbol.String(), node.query.String())
}
func (node *subQueryNode) GetType() NodeType {
return NodeTypeOther
}
func (node *subQueryNode) IsConst() bool {
return node.query.IsConst()
}