golang/ent
1
0
Fork 0
mirror of https://github.com/ent/ent.git synced 2026-05-22 09:31:45 +03:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source 
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
Download Patch File Download Diff File Expand all files Collapse all files

1
examples/start/ent/car/where.go
View File

@@ -267,7 +267,6 @@ func HasOwner() predicate.Car {
return predicate.Car(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.To(OwnerTable, FieldID),
sqlgraph.Edge(sqlgraph.M2O, true, OwnerTable, OwnerColumn),
)
sqlgraph.HasNeighbors(s, step)

1
examples/start/ent/group/where.go
View File

@@ -194,7 +194,6 @@ func HasUsers() predicate.Group {
return predicate.Group(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.To(UsersTable, FieldID),
sqlgraph.Edge(sqlgraph.M2M, false, UsersTable, UsersPrimaryKey...),
)
sqlgraph.HasNeighbors(s, step)

2
examples/start/ent/user/where.go
View File

@@ -265,7 +265,6 @@ func HasCars() predicate.User {
return predicate.User(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.To(CarsTable, FieldID),
sqlgraph.Edge(sqlgraph.O2M, false, CarsTable, CarsColumn),
)
sqlgraph.HasNeighbors(s, step)
@@ -293,7 +292,6 @@ func HasGroups() predicate.User {
return predicate.User(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.To(GroupsTable, FieldID),
sqlgraph.Edge(sqlgraph.M2M, true, GroupsTable, GroupsPrimaryKey...),
)
sqlgraph.HasNeighbors(s, step)