entc/gen: remove unnecessary sqlgraph.To step on HasE predicates (#3144)

Predicate that checks existence-only do not need the 'other' table
This commit is contained in:
Ariel Mashraki
2022-12-04 13:15:16 +02:00
committed by GitHub
parent 3f1d7c960e
commit 381483e45c
91 changed files with 2 additions and 202 deletions

View File

@@ -159,7 +159,6 @@ func HasParent() predicate.Node {
return predicate.Node(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)
@@ -187,7 +186,6 @@ func HasChildren() predicate.Node {
return predicate.Node(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)