/
where.go
531 lines (463 loc) · 14 KB
/
where.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
// Copyright (c) Facebook, Inc. and its affiliates. 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 entc, DO NOT EDIT.
package file
import (
"github.com/facebookincubator/ent/dialect/gremlin/graph/dsl"
"github.com/facebookincubator/ent/dialect/gremlin/graph/dsl/__"
"github.com/facebookincubator/ent/dialect/gremlin/graph/dsl/p"
"github.com/facebookincubator/ent/entc/integration/gremlin/ent/predicate"
)
// ID filters vertices based on their identifier.
func ID(id string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.HasID(id)
})
}
// IDEQ applies the EQ predicate on the ID field.
func IDEQ(id string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.HasID(p.EQ(id))
})
}
// IDNEQ applies the NEQ predicate on the ID field.
func IDNEQ(id string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.HasID(p.NEQ(id))
})
}
// IDIn applies the In predicate on the ID field.
func IDIn(ids ...string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
v := make([]interface{}, len(ids))
for i := range v {
v[i] = ids[i]
}
t.HasID(p.Within(v...))
})
}
// IDNotIn applies the NotIn predicate on the ID field.
func IDNotIn(ids ...string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
v := make([]interface{}, len(ids))
for i := range v {
v[i] = ids[i]
}
t.HasID(p.Without(v...))
})
}
// IDGT applies the GT predicate on the ID field.
func IDGT(id string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.HasID(p.GT(id))
})
}
// IDGTE applies the GTE predicate on the ID field.
func IDGTE(id string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.HasID(p.GTE(id))
})
}
// IDLT applies the LT predicate on the ID field.
func IDLT(id string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.HasID(p.LT(id))
})
}
// IDLTE applies the LTE predicate on the ID field.
func IDLTE(id string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.HasID(p.LTE(id))
})
}
// Size applies equality check predicate on the "size" field. It's identical to SizeEQ.
func Size(v int) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldSize, p.EQ(v))
})
}
// Name applies equality check predicate on the "name" field. It's identical to NameEQ.
func Name(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.EQ(v))
})
}
// User applies equality check predicate on the "user" field. It's identical to UserEQ.
func User(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldUser, p.EQ(v))
})
}
// Group applies equality check predicate on the "group" field. It's identical to GroupEQ.
func Group(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldGroup, p.EQ(v))
})
}
// SizeEQ applies the EQ predicate on the "size" field.
func SizeEQ(v int) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldSize, p.EQ(v))
})
}
// SizeNEQ applies the NEQ predicate on the "size" field.
func SizeNEQ(v int) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldSize, p.NEQ(v))
})
}
// SizeIn applies the In predicate on the "size" field.
func SizeIn(vs ...int) predicate.File {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = vs[i]
}
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldSize, p.Within(v...))
})
}
// SizeNotIn applies the NotIn predicate on the "size" field.
func SizeNotIn(vs ...int) predicate.File {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = vs[i]
}
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldSize, p.Without(v...))
})
}
// SizeGT applies the GT predicate on the "size" field.
func SizeGT(v int) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldSize, p.GT(v))
})
}
// SizeGTE applies the GTE predicate on the "size" field.
func SizeGTE(v int) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldSize, p.GTE(v))
})
}
// SizeLT applies the LT predicate on the "size" field.
func SizeLT(v int) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldSize, p.LT(v))
})
}
// SizeLTE applies the LTE predicate on the "size" field.
func SizeLTE(v int) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldSize, p.LTE(v))
})
}
// NameEQ applies the EQ predicate on the "name" field.
func NameEQ(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.EQ(v))
})
}
// NameNEQ applies the NEQ predicate on the "name" field.
func NameNEQ(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.NEQ(v))
})
}
// NameIn applies the In predicate on the "name" field.
func NameIn(vs ...string) predicate.File {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = vs[i]
}
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.Within(v...))
})
}
// NameNotIn applies the NotIn predicate on the "name" field.
func NameNotIn(vs ...string) predicate.File {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = vs[i]
}
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.Without(v...))
})
}
// NameGT applies the GT predicate on the "name" field.
func NameGT(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.GT(v))
})
}
// NameGTE applies the GTE predicate on the "name" field.
func NameGTE(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.GTE(v))
})
}
// NameLT applies the LT predicate on the "name" field.
func NameLT(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.LT(v))
})
}
// NameLTE applies the LTE predicate on the "name" field.
func NameLTE(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.LTE(v))
})
}
// NameContains applies the Contains predicate on the "name" field.
func NameContains(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.Containing(v))
})
}
// NameHasPrefix applies the HasPrefix predicate on the "name" field.
func NameHasPrefix(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.StartingWith(v))
})
}
// NameHasSuffix applies the HasSuffix predicate on the "name" field.
func NameHasSuffix(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.EndingWith(v))
})
}
// UserEQ applies the EQ predicate on the "user" field.
func UserEQ(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldUser, p.EQ(v))
})
}
// UserNEQ applies the NEQ predicate on the "user" field.
func UserNEQ(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldUser, p.NEQ(v))
})
}
// UserIn applies the In predicate on the "user" field.
func UserIn(vs ...string) predicate.File {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = vs[i]
}
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldUser, p.Within(v...))
})
}
// UserNotIn applies the NotIn predicate on the "user" field.
func UserNotIn(vs ...string) predicate.File {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = vs[i]
}
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldUser, p.Without(v...))
})
}
// UserGT applies the GT predicate on the "user" field.
func UserGT(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldUser, p.GT(v))
})
}
// UserGTE applies the GTE predicate on the "user" field.
func UserGTE(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldUser, p.GTE(v))
})
}
// UserLT applies the LT predicate on the "user" field.
func UserLT(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldUser, p.LT(v))
})
}
// UserLTE applies the LTE predicate on the "user" field.
func UserLTE(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldUser, p.LTE(v))
})
}
// UserContains applies the Contains predicate on the "user" field.
func UserContains(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldUser, p.Containing(v))
})
}
// UserHasPrefix applies the HasPrefix predicate on the "user" field.
func UserHasPrefix(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldUser, p.StartingWith(v))
})
}
// UserHasSuffix applies the HasSuffix predicate on the "user" field.
func UserHasSuffix(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldUser, p.EndingWith(v))
})
}
// UserIsNil applies the IsNil predicate on the "user" field.
func UserIsNil() predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.HasLabel(Label).HasNot(FieldUser)
})
}
// UserNotNil applies the NotNil predicate on the "user" field.
func UserNotNil() predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.HasLabel(Label).Has(FieldUser)
})
}
// GroupEQ applies the EQ predicate on the "group" field.
func GroupEQ(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldGroup, p.EQ(v))
})
}
// GroupNEQ applies the NEQ predicate on the "group" field.
func GroupNEQ(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldGroup, p.NEQ(v))
})
}
// GroupIn applies the In predicate on the "group" field.
func GroupIn(vs ...string) predicate.File {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = vs[i]
}
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldGroup, p.Within(v...))
})
}
// GroupNotIn applies the NotIn predicate on the "group" field.
func GroupNotIn(vs ...string) predicate.File {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = vs[i]
}
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldGroup, p.Without(v...))
})
}
// GroupGT applies the GT predicate on the "group" field.
func GroupGT(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldGroup, p.GT(v))
})
}
// GroupGTE applies the GTE predicate on the "group" field.
func GroupGTE(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldGroup, p.GTE(v))
})
}
// GroupLT applies the LT predicate on the "group" field.
func GroupLT(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldGroup, p.LT(v))
})
}
// GroupLTE applies the LTE predicate on the "group" field.
func GroupLTE(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldGroup, p.LTE(v))
})
}
// GroupContains applies the Contains predicate on the "group" field.
func GroupContains(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldGroup, p.Containing(v))
})
}
// GroupHasPrefix applies the HasPrefix predicate on the "group" field.
func GroupHasPrefix(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldGroup, p.StartingWith(v))
})
}
// GroupHasSuffix applies the HasSuffix predicate on the "group" field.
func GroupHasSuffix(v string) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.Has(Label, FieldGroup, p.EndingWith(v))
})
}
// GroupIsNil applies the IsNil predicate on the "group" field.
func GroupIsNil() predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.HasLabel(Label).HasNot(FieldGroup)
})
}
// GroupNotNil applies the NotNil predicate on the "group" field.
func GroupNotNil() predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.HasLabel(Label).Has(FieldGroup)
})
}
// HasOwner applies the HasEdge predicate on the "owner" edge.
func HasOwner() predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.InE(OwnerInverseLabel).InV()
})
}
// HasOwnerWith applies the HasEdge predicate on the "owner" edge with a given conditions (other predicates).
func HasOwnerWith(preds ...predicate.User) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
tr := __.OutV()
for _, p := range preds {
p(tr)
}
t.InE(OwnerInverseLabel).Where(tr).InV()
})
}
// HasType applies the HasEdge predicate on the "type" edge.
func HasType() predicate.File {
return predicate.File(func(t *dsl.Traversal) {
t.InE(TypeInverseLabel).InV()
})
}
// HasTypeWith applies the HasEdge predicate on the "type" edge with a given conditions (other predicates).
func HasTypeWith(preds ...predicate.FileType) predicate.File {
return predicate.File(func(t *dsl.Traversal) {
tr := __.OutV()
for _, p := range preds {
p(tr)
}
t.InE(TypeInverseLabel).Where(tr).InV()
})
}
// And groups list of predicates with the AND operator between them.
func And(predicates ...predicate.File) predicate.File {
return predicate.File(func(tr *dsl.Traversal) {
trs := make([]interface{}, 0, len(predicates))
for _, p := range predicates {
t := __.New()
p(t)
trs = append(trs, t)
}
tr.Where(__.And(trs...))
})
}
// Or groups list of predicates with the OR operator between them.
func Or(predicates ...predicate.File) predicate.File {
return predicate.File(func(tr *dsl.Traversal) {
trs := make([]interface{}, 0, len(predicates))
for _, p := range predicates {
t := __.New()
p(t)
trs = append(trs, t)
}
tr.Where(__.Or(trs...))
})
}
// Not applies the not operator on the given predicate.
func Not(p predicate.File) predicate.File {
return predicate.File(func(tr *dsl.Traversal) {
t := __.New()
p(t)
tr.Where(__.Not(t))
})
}