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
|
// 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 entc, DO NOT EDIT.
package task
import (
"github.com/facebook/ent/dialect/gremlin/graph/dsl"
"github.com/facebook/ent/dialect/gremlin/graph/dsl/__"
"github.com/facebook/ent/dialect/gremlin/graph/dsl/p"
"github.com/facebook/ent/entc/integration/ent/schema"
"github.com/facebook/ent/entc/integration/gremlin/ent/predicate"
)
// ID filters vertices based on their ID field.
func ID(id string) predicate.Task {
return predicate.Task(func(t *dsl.Traversal) {
t.HasID(id)
})
}
// IDEQ applies the EQ predicate on the ID field.
func IDEQ(id string) predicate.Task {
return predicate.Task(func(t *dsl.Traversal) {
t.HasID(p.EQ(id))
})
}
// IDNEQ applies the NEQ predicate on the ID field.
func IDNEQ(id string) predicate.Task {
return predicate.Task(func(t *dsl.Traversal) {
t.HasID(p.NEQ(id))
})
}
// IDIn applies the In predicate on the ID field.
func IDIn(ids ...string) predicate.Task {
return predicate.Task(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.Task {
return predicate.Task(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.Task {
return predicate.Task(func(t *dsl.Traversal) {
t.HasID(p.GT(id))
})
}
// IDGTE applies the GTE predicate on the ID field.
func IDGTE(id string) predicate.Task {
return predicate.Task(func(t *dsl.Traversal) {
t.HasID(p.GTE(id))
})
}
// IDLT applies the LT predicate on the ID field.
func IDLT(id string) predicate.Task {
return predicate.Task(func(t *dsl.Traversal) {
t.HasID(p.LT(id))
})
}
// IDLTE applies the LTE predicate on the ID field.
func IDLTE(id string) predicate.Task {
return predicate.Task(func(t *dsl.Traversal) {
t.HasID(p.LTE(id))
})
}
// Priority applies equality check predicate on the "priority" field. It's identical to PriorityEQ.
func Priority(v schema.Priority) predicate.Task {
vc := int(v)
return predicate.Task(func(t *dsl.Traversal) {
t.Has(Label, FieldPriority, p.EQ(vc))
})
}
// PriorityEQ applies the EQ predicate on the "priority" field.
func PriorityEQ(v schema.Priority) predicate.Task {
vc := int(v)
return predicate.Task(func(t *dsl.Traversal) {
t.Has(Label, FieldPriority, p.EQ(vc))
})
}
// PriorityNEQ applies the NEQ predicate on the "priority" field.
func PriorityNEQ(v schema.Priority) predicate.Task {
vc := int(v)
return predicate.Task(func(t *dsl.Traversal) {
t.Has(Label, FieldPriority, p.NEQ(vc))
})
}
// PriorityIn applies the In predicate on the "priority" field.
func PriorityIn(vs ...schema.Priority) predicate.Task {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = int(vs[i])
}
return predicate.Task(func(t *dsl.Traversal) {
t.Has(Label, FieldPriority, p.Within(v...))
})
}
// PriorityNotIn applies the NotIn predicate on the "priority" field.
func PriorityNotIn(vs ...schema.Priority) predicate.Task {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = int(vs[i])
}
return predicate.Task(func(t *dsl.Traversal) {
t.Has(Label, FieldPriority, p.Without(v...))
})
}
// PriorityGT applies the GT predicate on the "priority" field.
func PriorityGT(v schema.Priority) predicate.Task {
vc := int(v)
return predicate.Task(func(t *dsl.Traversal) {
t.Has(Label, FieldPriority, p.GT(vc))
})
}
// PriorityGTE applies the GTE predicate on the "priority" field.
func PriorityGTE(v schema.Priority) predicate.Task {
vc := int(v)
return predicate.Task(func(t *dsl.Traversal) {
t.Has(Label, FieldPriority, p.GTE(vc))
})
}
// PriorityLT applies the LT predicate on the "priority" field.
func PriorityLT(v schema.Priority) predicate.Task {
vc := int(v)
return predicate.Task(func(t *dsl.Traversal) {
t.Has(Label, FieldPriority, p.LT(vc))
})
}
// PriorityLTE applies the LTE predicate on the "priority" field.
func PriorityLTE(v schema.Priority) predicate.Task {
vc := int(v)
return predicate.Task(func(t *dsl.Traversal) {
t.Has(Label, FieldPriority, p.LTE(vc))
})
}
// And groups predicates with the AND operator between them.
func And(predicates ...predicate.Task) predicate.Task {
return predicate.Task(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 predicates with the OR operator between them.
func Or(predicates ...predicate.Task) predicate.Task {
return predicate.Task(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.Task) predicate.Task {
return predicate.Task(func(tr *dsl.Traversal) {
t := __.New()
p(t)
tr.Where(__.Not(t))
})
}
|
