mirror of
https://github.com/ent/ent.git
synced 2026-05-24 09:31:56 +03:00
357 lines
9.6 KiB
Go
357 lines
9.6 KiB
Go
// 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 file
|
|
|
|
import (
|
|
"entgo.io/ent/dialect/sql"
|
|
"entgo.io/ent/dialect/sql/sqlgraph"
|
|
"entgo.io/ent/examples/fs/ent/predicate"
|
|
)
|
|
|
|
// ID filters vertices based on their ID field.
|
|
func ID(id int) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.EQ(s.C(FieldID), id))
|
|
})
|
|
}
|
|
|
|
// IDEQ applies the EQ predicate on the ID field.
|
|
func IDEQ(id int) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.EQ(s.C(FieldID), id))
|
|
})
|
|
}
|
|
|
|
// IDNEQ applies the NEQ predicate on the ID field.
|
|
func IDNEQ(id int) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.NEQ(s.C(FieldID), id))
|
|
})
|
|
}
|
|
|
|
// IDIn applies the In predicate on the ID field.
|
|
func IDIn(ids ...int) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
v := make([]interface{}, len(ids))
|
|
for i := range v {
|
|
v[i] = ids[i]
|
|
}
|
|
s.Where(sql.In(s.C(FieldID), v...))
|
|
})
|
|
}
|
|
|
|
// IDNotIn applies the NotIn predicate on the ID field.
|
|
func IDNotIn(ids ...int) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
v := make([]interface{}, len(ids))
|
|
for i := range v {
|
|
v[i] = ids[i]
|
|
}
|
|
s.Where(sql.NotIn(s.C(FieldID), v...))
|
|
})
|
|
}
|
|
|
|
// IDGT applies the GT predicate on the ID field.
|
|
func IDGT(id int) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.GT(s.C(FieldID), id))
|
|
})
|
|
}
|
|
|
|
// IDGTE applies the GTE predicate on the ID field.
|
|
func IDGTE(id int) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.GTE(s.C(FieldID), id))
|
|
})
|
|
}
|
|
|
|
// IDLT applies the LT predicate on the ID field.
|
|
func IDLT(id int) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.LT(s.C(FieldID), id))
|
|
})
|
|
}
|
|
|
|
// IDLTE applies the LTE predicate on the ID field.
|
|
func IDLTE(id int) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.LTE(s.C(FieldID), id))
|
|
})
|
|
}
|
|
|
|
// Name applies equality check predicate on the "name" field. It's identical to NameEQ.
|
|
func Name(v string) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.EQ(s.C(FieldName), v))
|
|
})
|
|
}
|
|
|
|
// Deleted applies equality check predicate on the "deleted" field. It's identical to DeletedEQ.
|
|
func Deleted(v bool) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.EQ(s.C(FieldDeleted), v))
|
|
})
|
|
}
|
|
|
|
// ParentID applies equality check predicate on the "parent_id" field. It's identical to ParentIDEQ.
|
|
func ParentID(v int) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.EQ(s.C(FieldParentID), v))
|
|
})
|
|
}
|
|
|
|
// NameEQ applies the EQ predicate on the "name" field.
|
|
func NameEQ(v string) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.EQ(s.C(FieldName), v))
|
|
})
|
|
}
|
|
|
|
// NameNEQ applies the NEQ predicate on the "name" field.
|
|
func NameNEQ(v string) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.NEQ(s.C(FieldName), 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(s *sql.Selector) {
|
|
s.Where(sql.In(s.C(FieldName), 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(s *sql.Selector) {
|
|
s.Where(sql.NotIn(s.C(FieldName), v...))
|
|
})
|
|
}
|
|
|
|
// NameGT applies the GT predicate on the "name" field.
|
|
func NameGT(v string) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.GT(s.C(FieldName), v))
|
|
})
|
|
}
|
|
|
|
// NameGTE applies the GTE predicate on the "name" field.
|
|
func NameGTE(v string) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.GTE(s.C(FieldName), v))
|
|
})
|
|
}
|
|
|
|
// NameLT applies the LT predicate on the "name" field.
|
|
func NameLT(v string) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.LT(s.C(FieldName), v))
|
|
})
|
|
}
|
|
|
|
// NameLTE applies the LTE predicate on the "name" field.
|
|
func NameLTE(v string) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.LTE(s.C(FieldName), v))
|
|
})
|
|
}
|
|
|
|
// NameContains applies the Contains predicate on the "name" field.
|
|
func NameContains(v string) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.Contains(s.C(FieldName), v))
|
|
})
|
|
}
|
|
|
|
// NameHasPrefix applies the HasPrefix predicate on the "name" field.
|
|
func NameHasPrefix(v string) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.HasPrefix(s.C(FieldName), v))
|
|
})
|
|
}
|
|
|
|
// NameHasSuffix applies the HasSuffix predicate on the "name" field.
|
|
func NameHasSuffix(v string) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.HasSuffix(s.C(FieldName), v))
|
|
})
|
|
}
|
|
|
|
// NameEqualFold applies the EqualFold predicate on the "name" field.
|
|
func NameEqualFold(v string) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.EqualFold(s.C(FieldName), v))
|
|
})
|
|
}
|
|
|
|
// NameContainsFold applies the ContainsFold predicate on the "name" field.
|
|
func NameContainsFold(v string) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.ContainsFold(s.C(FieldName), v))
|
|
})
|
|
}
|
|
|
|
// DeletedEQ applies the EQ predicate on the "deleted" field.
|
|
func DeletedEQ(v bool) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.EQ(s.C(FieldDeleted), v))
|
|
})
|
|
}
|
|
|
|
// DeletedNEQ applies the NEQ predicate on the "deleted" field.
|
|
func DeletedNEQ(v bool) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.NEQ(s.C(FieldDeleted), v))
|
|
})
|
|
}
|
|
|
|
// ParentIDEQ applies the EQ predicate on the "parent_id" field.
|
|
func ParentIDEQ(v int) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.EQ(s.C(FieldParentID), v))
|
|
})
|
|
}
|
|
|
|
// ParentIDNEQ applies the NEQ predicate on the "parent_id" field.
|
|
func ParentIDNEQ(v int) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.NEQ(s.C(FieldParentID), v))
|
|
})
|
|
}
|
|
|
|
// ParentIDIn applies the In predicate on the "parent_id" field.
|
|
func ParentIDIn(vs ...int) predicate.File {
|
|
v := make([]interface{}, len(vs))
|
|
for i := range v {
|
|
v[i] = vs[i]
|
|
}
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.In(s.C(FieldParentID), v...))
|
|
})
|
|
}
|
|
|
|
// ParentIDNotIn applies the NotIn predicate on the "parent_id" field.
|
|
func ParentIDNotIn(vs ...int) predicate.File {
|
|
v := make([]interface{}, len(vs))
|
|
for i := range v {
|
|
v[i] = vs[i]
|
|
}
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.NotIn(s.C(FieldParentID), v...))
|
|
})
|
|
}
|
|
|
|
// ParentIDIsNil applies the IsNil predicate on the "parent_id" field.
|
|
func ParentIDIsNil() predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.IsNull(s.C(FieldParentID)))
|
|
})
|
|
}
|
|
|
|
// ParentIDNotNil applies the NotNil predicate on the "parent_id" field.
|
|
func ParentIDNotNil() predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
s.Where(sql.NotNull(s.C(FieldParentID)))
|
|
})
|
|
}
|
|
|
|
// HasParent applies the HasEdge predicate on the "parent" edge.
|
|
func HasParent() predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
step := sqlgraph.NewStep(
|
|
sqlgraph.From(Table, FieldID),
|
|
sqlgraph.To(ParentTable, FieldID),
|
|
sqlgraph.Edge(sqlgraph.M2O, true, ParentTable, ParentColumn),
|
|
)
|
|
sqlgraph.HasNeighbors(s, step)
|
|
})
|
|
}
|
|
|
|
// HasParentWith applies the HasEdge predicate on the "parent" edge with a given conditions (other predicates).
|
|
func HasParentWith(preds ...predicate.File) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
step := sqlgraph.NewStep(
|
|
sqlgraph.From(Table, FieldID),
|
|
sqlgraph.To(Table, FieldID),
|
|
sqlgraph.Edge(sqlgraph.M2O, true, ParentTable, ParentColumn),
|
|
)
|
|
sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
|
|
for _, p := range preds {
|
|
p(s)
|
|
}
|
|
})
|
|
})
|
|
}
|
|
|
|
// HasChildren applies the HasEdge predicate on the "children" edge.
|
|
func HasChildren() predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
step := sqlgraph.NewStep(
|
|
sqlgraph.From(Table, FieldID),
|
|
sqlgraph.To(ChildrenTable, FieldID),
|
|
sqlgraph.Edge(sqlgraph.O2M, false, ChildrenTable, ChildrenColumn),
|
|
)
|
|
sqlgraph.HasNeighbors(s, step)
|
|
})
|
|
}
|
|
|
|
// HasChildrenWith applies the HasEdge predicate on the "children" edge with a given conditions (other predicates).
|
|
func HasChildrenWith(preds ...predicate.File) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
step := sqlgraph.NewStep(
|
|
sqlgraph.From(Table, FieldID),
|
|
sqlgraph.To(Table, FieldID),
|
|
sqlgraph.Edge(sqlgraph.O2M, false, ChildrenTable, ChildrenColumn),
|
|
)
|
|
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.File) predicate.File {
|
|
return predicate.File(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.File) predicate.File {
|
|
return predicate.File(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.File) predicate.File {
|
|
return predicate.File(func(s *sql.Selector) {
|
|
p(s.Not())
|
|
})
|
|
}
|