-
Notifications
You must be signed in to change notification settings - Fork 901
/
types.go
1980 lines (1721 loc) · 49.5 KB
/
types.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
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Copyright 2019-present Facebook Inc. All rights reserved.
// This source code is licensed under the Apache 2.0 license found
// in the LICENSE file in the root directory of this source tree.
// Code generated by internal/gen.go, DO NOT EDIT.
package entql
import (
"database/sql/driver"
"time"
)
//go:generate go run internal/gen.go
// Fielder is the interface for creating a predicate (entql.P)
// by a field name from the different builder types below.
type Fielder interface {
Field(string) P
}
// BoolP is the interface for predicates of type bool (`type P[bool]`).
type BoolP interface {
Fielder
bool()
}
// boolP implements the BoolP interface.
type boolP struct {
P
done func(string)
}
func (p *boolP) Field(name string) P {
p.done(name)
return p.P
}
func (*boolP) bool() {}
// BoolNil applies the Nil operation
func BoolNil() BoolP {
field := &Field{}
done := func(name string) { field.Name = name }
return &boolP{P: EQ(field, (*Value)(nil)), done: done}
}
// BoolNotNil applies the NotNil operation
func BoolNotNil() BoolP {
field := &Field{}
done := func(name string) { field.Name = name }
return &boolP{P: NEQ(field, (*Value)(nil)), done: done}
}
// BoolEQ applies the EQ operation on the given value.
func BoolEQ(v bool) BoolP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &boolP{P: EQ(field, value), done: done}
}
// BoolNEQ applies the NEQ operation on the given value.
func BoolNEQ(v bool) BoolP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &boolP{P: NEQ(field, value), done: done}
}
// BoolOr returns a composed predicate that represents the logical OR predicate.
func BoolOr(x, y BoolP, z ...BoolP) BoolP {
expr := &boolP{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = Or(x.Field(name), y.Field(name), zs...)
}
return expr
}
// BoolAnd returns a composed predicate that represents the logical AND predicate.
func BoolAnd(x, y BoolP, z ...BoolP) BoolP {
expr := &boolP{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = And(x.Field(name), y.Field(name), zs...)
}
return expr
}
// BoolNot returns a predicate that represents the logical negation of the given predicate.
func BoolNot(x BoolP) BoolP {
expr := &boolP{}
expr.done = func(name string) {
expr.P = Not(x.Field(name))
}
return expr
}
// BytesP is the interface for predicates of type []byte (`type P[[]byte]`).
type BytesP interface {
Fielder
bytes()
}
// bytesP implements the BytesP interface.
type bytesP struct {
P
done func(string)
}
func (p *bytesP) Field(name string) P {
p.done(name)
return p.P
}
func (*bytesP) bytes() {}
// BytesNil applies the Nil operation
func BytesNil() BytesP {
field := &Field{}
done := func(name string) { field.Name = name }
return &bytesP{P: EQ(field, (*Value)(nil)), done: done}
}
// BytesNotNil applies the NotNil operation
func BytesNotNil() BytesP {
field := &Field{}
done := func(name string) { field.Name = name }
return &bytesP{P: NEQ(field, (*Value)(nil)), done: done}
}
// BytesEQ applies the EQ operation on the given value.
func BytesEQ(v []byte) BytesP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &bytesP{P: EQ(field, value), done: done}
}
// BytesNEQ applies the NEQ operation on the given value.
func BytesNEQ(v []byte) BytesP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &bytesP{P: NEQ(field, value), done: done}
}
// BytesOr returns a composed predicate that represents the logical OR predicate.
func BytesOr(x, y BytesP, z ...BytesP) BytesP {
expr := &bytesP{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = Or(x.Field(name), y.Field(name), zs...)
}
return expr
}
// BytesAnd returns a composed predicate that represents the logical AND predicate.
func BytesAnd(x, y BytesP, z ...BytesP) BytesP {
expr := &bytesP{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = And(x.Field(name), y.Field(name), zs...)
}
return expr
}
// BytesNot returns a predicate that represents the logical negation of the given predicate.
func BytesNot(x BytesP) BytesP {
expr := &bytesP{}
expr.done = func(name string) {
expr.P = Not(x.Field(name))
}
return expr
}
// TimeP is the interface for predicates of type time.Time (`type P[time.Time]`).
type TimeP interface {
Fielder
time()
}
// timeP implements the TimeP interface.
type timeP struct {
P
done func(string)
}
func (p *timeP) Field(name string) P {
p.done(name)
return p.P
}
func (*timeP) time() {}
// TimeNil applies the Nil operation
func TimeNil() TimeP {
field := &Field{}
done := func(name string) { field.Name = name }
return &timeP{P: EQ(field, (*Value)(nil)), done: done}
}
// TimeNotNil applies the NotNil operation
func TimeNotNil() TimeP {
field := &Field{}
done := func(name string) { field.Name = name }
return &timeP{P: NEQ(field, (*Value)(nil)), done: done}
}
// TimeEQ applies the EQ operation on the given value.
func TimeEQ(v time.Time) TimeP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &timeP{P: EQ(field, value), done: done}
}
// TimeNEQ applies the NEQ operation on the given value.
func TimeNEQ(v time.Time) TimeP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &timeP{P: NEQ(field, value), done: done}
}
// TimeLT applies the LT operation on the given value.
func TimeLT(v time.Time) TimeP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &timeP{P: LT(field, value), done: done}
}
// TimeLTE applies the LTE operation on the given value.
func TimeLTE(v time.Time) TimeP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &timeP{P: LTE(field, value), done: done}
}
// TimeGT applies the GT operation on the given value.
func TimeGT(v time.Time) TimeP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &timeP{P: GT(field, value), done: done}
}
// TimeGTE applies the GTE operation on the given value.
func TimeGTE(v time.Time) TimeP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &timeP{P: GTE(field, value), done: done}
}
// TimeOr returns a composed predicate that represents the logical OR predicate.
func TimeOr(x, y TimeP, z ...TimeP) TimeP {
expr := &timeP{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = Or(x.Field(name), y.Field(name), zs...)
}
return expr
}
// TimeAnd returns a composed predicate that represents the logical AND predicate.
func TimeAnd(x, y TimeP, z ...TimeP) TimeP {
expr := &timeP{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = And(x.Field(name), y.Field(name), zs...)
}
return expr
}
// TimeNot returns a predicate that represents the logical negation of the given predicate.
func TimeNot(x TimeP) TimeP {
expr := &timeP{}
expr.done = func(name string) {
expr.P = Not(x.Field(name))
}
return expr
}
// UintP is the interface for predicates of type uint (`type P[uint]`).
type UintP interface {
Fielder
uint()
}
// uintP implements the UintP interface.
type uintP struct {
P
done func(string)
}
func (p *uintP) Field(name string) P {
p.done(name)
return p.P
}
func (*uintP) uint() {}
// UintNil applies the Nil operation
func UintNil() UintP {
field := &Field{}
done := func(name string) { field.Name = name }
return &uintP{P: EQ(field, (*Value)(nil)), done: done}
}
// UintNotNil applies the NotNil operation
func UintNotNil() UintP {
field := &Field{}
done := func(name string) { field.Name = name }
return &uintP{P: NEQ(field, (*Value)(nil)), done: done}
}
// UintEQ applies the EQ operation on the given value.
func UintEQ(v uint) UintP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uintP{P: EQ(field, value), done: done}
}
// UintNEQ applies the NEQ operation on the given value.
func UintNEQ(v uint) UintP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uintP{P: NEQ(field, value), done: done}
}
// UintLT applies the LT operation on the given value.
func UintLT(v uint) UintP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uintP{P: LT(field, value), done: done}
}
// UintLTE applies the LTE operation on the given value.
func UintLTE(v uint) UintP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uintP{P: LTE(field, value), done: done}
}
// UintGT applies the GT operation on the given value.
func UintGT(v uint) UintP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uintP{P: GT(field, value), done: done}
}
// UintGTE applies the GTE operation on the given value.
func UintGTE(v uint) UintP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uintP{P: GTE(field, value), done: done}
}
// UintOr returns a composed predicate that represents the logical OR predicate.
func UintOr(x, y UintP, z ...UintP) UintP {
expr := &uintP{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = Or(x.Field(name), y.Field(name), zs...)
}
return expr
}
// UintAnd returns a composed predicate that represents the logical AND predicate.
func UintAnd(x, y UintP, z ...UintP) UintP {
expr := &uintP{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = And(x.Field(name), y.Field(name), zs...)
}
return expr
}
// UintNot returns a predicate that represents the logical negation of the given predicate.
func UintNot(x UintP) UintP {
expr := &uintP{}
expr.done = func(name string) {
expr.P = Not(x.Field(name))
}
return expr
}
// Uint8P is the interface for predicates of type uint8 (`type P[uint8]`).
type Uint8P interface {
Fielder
uint8()
}
// uint8P implements the Uint8P interface.
type uint8P struct {
P
done func(string)
}
func (p *uint8P) Field(name string) P {
p.done(name)
return p.P
}
func (*uint8P) uint8() {}
// Uint8Nil applies the Nil operation
func Uint8Nil() Uint8P {
field := &Field{}
done := func(name string) { field.Name = name }
return &uint8P{P: EQ(field, (*Value)(nil)), done: done}
}
// Uint8NotNil applies the NotNil operation
func Uint8NotNil() Uint8P {
field := &Field{}
done := func(name string) { field.Name = name }
return &uint8P{P: NEQ(field, (*Value)(nil)), done: done}
}
// Uint8EQ applies the EQ operation on the given value.
func Uint8EQ(v uint8) Uint8P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint8P{P: EQ(field, value), done: done}
}
// Uint8NEQ applies the NEQ operation on the given value.
func Uint8NEQ(v uint8) Uint8P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint8P{P: NEQ(field, value), done: done}
}
// Uint8LT applies the LT operation on the given value.
func Uint8LT(v uint8) Uint8P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint8P{P: LT(field, value), done: done}
}
// Uint8LTE applies the LTE operation on the given value.
func Uint8LTE(v uint8) Uint8P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint8P{P: LTE(field, value), done: done}
}
// Uint8GT applies the GT operation on the given value.
func Uint8GT(v uint8) Uint8P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint8P{P: GT(field, value), done: done}
}
// Uint8GTE applies the GTE operation on the given value.
func Uint8GTE(v uint8) Uint8P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint8P{P: GTE(field, value), done: done}
}
// Uint8Or returns a composed predicate that represents the logical OR predicate.
func Uint8Or(x, y Uint8P, z ...Uint8P) Uint8P {
expr := &uint8P{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = Or(x.Field(name), y.Field(name), zs...)
}
return expr
}
// Uint8And returns a composed predicate that represents the logical AND predicate.
func Uint8And(x, y Uint8P, z ...Uint8P) Uint8P {
expr := &uint8P{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = And(x.Field(name), y.Field(name), zs...)
}
return expr
}
// Uint8Not returns a predicate that represents the logical negation of the given predicate.
func Uint8Not(x Uint8P) Uint8P {
expr := &uint8P{}
expr.done = func(name string) {
expr.P = Not(x.Field(name))
}
return expr
}
// Uint16P is the interface for predicates of type uint16 (`type P[uint16]`).
type Uint16P interface {
Fielder
uint16()
}
// uint16P implements the Uint16P interface.
type uint16P struct {
P
done func(string)
}
func (p *uint16P) Field(name string) P {
p.done(name)
return p.P
}
func (*uint16P) uint16() {}
// Uint16Nil applies the Nil operation
func Uint16Nil() Uint16P {
field := &Field{}
done := func(name string) { field.Name = name }
return &uint16P{P: EQ(field, (*Value)(nil)), done: done}
}
// Uint16NotNil applies the NotNil operation
func Uint16NotNil() Uint16P {
field := &Field{}
done := func(name string) { field.Name = name }
return &uint16P{P: NEQ(field, (*Value)(nil)), done: done}
}
// Uint16EQ applies the EQ operation on the given value.
func Uint16EQ(v uint16) Uint16P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint16P{P: EQ(field, value), done: done}
}
// Uint16NEQ applies the NEQ operation on the given value.
func Uint16NEQ(v uint16) Uint16P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint16P{P: NEQ(field, value), done: done}
}
// Uint16LT applies the LT operation on the given value.
func Uint16LT(v uint16) Uint16P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint16P{P: LT(field, value), done: done}
}
// Uint16LTE applies the LTE operation on the given value.
func Uint16LTE(v uint16) Uint16P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint16P{P: LTE(field, value), done: done}
}
// Uint16GT applies the GT operation on the given value.
func Uint16GT(v uint16) Uint16P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint16P{P: GT(field, value), done: done}
}
// Uint16GTE applies the GTE operation on the given value.
func Uint16GTE(v uint16) Uint16P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint16P{P: GTE(field, value), done: done}
}
// Uint16Or returns a composed predicate that represents the logical OR predicate.
func Uint16Or(x, y Uint16P, z ...Uint16P) Uint16P {
expr := &uint16P{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = Or(x.Field(name), y.Field(name), zs...)
}
return expr
}
// Uint16And returns a composed predicate that represents the logical AND predicate.
func Uint16And(x, y Uint16P, z ...Uint16P) Uint16P {
expr := &uint16P{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = And(x.Field(name), y.Field(name), zs...)
}
return expr
}
// Uint16Not returns a predicate that represents the logical negation of the given predicate.
func Uint16Not(x Uint16P) Uint16P {
expr := &uint16P{}
expr.done = func(name string) {
expr.P = Not(x.Field(name))
}
return expr
}
// Uint32P is the interface for predicates of type uint32 (`type P[uint32]`).
type Uint32P interface {
Fielder
uint32()
}
// uint32P implements the Uint32P interface.
type uint32P struct {
P
done func(string)
}
func (p *uint32P) Field(name string) P {
p.done(name)
return p.P
}
func (*uint32P) uint32() {}
// Uint32Nil applies the Nil operation
func Uint32Nil() Uint32P {
field := &Field{}
done := func(name string) { field.Name = name }
return &uint32P{P: EQ(field, (*Value)(nil)), done: done}
}
// Uint32NotNil applies the NotNil operation
func Uint32NotNil() Uint32P {
field := &Field{}
done := func(name string) { field.Name = name }
return &uint32P{P: NEQ(field, (*Value)(nil)), done: done}
}
// Uint32EQ applies the EQ operation on the given value.
func Uint32EQ(v uint32) Uint32P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint32P{P: EQ(field, value), done: done}
}
// Uint32NEQ applies the NEQ operation on the given value.
func Uint32NEQ(v uint32) Uint32P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint32P{P: NEQ(field, value), done: done}
}
// Uint32LT applies the LT operation on the given value.
func Uint32LT(v uint32) Uint32P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint32P{P: LT(field, value), done: done}
}
// Uint32LTE applies the LTE operation on the given value.
func Uint32LTE(v uint32) Uint32P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint32P{P: LTE(field, value), done: done}
}
// Uint32GT applies the GT operation on the given value.
func Uint32GT(v uint32) Uint32P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint32P{P: GT(field, value), done: done}
}
// Uint32GTE applies the GTE operation on the given value.
func Uint32GTE(v uint32) Uint32P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint32P{P: GTE(field, value), done: done}
}
// Uint32Or returns a composed predicate that represents the logical OR predicate.
func Uint32Or(x, y Uint32P, z ...Uint32P) Uint32P {
expr := &uint32P{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = Or(x.Field(name), y.Field(name), zs...)
}
return expr
}
// Uint32And returns a composed predicate that represents the logical AND predicate.
func Uint32And(x, y Uint32P, z ...Uint32P) Uint32P {
expr := &uint32P{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = And(x.Field(name), y.Field(name), zs...)
}
return expr
}
// Uint32Not returns a predicate that represents the logical negation of the given predicate.
func Uint32Not(x Uint32P) Uint32P {
expr := &uint32P{}
expr.done = func(name string) {
expr.P = Not(x.Field(name))
}
return expr
}
// Uint64P is the interface for predicates of type uint64 (`type P[uint64]`).
type Uint64P interface {
Fielder
uint64()
}
// uint64P implements the Uint64P interface.
type uint64P struct {
P
done func(string)
}
func (p *uint64P) Field(name string) P {
p.done(name)
return p.P
}
func (*uint64P) uint64() {}
// Uint64Nil applies the Nil operation
func Uint64Nil() Uint64P {
field := &Field{}
done := func(name string) { field.Name = name }
return &uint64P{P: EQ(field, (*Value)(nil)), done: done}
}
// Uint64NotNil applies the NotNil operation
func Uint64NotNil() Uint64P {
field := &Field{}
done := func(name string) { field.Name = name }
return &uint64P{P: NEQ(field, (*Value)(nil)), done: done}
}
// Uint64EQ applies the EQ operation on the given value.
func Uint64EQ(v uint64) Uint64P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint64P{P: EQ(field, value), done: done}
}
// Uint64NEQ applies the NEQ operation on the given value.
func Uint64NEQ(v uint64) Uint64P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint64P{P: NEQ(field, value), done: done}
}
// Uint64LT applies the LT operation on the given value.
func Uint64LT(v uint64) Uint64P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint64P{P: LT(field, value), done: done}
}
// Uint64LTE applies the LTE operation on the given value.
func Uint64LTE(v uint64) Uint64P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint64P{P: LTE(field, value), done: done}
}
// Uint64GT applies the GT operation on the given value.
func Uint64GT(v uint64) Uint64P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint64P{P: GT(field, value), done: done}
}
// Uint64GTE applies the GTE operation on the given value.
func Uint64GTE(v uint64) Uint64P {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &uint64P{P: GTE(field, value), done: done}
}
// Uint64Or returns a composed predicate that represents the logical OR predicate.
func Uint64Or(x, y Uint64P, z ...Uint64P) Uint64P {
expr := &uint64P{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = Or(x.Field(name), y.Field(name), zs...)
}
return expr
}
// Uint64And returns a composed predicate that represents the logical AND predicate.
func Uint64And(x, y Uint64P, z ...Uint64P) Uint64P {
expr := &uint64P{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = And(x.Field(name), y.Field(name), zs...)
}
return expr
}
// Uint64Not returns a predicate that represents the logical negation of the given predicate.
func Uint64Not(x Uint64P) Uint64P {
expr := &uint64P{}
expr.done = func(name string) {
expr.P = Not(x.Field(name))
}
return expr
}
// IntP is the interface for predicates of type int (`type P[int]`).
type IntP interface {
Fielder
int()
}
// intP implements the IntP interface.
type intP struct {
P
done func(string)
}
func (p *intP) Field(name string) P {
p.done(name)
return p.P
}
func (*intP) int() {}
// IntNil applies the Nil operation
func IntNil() IntP {
field := &Field{}
done := func(name string) { field.Name = name }
return &intP{P: EQ(field, (*Value)(nil)), done: done}
}
// IntNotNil applies the NotNil operation
func IntNotNil() IntP {
field := &Field{}
done := func(name string) { field.Name = name }
return &intP{P: NEQ(field, (*Value)(nil)), done: done}
}
// IntEQ applies the EQ operation on the given value.
func IntEQ(v int) IntP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &intP{P: EQ(field, value), done: done}
}
// IntNEQ applies the NEQ operation on the given value.
func IntNEQ(v int) IntP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &intP{P: NEQ(field, value), done: done}
}
// IntLT applies the LT operation on the given value.
func IntLT(v int) IntP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &intP{P: LT(field, value), done: done}
}
// IntLTE applies the LTE operation on the given value.
func IntLTE(v int) IntP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &intP{P: LTE(field, value), done: done}
}
// IntGT applies the GT operation on the given value.
func IntGT(v int) IntP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &intP{P: GT(field, value), done: done}
}
// IntGTE applies the GTE operation on the given value.
func IntGTE(v int) IntP {
field := &Field{}
value := &Value{V: v}
done := func(name string) { field.Name = name }
return &intP{P: GTE(field, value), done: done}
}
// IntOr returns a composed predicate that represents the logical OR predicate.
func IntOr(x, y IntP, z ...IntP) IntP {
expr := &intP{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = Or(x.Field(name), y.Field(name), zs...)
}
return expr
}
// IntAnd returns a composed predicate that represents the logical AND predicate.
func IntAnd(x, y IntP, z ...IntP) IntP {
expr := &intP{}
expr.done = func(name string) {
zs := make([]P, len(z))
for i := range z {
zs[i] = z[i].Field(name)
}
expr.P = And(x.Field(name), y.Field(name), zs...)
}
return expr
}
// IntNot returns a predicate that represents the logical negation of the given predicate.
func IntNot(x IntP) IntP {
expr := &intP{}
expr.done = func(name string) {
expr.P = Not(x.Field(name))
}
return expr
}