-
Notifications
You must be signed in to change notification settings - Fork 7
/
Copy pathfilters.go
465 lines (385 loc) · 11.9 KB
/
filters.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
// Copyright 2019 Aporeto 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
// 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 elemental
import (
"bytes"
"fmt"
"reflect"
"strings"
"time"
)
// An FilterComparator is the type of a operator used by a filter.
type FilterComparator int
// FilterComparators are a list of FilterOperator.
type FilterComparators []FilterComparator
// Comparators represent various comparison operations.
const (
EqualComparator FilterComparator = iota
NotEqualComparator
GreaterComparator
GreaterOrEqualComparator
LesserComparator
LesserOrEqualComparator
InComparator
NotInComparator
ContainComparator
NotContainComparator
MatchComparator
NotMatchComparator
ExistsComparator
NotExistsComparator
emptyComparator
)
func (f FilterComparators) add(comparators ...FilterComparator) FilterComparators {
for _, o := range comparators {
f = append(f, o)
}
return f
}
// An FilterOperator is the type of a operator used by a filter.
type FilterOperator int
// FilterOperators are a list of FilterOperator.
type FilterOperators []FilterOperator
// Operators represent various operators.
const (
AndOperator FilterOperator = iota
OrFilterOperator
AndFilterOperator
)
// FilterKeys represents a list of FilterKey.
type FilterKeys []string
// FilterValue represents a filter value.
type FilterValue []any
// FilterValues represents a list of FilterValue.
type FilterValues [][]any
// Then adds a new value to the receiver and returns it.
func (f FilterValues) add(values ...any) FilterValues {
fv := FilterValue{}
for _, v := range values {
fv = append(fv, v)
}
return append(f, fv)
}
// SubFilter is the type of subfilter
type SubFilter []*Filter
// SubFilters is is a list SubFilter,
type SubFilters []SubFilter
// FilterValueComposer adds values and operators.
type FilterValueComposer interface {
Equals(any) FilterKeyComposer
NotEquals(any) FilterKeyComposer
GreaterOrEqualThan(any) FilterKeyComposer
GreaterThan(any) FilterKeyComposer
LesserOrEqualThan(any) FilterKeyComposer
LesserThan(any) FilterKeyComposer
In(...any) FilterKeyComposer
NotIn(...any) FilterKeyComposer
Contains(...any) FilterKeyComposer
NotContains(...any) FilterKeyComposer
Matches(...any) FilterKeyComposer
Exists() FilterKeyComposer
NotExists() FilterKeyComposer
}
// FilterKeyComposer composes a filter.
type FilterKeyComposer interface {
WithKey(string) FilterValueComposer
And(...*Filter) FilterKeyComposer
Or(...*Filter) FilterKeyComposer
Done() *Filter
}
// Filter is a filter struct which can be used with Cassandra
type Filter struct {
keys FilterKeys
values FilterValues
comparators FilterComparators
operators FilterOperators
ands SubFilters
ors SubFilters
}
// NewFilter returns a new filter.
func NewFilter() *Filter {
return &Filter{
keys: FilterKeys{},
values: FilterValues{},
comparators: FilterComparators{},
operators: FilterOperators{},
ands: SubFilters{},
ors: SubFilters{},
}
}
// NewFilterComposer returns a FilterComposer.
func NewFilterComposer() FilterKeyComposer {
return NewFilter()
}
// NewFilterFromString returns a new filter computed from the given string.
func NewFilterFromString(filter string) (*Filter, error) {
f, err := NewFilterParser(filter).Parse()
if err != nil {
return nil, err
}
return f.Done(), nil
}
// Keys returns the current keys.
func (f *Filter) Keys() FilterKeys {
return append(FilterKeys{}, f.keys...)
}
// Values returns the current values.
func (f *Filter) Values() FilterValues {
return append(FilterValues{}, f.values...)
}
// Operators returns the current operators.
func (f *Filter) Operators() FilterOperators {
return append(FilterOperators{}, f.operators...)
}
// Comparators returns the current comparators.
func (f *Filter) Comparators() FilterComparators {
return append(FilterComparators{}, f.comparators...)
}
// OrFilters returns the current ors sub filters.
func (f *Filter) OrFilters() SubFilters {
return append(SubFilters{}, f.ors...)
}
// AndFilters returns the current and sub filters.
func (f *Filter) AndFilters() SubFilters {
return append(SubFilters{}, f.ands...)
}
// Equals adds a an equality comparator to the FilterComposer.
func (f *Filter) Equals(value any) FilterKeyComposer {
f.values = f.values.add(value)
f.comparators = f.comparators.add(EqualComparator)
return f
}
// NotEquals adds a an non equality comparator to the FilterComposer.
func (f *Filter) NotEquals(value any) FilterKeyComposer {
f.values = f.values.add(value)
f.comparators = f.comparators.add(NotEqualComparator)
return f
}
// GreaterThan adds a greater than (exclusive) comparator to the FilterComposer.
func (f *Filter) GreaterThan(value any) FilterKeyComposer {
f.values = f.values.add(value)
f.comparators = f.comparators.add(GreaterComparator)
return f
}
// GreaterOrEqualThan adds a greater than (inclusive) comparator to the FilterComposer.
func (f *Filter) GreaterOrEqualThan(value any) FilterKeyComposer {
f.values = f.values.add(value)
f.comparators = f.comparators.add(GreaterOrEqualComparator)
return f
}
// LesserThan adds a lesser than (exclusive) comparator to the FilterComposer.
func (f *Filter) LesserThan(value any) FilterKeyComposer {
f.values = f.values.add(value)
f.comparators = f.comparators.add(LesserComparator)
return f
}
// LesserOrEqualThan adds a lesser than (inclusive) comparator to the FilterComposer.
func (f *Filter) LesserOrEqualThan(value any) FilterKeyComposer {
f.values = f.values.add(value)
f.comparators = f.comparators.add(LesserOrEqualComparator)
return f
}
// In adds a in comparator to the FilterComposer.
func (f *Filter) In(values ...any) FilterKeyComposer {
f.values = f.values.add(values...)
f.comparators = f.comparators.add(InComparator)
return f
}
// NotIn adds a not in comparator to the FilterComposer.
func (f *Filter) NotIn(values ...any) FilterKeyComposer {
f.values = f.values.add(values...)
f.comparators = f.comparators.add(NotInComparator)
return f
}
// Contains adds a contains comparator to the FilterComposer.
func (f *Filter) Contains(values ...any) FilterKeyComposer {
f.values = f.values.add(values...)
f.comparators = f.comparators.add(ContainComparator)
return f
}
// NotContains adds a contains comparator to the FilterComposer.
func (f *Filter) NotContains(values ...any) FilterKeyComposer {
f.values = f.values.add(values...)
f.comparators = f.comparators.add(NotContainComparator)
return f
}
// Matches adds a match comparator to the FilterComposer.
func (f *Filter) Matches(values ...any) FilterKeyComposer {
f.values = f.values.add(values...)
f.comparators = f.comparators.add(MatchComparator)
return f
}
// Exists adds an exists comparator to the FilterComposer.
func (f *Filter) Exists() FilterKeyComposer {
f.values = f.values.add(true)
f.comparators = f.comparators.add(ExistsComparator)
return f
}
// NotExists adds an not exist comparator to the FilterComposer.
func (f *Filter) NotExists() FilterKeyComposer {
f.values = f.values.add(false)
f.comparators = f.comparators.add(NotExistsComparator)
return f
}
// WithKey adds a key to FilterComposer.
func (f *Filter) WithKey(key string) FilterValueComposer {
f.operators = append(f.operators, AndOperator)
f.keys = append(f.keys, key)
f.ands = append(f.ands, nil)
f.ors = append(f.ors, nil)
return f
}
// And adds a new sub filter to FilterComposer.
func (f *Filter) And(filters ...*Filter) FilterKeyComposer {
f.operators = append(f.operators, AndFilterOperator)
f.comparators = append(f.comparators, emptyComparator)
f.keys = append(f.keys, "")
f.values = append(f.values, nil)
f.ands = append(f.ands, filters)
f.ors = append(f.ors, nil)
return f
}
// Or adds a new sub filter to FilterComposer.
func (f *Filter) Or(filters ...*Filter) FilterKeyComposer {
f.operators = append(f.operators, OrFilterOperator)
f.comparators = append(f.comparators, emptyComparator)
f.keys = append(f.keys, "")
f.values = append(f.values, nil)
f.ands = append(f.ands, nil)
f.ors = append(f.ors, filters)
return f
}
// Done terminates the filter composition and returns the *Filter.
func (f *Filter) Done() *Filter {
return f
}
func (f *Filter) String() string {
var buffer bytes.Buffer
for i, operator := range f.operators {
if i > 0 {
writeString(&buffer, translateOperator(operator))
writeString(&buffer, " ")
}
switch operator {
case AndOperator:
writeString(&buffer, f.keys[i])
writeString(&buffer, " ")
writeString(&buffer, translateComparator(f.comparators[i]))
if f.comparators[i] != ExistsComparator && f.comparators[i] != NotExistsComparator {
writeString(&buffer, " ")
writeString(&buffer, translateValue(f.comparators[i], f.values[i]))
}
case AndFilterOperator:
var strs []string
for _, andf := range f.ands[i] {
strs = append(strs, fmt.Sprintf("(%s)", andf))
}
writeString(&buffer, fmt.Sprintf("(%s)", strings.Join(strs, " and ")))
case OrFilterOperator:
var strs []string
for _, orf := range f.ors[i] {
strs = append(strs, fmt.Sprintf("(%s)", orf))
}
writeString(&buffer, fmt.Sprintf("(%s)", strings.Join(strs, " or ")))
}
if i+1 < len(f.operators) {
writeString(&buffer, " ")
}
}
return buffer.String()
}
func translateComparator(comparator FilterComparator) string {
switch comparator {
case EqualComparator:
return "=="
case NotEqualComparator:
return "!="
case GreaterOrEqualComparator:
return ">="
case GreaterComparator:
return ">"
case LesserOrEqualComparator:
return "<="
case LesserComparator:
return "<"
case InComparator:
return "in"
case NotInComparator:
return "not in"
case ContainComparator:
return "contains"
case NotContainComparator:
return "not contains"
case MatchComparator:
return "matches"
case ExistsComparator:
return "exists"
case NotExistsComparator:
return "not exists"
default:
panic(fmt.Sprintf("Unknown comparator: %d", comparator))
}
}
func translateOperator(operator FilterOperator) string {
switch operator {
case AndOperator, AndFilterOperator:
return "and"
case OrFilterOperator:
return "or"
default:
panic(fmt.Sprintf("Unknown operator: %d", operator))
}
}
func translateValue(comparator FilterComparator, value any) string {
v := reflect.ValueOf(value)
if comparator != ContainComparator &&
comparator != InComparator &&
comparator != NotInComparator &&
comparator != MatchComparator {
if v.Kind() == reflect.Slice || v.Kind() == reflect.Array {
v = reflect.ValueOf(v.Index(0).Interface())
}
}
switch v.Kind() {
case reflect.String:
return fmt.Sprintf(`"%s"`, v.Interface())
case reflect.Int, reflect.Int16, reflect.Int32, reflect.Int64,
reflect.Int8, reflect.Uint, reflect.Uint16, reflect.Uint32,
reflect.Uint64, reflect.Uint8:
if v.Type().Name() == "Duration" {
if v.Interface() == time.Duration(0) {
return `now()`
}
return fmt.Sprintf(`now("%s")`, v.Interface())
}
return fmt.Sprintf(`%d`, v.Interface())
case reflect.Float32, reflect.Float64:
return fmt.Sprintf(`%f`, v.Interface())
case reflect.Bool:
return fmt.Sprintf(`%t`, v.Interface())
case reflect.Slice, reflect.Array:
var final []string
for i := 0; i < v.Len(); i++ {
final = append(final, translateValue(comparator, v.Index(i).Interface()))
}
return fmt.Sprintf(`[%s]`, strings.Join(final, ", "))
default:
if v.Type().Name() == "Time" {
return fmt.Sprintf(`date("%s")`, v.Interface().(time.Time).Format(time.RFC3339))
}
return fmt.Sprintf(`%v`, v.Interface())
}
}
func writeString(buffer *bytes.Buffer, str string) {
if _, err := buffer.WriteString(str); err != nil {
panic(err)
}
}