golang/ent
1
0
Fork 0
mirror of https://github.com/ent/ent.git synced 2026-05-24 09:31:56 +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
entc/integration/hooks/ent/card/where.go
View File

@@ -493,7 +493,6 @@ func HasOwner() predicate.Card {
return predicate.Card(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)

3
entc/integration/hooks/ent/user/where.go
View File

@@ -470,7 +470,6 @@ func HasCards() predicate.User {
return predicate.User(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.To(CardsTable, FieldID),
sqlgraph.Edge(sqlgraph.O2M, false, CardsTable, CardsColumn),
)
sqlgraph.HasNeighbors(s, step)
@@ -498,7 +497,6 @@ func HasFriends() predicate.User {
return predicate.User(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.To(FriendsTable, FieldID),
sqlgraph.Edge(sqlgraph.M2M, false, FriendsTable, FriendsPrimaryKey...),
)
sqlgraph.HasNeighbors(s, step)
@@ -526,7 +524,6 @@ func HasBestFriend() predicate.User {
return predicate.User(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.To(BestFriendTable, FieldID),
sqlgraph.Edge(sqlgraph.O2O, false, BestFriendTable, BestFriendColumn),
)
sqlgraph.HasNeighbors(s, step)