121 lines
3.6 KiB
Go
121 lines
3.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 intsid
|
|
|
|
import (
|
|
"entgo.io/ent/dialect/sql"
|
|
"entgo.io/ent/dialect/sql/sqlgraph"
|
|
"entgo.io/ent/entc/integration/customid/ent/predicate"
|
|
"entgo.io/ent/entc/integration/customid/sid"
|
|
)
|
|
|
|
// ID filters vertices based on their ID field.
|
|
func ID(id sid.ID) predicate.IntSID {
|
|
return predicate.IntSID(sql.FieldEQ(FieldID, id))
|
|
}
|
|
|
|
// IDEQ applies the EQ predicate on the ID field.
|
|
func IDEQ(id sid.ID) predicate.IntSID {
|
|
return predicate.IntSID(sql.FieldEQ(FieldID, id))
|
|
}
|
|
|
|
// IDNEQ applies the NEQ predicate on the ID field.
|
|
func IDNEQ(id sid.ID) predicate.IntSID {
|
|
return predicate.IntSID(sql.FieldNEQ(FieldID, id))
|
|
}
|
|
|
|
// IDIn applies the In predicate on the ID field.
|
|
func IDIn(ids ...sid.ID) predicate.IntSID {
|
|
return predicate.IntSID(sql.FieldIn(FieldID, ids...))
|
|
}
|
|
|
|
// IDNotIn applies the NotIn predicate on the ID field.
|
|
func IDNotIn(ids ...sid.ID) predicate.IntSID {
|
|
return predicate.IntSID(sql.FieldNotIn(FieldID, ids...))
|
|
}
|
|
|
|
// IDGT applies the GT predicate on the ID field.
|
|
func IDGT(id sid.ID) predicate.IntSID {
|
|
return predicate.IntSID(sql.FieldGT(FieldID, id))
|
|
}
|
|
|
|
// IDGTE applies the GTE predicate on the ID field.
|
|
func IDGTE(id sid.ID) predicate.IntSID {
|
|
return predicate.IntSID(sql.FieldGTE(FieldID, id))
|
|
}
|
|
|
|
// IDLT applies the LT predicate on the ID field.
|
|
func IDLT(id sid.ID) predicate.IntSID {
|
|
return predicate.IntSID(sql.FieldLT(FieldID, id))
|
|
}
|
|
|
|
// IDLTE applies the LTE predicate on the ID field.
|
|
func IDLTE(id sid.ID) predicate.IntSID {
|
|
return predicate.IntSID(sql.FieldLTE(FieldID, id))
|
|
}
|
|
|
|
// HasParent applies the HasEdge predicate on the "parent" edge.
|
|
func HasParent() predicate.IntSID {
|
|
return predicate.IntSID(func(s *sql.Selector) {
|
|
step := sqlgraph.NewStep(
|
|
sqlgraph.From(Table, FieldID),
|
|
sqlgraph.Edge(sqlgraph.M2O, false, 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.IntSID) predicate.IntSID {
|
|
return predicate.IntSID(func(s *sql.Selector) {
|
|
step := newParentStep()
|
|
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.IntSID {
|
|
return predicate.IntSID(func(s *sql.Selector) {
|
|
step := sqlgraph.NewStep(
|
|
sqlgraph.From(Table, FieldID),
|
|
sqlgraph.Edge(sqlgraph.O2M, true, 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.IntSID) predicate.IntSID {
|
|
return predicate.IntSID(func(s *sql.Selector) {
|
|
step := newChildrenStep()
|
|
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.IntSID) predicate.IntSID {
|
|
return predicate.IntSID(sql.AndPredicates(predicates...))
|
|
}
|
|
|
|
// Or groups predicates with the OR operator between them.
|
|
func Or(predicates ...predicate.IntSID) predicate.IntSID {
|
|
return predicate.IntSID(sql.OrPredicates(predicates...))
|
|
}
|
|
|
|
// Not applies the not operator on the given predicate.
|
|
func Not(p predicate.IntSID) predicate.IntSID {
|
|
return predicate.IntSID(sql.NotPredicates(p))
|
|
}
|