/
where.go
162 lines (136 loc) · 4.44 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
// 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 ent, DO NOT EDIT.
package blog
import (
"entgo.io/ent/dialect/sql"
"entgo.io/ent/dialect/sql/sqlgraph"
"entgo.io/ent/entc/integration/migrate/entv2/predicate"
)
// ID filters vertices based on their ID field.
func ID(id int) predicate.Blog {
return predicate.Blog(sql.FieldEQ(FieldID, id))
}
// IDEQ applies the EQ predicate on the ID field.
func IDEQ(id int) predicate.Blog {
return predicate.Blog(sql.FieldEQ(FieldID, id))
}
// IDNEQ applies the NEQ predicate on the ID field.
func IDNEQ(id int) predicate.Blog {
return predicate.Blog(sql.FieldNEQ(FieldID, id))
}
// IDIn applies the In predicate on the ID field.
func IDIn(ids ...int) predicate.Blog {
return predicate.Blog(sql.FieldIn(FieldID, ids...))
}
// IDNotIn applies the NotIn predicate on the ID field.
func IDNotIn(ids ...int) predicate.Blog {
return predicate.Blog(sql.FieldNotIn(FieldID, ids...))
}
// IDGT applies the GT predicate on the ID field.
func IDGT(id int) predicate.Blog {
return predicate.Blog(sql.FieldGT(FieldID, id))
}
// IDGTE applies the GTE predicate on the ID field.
func IDGTE(id int) predicate.Blog {
return predicate.Blog(sql.FieldGTE(FieldID, id))
}
// IDLT applies the LT predicate on the ID field.
func IDLT(id int) predicate.Blog {
return predicate.Blog(sql.FieldLT(FieldID, id))
}
// IDLTE applies the LTE predicate on the ID field.
func IDLTE(id int) predicate.Blog {
return predicate.Blog(sql.FieldLTE(FieldID, id))
}
// Oid applies equality check predicate on the "oid" field. It's identical to OidEQ.
func Oid(v int) predicate.Blog {
return predicate.Blog(sql.FieldEQ(FieldOid, v))
}
// OidEQ applies the EQ predicate on the "oid" field.
func OidEQ(v int) predicate.Blog {
return predicate.Blog(sql.FieldEQ(FieldOid, v))
}
// OidNEQ applies the NEQ predicate on the "oid" field.
func OidNEQ(v int) predicate.Blog {
return predicate.Blog(sql.FieldNEQ(FieldOid, v))
}
// OidIn applies the In predicate on the "oid" field.
func OidIn(vs ...int) predicate.Blog {
return predicate.Blog(sql.FieldIn(FieldOid, vs...))
}
// OidNotIn applies the NotIn predicate on the "oid" field.
func OidNotIn(vs ...int) predicate.Blog {
return predicate.Blog(sql.FieldNotIn(FieldOid, vs...))
}
// OidGT applies the GT predicate on the "oid" field.
func OidGT(v int) predicate.Blog {
return predicate.Blog(sql.FieldGT(FieldOid, v))
}
// OidGTE applies the GTE predicate on the "oid" field.
func OidGTE(v int) predicate.Blog {
return predicate.Blog(sql.FieldGTE(FieldOid, v))
}
// OidLT applies the LT predicate on the "oid" field.
func OidLT(v int) predicate.Blog {
return predicate.Blog(sql.FieldLT(FieldOid, v))
}
// OidLTE applies the LTE predicate on the "oid" field.
func OidLTE(v int) predicate.Blog {
return predicate.Blog(sql.FieldLTE(FieldOid, v))
}
// HasAdmins applies the HasEdge predicate on the "admins" edge.
func HasAdmins() predicate.Blog {
return predicate.Blog(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.Edge(sqlgraph.O2M, false, AdminsTable, AdminsColumn),
)
sqlgraph.HasNeighbors(s, step)
})
}
// HasAdminsWith applies the HasEdge predicate on the "admins" edge with a given conditions (other predicates).
func HasAdminsWith(preds ...predicate.User) predicate.Blog {
return predicate.Blog(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.To(AdminsInverseTable, UserFieldID),
sqlgraph.Edge(sqlgraph.O2M, false, AdminsTable, AdminsColumn),
)
sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
for _, p := range preds {
p(s)
}
})
})
}
// And groups predicates with the AND operator between them.
func And(predicates ...predicate.Blog) predicate.Blog {
return predicate.Blog(func(s *sql.Selector) {
s1 := s.Clone().SetP(nil)
for _, p := range predicates {
p(s1)
}
s.Where(s1.P())
})
}
// Or groups predicates with the OR operator between them.
func Or(predicates ...predicate.Blog) predicate.Blog {
return predicate.Blog(func(s *sql.Selector) {
s1 := s.Clone().SetP(nil)
for i, p := range predicates {
if i > 0 {
s1.Or()
}
p(s1)
}
s.Where(s1.P())
})
}
// Not applies the not operator on the given predicate.
func Not(p predicate.Blog) predicate.Blog {
return predicate.Blog(func(s *sql.Selector) {
p(s.Not())
})
}