CSGOWTF/csgowtfd
3
0
Fork 0
Code Issues Pull Requests Releases 1 Wiki Activity

updated deps & regen ent

Browse Source
This commit is contained in:
Giovanni Harting
2023-05-16 18:09:10 +02:00
parent e9e3e02a39
commit 3fd0a4204b
53 changed files with 1062 additions and 593 deletions
Download Patch File Download Diff File Expand all files Collapse all files

36
ent/matchplayer/where.go
View File

@@ -1772,11 +1772,7 @@ func HasMatches() predicate.MatchPlayer {
// HasMatchesWith applies the HasEdge predicate on the "matches" edge with a given conditions (other predicates).
func HasMatchesWith(preds ...predicate.Match) predicate.MatchPlayer {
return predicate.MatchPlayer(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.To(MatchesInverseTable, FieldID),
sqlgraph.Edge(sqlgraph.M2O, true, MatchesTable, MatchesColumn),
)
step := newMatchesStep()
sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
for _, p := range preds {
p(s)
@@ -1799,11 +1795,7 @@ func HasPlayers() predicate.MatchPlayer {
// HasPlayersWith applies the HasEdge predicate on the "players" edge with a given conditions (other predicates).
func HasPlayersWith(preds ...predicate.Player) predicate.MatchPlayer {
return predicate.MatchPlayer(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.To(PlayersInverseTable, FieldID),
sqlgraph.Edge(sqlgraph.M2O, true, PlayersTable, PlayersColumn),
)
step := newPlayersStep()
sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
for _, p := range preds {
p(s)
@@ -1826,11 +1818,7 @@ func HasWeaponStats() predicate.MatchPlayer {
// HasWeaponStatsWith applies the HasEdge predicate on the "weapon_stats" edge with a given conditions (other predicates).
func HasWeaponStatsWith(preds ...predicate.Weapon) predicate.MatchPlayer {
return predicate.MatchPlayer(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.To(WeaponStatsInverseTable, FieldID),
sqlgraph.Edge(sqlgraph.O2M, false, WeaponStatsTable, WeaponStatsColumn),
)
step := newWeaponStatsStep()
sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
for _, p := range preds {
p(s)
@@ -1853,11 +1841,7 @@ func HasRoundStats() predicate.MatchPlayer {
// HasRoundStatsWith applies the HasEdge predicate on the "round_stats" edge with a given conditions (other predicates).
func HasRoundStatsWith(preds ...predicate.RoundStats) predicate.MatchPlayer {
return predicate.MatchPlayer(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.To(RoundStatsInverseTable, FieldID),
sqlgraph.Edge(sqlgraph.O2M, false, RoundStatsTable, RoundStatsColumn),
)
step := newRoundStatsStep()
sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
for _, p := range preds {
p(s)
@@ -1880,11 +1864,7 @@ func HasSpray() predicate.MatchPlayer {
// HasSprayWith applies the HasEdge predicate on the "spray" edge with a given conditions (other predicates).
func HasSprayWith(preds ...predicate.Spray) predicate.MatchPlayer {
return predicate.MatchPlayer(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.To(SprayInverseTable, FieldID),
sqlgraph.Edge(sqlgraph.O2M, false, SprayTable, SprayColumn),
)
step := newSprayStep()
sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
for _, p := range preds {
p(s)
@@ -1907,11 +1887,7 @@ func HasMessages() predicate.MatchPlayer {
// HasMessagesWith applies the HasEdge predicate on the "messages" edge with a given conditions (other predicates).
func HasMessagesWith(preds ...predicate.Messages) predicate.MatchPlayer {
return predicate.MatchPlayer(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.To(MessagesInverseTable, FieldID),
sqlgraph.Edge(sqlgraph.O2M, false, MessagesTable, MessagesColumn),
)
step := newMessagesStep()
sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
for _, p := range preds {
p(s)