regenerate ent

This commit is contained in:
2025-10-26 05:09:47 +01:00
parent 5358d9dd0f
commit ab8b0b983c
46 changed files with 6050 additions and 5607 deletions

View File

@@ -8,6 +8,7 @@ import (
"fmt"
"math"
"entgo.io/ent"
"entgo.io/ent/dialect/sql"
"entgo.io/ent/dialect/sql/sqlgraph"
"entgo.io/ent/schema/field"
@@ -33,44 +34,44 @@ type PlayerQuery struct {
}
// Where adds a new predicate for the PlayerQuery builder.
func (pq *PlayerQuery) Where(ps ...predicate.Player) *PlayerQuery {
pq.predicates = append(pq.predicates, ps...)
return pq
func (_q *PlayerQuery) Where(ps ...predicate.Player) *PlayerQuery {
_q.predicates = append(_q.predicates, ps...)
return _q
}
// Limit the number of records to be returned by this query.
func (pq *PlayerQuery) Limit(limit int) *PlayerQuery {
pq.ctx.Limit = &limit
return pq
func (_q *PlayerQuery) Limit(limit int) *PlayerQuery {
_q.ctx.Limit = &limit
return _q
}
// Offset to start from.
func (pq *PlayerQuery) Offset(offset int) *PlayerQuery {
pq.ctx.Offset = &offset
return pq
func (_q *PlayerQuery) Offset(offset int) *PlayerQuery {
_q.ctx.Offset = &offset
return _q
}
// Unique configures the query builder to filter duplicate records on query.
// By default, unique is set to true, and can be disabled using this method.
func (pq *PlayerQuery) Unique(unique bool) *PlayerQuery {
pq.ctx.Unique = &unique
return pq
func (_q *PlayerQuery) Unique(unique bool) *PlayerQuery {
_q.ctx.Unique = &unique
return _q
}
// Order specifies how the records should be ordered.
func (pq *PlayerQuery) Order(o ...player.OrderOption) *PlayerQuery {
pq.order = append(pq.order, o...)
return pq
func (_q *PlayerQuery) Order(o ...player.OrderOption) *PlayerQuery {
_q.order = append(_q.order, o...)
return _q
}
// QueryStats chains the current query on the "stats" edge.
func (pq *PlayerQuery) QueryStats() *MatchPlayerQuery {
query := (&MatchPlayerClient{config: pq.config}).Query()
func (_q *PlayerQuery) QueryStats() *MatchPlayerQuery {
query := (&MatchPlayerClient{config: _q.config}).Query()
query.path = func(ctx context.Context) (fromU *sql.Selector, err error) {
if err := pq.prepareQuery(ctx); err != nil {
if err := _q.prepareQuery(ctx); err != nil {
return nil, err
}
selector := pq.sqlQuery(ctx)
selector := _q.sqlQuery(ctx)
if err := selector.Err(); err != nil {
return nil, err
}
@@ -79,20 +80,20 @@ func (pq *PlayerQuery) QueryStats() *MatchPlayerQuery {
sqlgraph.To(matchplayer.Table, matchplayer.FieldID),
sqlgraph.Edge(sqlgraph.O2M, false, player.StatsTable, player.StatsColumn),
)
fromU = sqlgraph.SetNeighbors(pq.driver.Dialect(), step)
fromU = sqlgraph.SetNeighbors(_q.driver.Dialect(), step)
return fromU, nil
}
return query
}
// QueryMatches chains the current query on the "matches" edge.
func (pq *PlayerQuery) QueryMatches() *MatchQuery {
query := (&MatchClient{config: pq.config}).Query()
func (_q *PlayerQuery) QueryMatches() *MatchQuery {
query := (&MatchClient{config: _q.config}).Query()
query.path = func(ctx context.Context) (fromU *sql.Selector, err error) {
if err := pq.prepareQuery(ctx); err != nil {
if err := _q.prepareQuery(ctx); err != nil {
return nil, err
}
selector := pq.sqlQuery(ctx)
selector := _q.sqlQuery(ctx)
if err := selector.Err(); err != nil {
return nil, err
}
@@ -101,7 +102,7 @@ func (pq *PlayerQuery) QueryMatches() *MatchQuery {
sqlgraph.To(match.Table, match.FieldID),
sqlgraph.Edge(sqlgraph.M2M, false, player.MatchesTable, player.MatchesPrimaryKey...),
)
fromU = sqlgraph.SetNeighbors(pq.driver.Dialect(), step)
fromU = sqlgraph.SetNeighbors(_q.driver.Dialect(), step)
return fromU, nil
}
return query
@@ -109,8 +110,8 @@ func (pq *PlayerQuery) QueryMatches() *MatchQuery {
// First returns the first Player entity from the query.
// Returns a *NotFoundError when no Player was found.
func (pq *PlayerQuery) First(ctx context.Context) (*Player, error) {
nodes, err := pq.Limit(1).All(setContextOp(ctx, pq.ctx, "First"))
func (_q *PlayerQuery) First(ctx context.Context) (*Player, error) {
nodes, err := _q.Limit(1).All(setContextOp(ctx, _q.ctx, ent.OpQueryFirst))
if err != nil {
return nil, err
}
@@ -121,8 +122,8 @@ func (pq *PlayerQuery) First(ctx context.Context) (*Player, error) {
}
// FirstX is like First, but panics if an error occurs.
func (pq *PlayerQuery) FirstX(ctx context.Context) *Player {
node, err := pq.First(ctx)
func (_q *PlayerQuery) FirstX(ctx context.Context) *Player {
node, err := _q.First(ctx)
if err != nil && !IsNotFound(err) {
panic(err)
}
@@ -131,9 +132,9 @@ func (pq *PlayerQuery) FirstX(ctx context.Context) *Player {
// FirstID returns the first Player ID from the query.
// Returns a *NotFoundError when no Player ID was found.
func (pq *PlayerQuery) FirstID(ctx context.Context) (id uint64, err error) {
func (_q *PlayerQuery) FirstID(ctx context.Context) (id uint64, err error) {
var ids []uint64
if ids, err = pq.Limit(1).IDs(setContextOp(ctx, pq.ctx, "FirstID")); err != nil {
if ids, err = _q.Limit(1).IDs(setContextOp(ctx, _q.ctx, ent.OpQueryFirstID)); err != nil {
return
}
if len(ids) == 0 {
@@ -144,8 +145,8 @@ func (pq *PlayerQuery) FirstID(ctx context.Context) (id uint64, err error) {
}
// FirstIDX is like FirstID, but panics if an error occurs.
func (pq *PlayerQuery) FirstIDX(ctx context.Context) uint64 {
id, err := pq.FirstID(ctx)
func (_q *PlayerQuery) FirstIDX(ctx context.Context) uint64 {
id, err := _q.FirstID(ctx)
if err != nil && !IsNotFound(err) {
panic(err)
}
@@ -155,8 +156,8 @@ func (pq *PlayerQuery) FirstIDX(ctx context.Context) uint64 {
// Only returns a single Player entity found by the query, ensuring it only returns one.
// Returns a *NotSingularError when more than one Player entity is found.
// Returns a *NotFoundError when no Player entities are found.
func (pq *PlayerQuery) Only(ctx context.Context) (*Player, error) {
nodes, err := pq.Limit(2).All(setContextOp(ctx, pq.ctx, "Only"))
func (_q *PlayerQuery) Only(ctx context.Context) (*Player, error) {
nodes, err := _q.Limit(2).All(setContextOp(ctx, _q.ctx, ent.OpQueryOnly))
if err != nil {
return nil, err
}
@@ -171,8 +172,8 @@ func (pq *PlayerQuery) Only(ctx context.Context) (*Player, error) {
}
// OnlyX is like Only, but panics if an error occurs.
func (pq *PlayerQuery) OnlyX(ctx context.Context) *Player {
node, err := pq.Only(ctx)
func (_q *PlayerQuery) OnlyX(ctx context.Context) *Player {
node, err := _q.Only(ctx)
if err != nil {
panic(err)
}
@@ -182,9 +183,9 @@ func (pq *PlayerQuery) OnlyX(ctx context.Context) *Player {
// OnlyID is like Only, but returns the only Player ID in the query.
// Returns a *NotSingularError when more than one Player ID is found.
// Returns a *NotFoundError when no entities are found.
func (pq *PlayerQuery) OnlyID(ctx context.Context) (id uint64, err error) {
func (_q *PlayerQuery) OnlyID(ctx context.Context) (id uint64, err error) {
var ids []uint64
if ids, err = pq.Limit(2).IDs(setContextOp(ctx, pq.ctx, "OnlyID")); err != nil {
if ids, err = _q.Limit(2).IDs(setContextOp(ctx, _q.ctx, ent.OpQueryOnlyID)); err != nil {
return
}
switch len(ids) {
@@ -199,8 +200,8 @@ func (pq *PlayerQuery) OnlyID(ctx context.Context) (id uint64, err error) {
}
// OnlyIDX is like OnlyID, but panics if an error occurs.
func (pq *PlayerQuery) OnlyIDX(ctx context.Context) uint64 {
id, err := pq.OnlyID(ctx)
func (_q *PlayerQuery) OnlyIDX(ctx context.Context) uint64 {
id, err := _q.OnlyID(ctx)
if err != nil {
panic(err)
}
@@ -208,18 +209,18 @@ func (pq *PlayerQuery) OnlyIDX(ctx context.Context) uint64 {
}
// All executes the query and returns a list of Players.
func (pq *PlayerQuery) All(ctx context.Context) ([]*Player, error) {
ctx = setContextOp(ctx, pq.ctx, "All")
if err := pq.prepareQuery(ctx); err != nil {
func (_q *PlayerQuery) All(ctx context.Context) ([]*Player, error) {
ctx = setContextOp(ctx, _q.ctx, ent.OpQueryAll)
if err := _q.prepareQuery(ctx); err != nil {
return nil, err
}
qr := querierAll[[]*Player, *PlayerQuery]()
return withInterceptors[[]*Player](ctx, pq, qr, pq.inters)
return withInterceptors[[]*Player](ctx, _q, qr, _q.inters)
}
// AllX is like All, but panics if an error occurs.
func (pq *PlayerQuery) AllX(ctx context.Context) []*Player {
nodes, err := pq.All(ctx)
func (_q *PlayerQuery) AllX(ctx context.Context) []*Player {
nodes, err := _q.All(ctx)
if err != nil {
panic(err)
}
@@ -227,20 +228,20 @@ func (pq *PlayerQuery) AllX(ctx context.Context) []*Player {
}
// IDs executes the query and returns a list of Player IDs.
func (pq *PlayerQuery) IDs(ctx context.Context) (ids []uint64, err error) {
if pq.ctx.Unique == nil && pq.path != nil {
pq.Unique(true)
func (_q *PlayerQuery) IDs(ctx context.Context) (ids []uint64, err error) {
if _q.ctx.Unique == nil && _q.path != nil {
_q.Unique(true)
}
ctx = setContextOp(ctx, pq.ctx, "IDs")
if err = pq.Select(player.FieldID).Scan(ctx, &ids); err != nil {
ctx = setContextOp(ctx, _q.ctx, ent.OpQueryIDs)
if err = _q.Select(player.FieldID).Scan(ctx, &ids); err != nil {
return nil, err
}
return ids, nil
}
// IDsX is like IDs, but panics if an error occurs.
func (pq *PlayerQuery) IDsX(ctx context.Context) []uint64 {
ids, err := pq.IDs(ctx)
func (_q *PlayerQuery) IDsX(ctx context.Context) []uint64 {
ids, err := _q.IDs(ctx)
if err != nil {
panic(err)
}
@@ -248,17 +249,17 @@ func (pq *PlayerQuery) IDsX(ctx context.Context) []uint64 {
}
// Count returns the count of the given query.
func (pq *PlayerQuery) Count(ctx context.Context) (int, error) {
ctx = setContextOp(ctx, pq.ctx, "Count")
if err := pq.prepareQuery(ctx); err != nil {
func (_q *PlayerQuery) Count(ctx context.Context) (int, error) {
ctx = setContextOp(ctx, _q.ctx, ent.OpQueryCount)
if err := _q.prepareQuery(ctx); err != nil {
return 0, err
}
return withInterceptors[int](ctx, pq, querierCount[*PlayerQuery](), pq.inters)
return withInterceptors[int](ctx, _q, querierCount[*PlayerQuery](), _q.inters)
}
// CountX is like Count, but panics if an error occurs.
func (pq *PlayerQuery) CountX(ctx context.Context) int {
count, err := pq.Count(ctx)
func (_q *PlayerQuery) CountX(ctx context.Context) int {
count, err := _q.Count(ctx)
if err != nil {
panic(err)
}
@@ -266,9 +267,9 @@ func (pq *PlayerQuery) CountX(ctx context.Context) int {
}
// Exist returns true if the query has elements in the graph.
func (pq *PlayerQuery) Exist(ctx context.Context) (bool, error) {
ctx = setContextOp(ctx, pq.ctx, "Exist")
switch _, err := pq.FirstID(ctx); {
func (_q *PlayerQuery) Exist(ctx context.Context) (bool, error) {
ctx = setContextOp(ctx, _q.ctx, ent.OpQueryExist)
switch _, err := _q.FirstID(ctx); {
case IsNotFound(err):
return false, nil
case err != nil:
@@ -279,8 +280,8 @@ func (pq *PlayerQuery) Exist(ctx context.Context) (bool, error) {
}
// ExistX is like Exist, but panics if an error occurs.
func (pq *PlayerQuery) ExistX(ctx context.Context) bool {
exist, err := pq.Exist(ctx)
func (_q *PlayerQuery) ExistX(ctx context.Context) bool {
exist, err := _q.Exist(ctx)
if err != nil {
panic(err)
}
@@ -289,44 +290,45 @@ func (pq *PlayerQuery) ExistX(ctx context.Context) bool {
// Clone returns a duplicate of the PlayerQuery builder, including all associated steps. It can be
// used to prepare common query builders and use them differently after the clone is made.
func (pq *PlayerQuery) Clone() *PlayerQuery {
if pq == nil {
func (_q *PlayerQuery) Clone() *PlayerQuery {
if _q == nil {
return nil
}
return &PlayerQuery{
config: pq.config,
ctx: pq.ctx.Clone(),
order: append([]player.OrderOption{}, pq.order...),
inters: append([]Interceptor{}, pq.inters...),
predicates: append([]predicate.Player{}, pq.predicates...),
withStats: pq.withStats.Clone(),
withMatches: pq.withMatches.Clone(),
config: _q.config,
ctx: _q.ctx.Clone(),
order: append([]player.OrderOption{}, _q.order...),
inters: append([]Interceptor{}, _q.inters...),
predicates: append([]predicate.Player{}, _q.predicates...),
withStats: _q.withStats.Clone(),
withMatches: _q.withMatches.Clone(),
// clone intermediate query.
sql: pq.sql.Clone(),
path: pq.path,
sql: _q.sql.Clone(),
path: _q.path,
modifiers: append([]func(*sql.Selector){}, _q.modifiers...),
}
}
// WithStats tells the query-builder to eager-load the nodes that are connected to
// the "stats" edge. The optional arguments are used to configure the query builder of the edge.
func (pq *PlayerQuery) WithStats(opts ...func(*MatchPlayerQuery)) *PlayerQuery {
query := (&MatchPlayerClient{config: pq.config}).Query()
func (_q *PlayerQuery) WithStats(opts ...func(*MatchPlayerQuery)) *PlayerQuery {
query := (&MatchPlayerClient{config: _q.config}).Query()
for _, opt := range opts {
opt(query)
}
pq.withStats = query
return pq
_q.withStats = query
return _q
}
// WithMatches tells the query-builder to eager-load the nodes that are connected to
// the "matches" edge. The optional arguments are used to configure the query builder of the edge.
func (pq *PlayerQuery) WithMatches(opts ...func(*MatchQuery)) *PlayerQuery {
query := (&MatchClient{config: pq.config}).Query()
func (_q *PlayerQuery) WithMatches(opts ...func(*MatchQuery)) *PlayerQuery {
query := (&MatchClient{config: _q.config}).Query()
for _, opt := range opts {
opt(query)
}
pq.withMatches = query
return pq
_q.withMatches = query
return _q
}
// GroupBy is used to group vertices by one or more fields/columns.
@@ -343,10 +345,10 @@ func (pq *PlayerQuery) WithMatches(opts ...func(*MatchQuery)) *PlayerQuery {
// GroupBy(player.FieldName).
// Aggregate(ent.Count()).
// Scan(ctx, &v)
func (pq *PlayerQuery) GroupBy(field string, fields ...string) *PlayerGroupBy {
pq.ctx.Fields = append([]string{field}, fields...)
grbuild := &PlayerGroupBy{build: pq}
grbuild.flds = &pq.ctx.Fields
func (_q *PlayerQuery) GroupBy(field string, fields ...string) *PlayerGroupBy {
_q.ctx.Fields = append([]string{field}, fields...)
grbuild := &PlayerGroupBy{build: _q}
grbuild.flds = &_q.ctx.Fields
grbuild.label = player.Label
grbuild.scan = grbuild.Scan
return grbuild
@@ -364,84 +366,84 @@ func (pq *PlayerQuery) GroupBy(field string, fields ...string) *PlayerGroupBy {
// client.Player.Query().
// Select(player.FieldName).
// Scan(ctx, &v)
func (pq *PlayerQuery) Select(fields ...string) *PlayerSelect {
pq.ctx.Fields = append(pq.ctx.Fields, fields...)
sbuild := &PlayerSelect{PlayerQuery: pq}
func (_q *PlayerQuery) Select(fields ...string) *PlayerSelect {
_q.ctx.Fields = append(_q.ctx.Fields, fields...)
sbuild := &PlayerSelect{PlayerQuery: _q}
sbuild.label = player.Label
sbuild.flds, sbuild.scan = &pq.ctx.Fields, sbuild.Scan
sbuild.flds, sbuild.scan = &_q.ctx.Fields, sbuild.Scan
return sbuild
}
// Aggregate returns a PlayerSelect configured with the given aggregations.
func (pq *PlayerQuery) Aggregate(fns ...AggregateFunc) *PlayerSelect {
return pq.Select().Aggregate(fns...)
func (_q *PlayerQuery) Aggregate(fns ...AggregateFunc) *PlayerSelect {
return _q.Select().Aggregate(fns...)
}
func (pq *PlayerQuery) prepareQuery(ctx context.Context) error {
for _, inter := range pq.inters {
func (_q *PlayerQuery) prepareQuery(ctx context.Context) error {
for _, inter := range _q.inters {
if inter == nil {
return fmt.Errorf("ent: uninitialized interceptor (forgotten import ent/runtime?)")
}
if trv, ok := inter.(Traverser); ok {
if err := trv.Traverse(ctx, pq); err != nil {
if err := trv.Traverse(ctx, _q); err != nil {
return err
}
}
}
for _, f := range pq.ctx.Fields {
for _, f := range _q.ctx.Fields {
if !player.ValidColumn(f) {
return &ValidationError{Name: f, err: fmt.Errorf("ent: invalid field %q for query", f)}
}
}
if pq.path != nil {
prev, err := pq.path(ctx)
if _q.path != nil {
prev, err := _q.path(ctx)
if err != nil {
return err
}
pq.sql = prev
_q.sql = prev
}
return nil
}
func (pq *PlayerQuery) sqlAll(ctx context.Context, hooks ...queryHook) ([]*Player, error) {
func (_q *PlayerQuery) sqlAll(ctx context.Context, hooks ...queryHook) ([]*Player, error) {
var (
nodes = []*Player{}
_spec = pq.querySpec()
_spec = _q.querySpec()
loadedTypes = [2]bool{
pq.withStats != nil,
pq.withMatches != nil,
_q.withStats != nil,
_q.withMatches != nil,
}
)
_spec.ScanValues = func(columns []string) ([]any, error) {
return (*Player).scanValues(nil, columns)
}
_spec.Assign = func(columns []string, values []any) error {
node := &Player{config: pq.config}
node := &Player{config: _q.config}
nodes = append(nodes, node)
node.Edges.loadedTypes = loadedTypes
return node.assignValues(columns, values)
}
if len(pq.modifiers) > 0 {
_spec.Modifiers = pq.modifiers
if len(_q.modifiers) > 0 {
_spec.Modifiers = _q.modifiers
}
for i := range hooks {
hooks[i](ctx, _spec)
}
if err := sqlgraph.QueryNodes(ctx, pq.driver, _spec); err != nil {
if err := sqlgraph.QueryNodes(ctx, _q.driver, _spec); err != nil {
return nil, err
}
if len(nodes) == 0 {
return nodes, nil
}
if query := pq.withStats; query != nil {
if err := pq.loadStats(ctx, query, nodes,
if query := _q.withStats; query != nil {
if err := _q.loadStats(ctx, query, nodes,
func(n *Player) { n.Edges.Stats = []*MatchPlayer{} },
func(n *Player, e *MatchPlayer) { n.Edges.Stats = append(n.Edges.Stats, e) }); err != nil {
return nil, err
}
}
if query := pq.withMatches; query != nil {
if err := pq.loadMatches(ctx, query, nodes,
if query := _q.withMatches; query != nil {
if err := _q.loadMatches(ctx, query, nodes,
func(n *Player) { n.Edges.Matches = []*Match{} },
func(n *Player, e *Match) { n.Edges.Matches = append(n.Edges.Matches, e) }); err != nil {
return nil, err
@@ -450,7 +452,7 @@ func (pq *PlayerQuery) sqlAll(ctx context.Context, hooks ...queryHook) ([]*Playe
return nodes, nil
}
func (pq *PlayerQuery) loadStats(ctx context.Context, query *MatchPlayerQuery, nodes []*Player, init func(*Player), assign func(*Player, *MatchPlayer)) error {
func (_q *PlayerQuery) loadStats(ctx context.Context, query *MatchPlayerQuery, nodes []*Player, init func(*Player), assign func(*Player, *MatchPlayer)) error {
fks := make([]driver.Value, 0, len(nodes))
nodeids := make(map[uint64]*Player)
for i := range nodes {
@@ -480,7 +482,7 @@ func (pq *PlayerQuery) loadStats(ctx context.Context, query *MatchPlayerQuery, n
}
return nil
}
func (pq *PlayerQuery) loadMatches(ctx context.Context, query *MatchQuery, nodes []*Player, init func(*Player), assign func(*Player, *Match)) error {
func (_q *PlayerQuery) loadMatches(ctx context.Context, query *MatchQuery, nodes []*Player, init func(*Player), assign func(*Player, *Match)) error {
edgeIDs := make([]driver.Value, len(nodes))
byID := make(map[uint64]*Player)
nids := make(map[uint64]map[*Player]struct{})
@@ -542,27 +544,27 @@ func (pq *PlayerQuery) loadMatches(ctx context.Context, query *MatchQuery, nodes
return nil
}
func (pq *PlayerQuery) sqlCount(ctx context.Context) (int, error) {
_spec := pq.querySpec()
if len(pq.modifiers) > 0 {
_spec.Modifiers = pq.modifiers
func (_q *PlayerQuery) sqlCount(ctx context.Context) (int, error) {
_spec := _q.querySpec()
if len(_q.modifiers) > 0 {
_spec.Modifiers = _q.modifiers
}
_spec.Node.Columns = pq.ctx.Fields
if len(pq.ctx.Fields) > 0 {
_spec.Unique = pq.ctx.Unique != nil && *pq.ctx.Unique
_spec.Node.Columns = _q.ctx.Fields
if len(_q.ctx.Fields) > 0 {
_spec.Unique = _q.ctx.Unique != nil && *_q.ctx.Unique
}
return sqlgraph.CountNodes(ctx, pq.driver, _spec)
return sqlgraph.CountNodes(ctx, _q.driver, _spec)
}
func (pq *PlayerQuery) querySpec() *sqlgraph.QuerySpec {
func (_q *PlayerQuery) querySpec() *sqlgraph.QuerySpec {
_spec := sqlgraph.NewQuerySpec(player.Table, player.Columns, sqlgraph.NewFieldSpec(player.FieldID, field.TypeUint64))
_spec.From = pq.sql
if unique := pq.ctx.Unique; unique != nil {
_spec.From = _q.sql
if unique := _q.ctx.Unique; unique != nil {
_spec.Unique = *unique
} else if pq.path != nil {
} else if _q.path != nil {
_spec.Unique = true
}
if fields := pq.ctx.Fields; len(fields) > 0 {
if fields := _q.ctx.Fields; len(fields) > 0 {
_spec.Node.Columns = make([]string, 0, len(fields))
_spec.Node.Columns = append(_spec.Node.Columns, player.FieldID)
for i := range fields {
@@ -571,20 +573,20 @@ func (pq *PlayerQuery) querySpec() *sqlgraph.QuerySpec {
}
}
}
if ps := pq.predicates; len(ps) > 0 {
if ps := _q.predicates; len(ps) > 0 {
_spec.Predicate = func(selector *sql.Selector) {
for i := range ps {
ps[i](selector)
}
}
}
if limit := pq.ctx.Limit; limit != nil {
if limit := _q.ctx.Limit; limit != nil {
_spec.Limit = *limit
}
if offset := pq.ctx.Offset; offset != nil {
if offset := _q.ctx.Offset; offset != nil {
_spec.Offset = *offset
}
if ps := pq.order; len(ps) > 0 {
if ps := _q.order; len(ps) > 0 {
_spec.Order = func(selector *sql.Selector) {
for i := range ps {
ps[i](selector)
@@ -594,45 +596,45 @@ func (pq *PlayerQuery) querySpec() *sqlgraph.QuerySpec {
return _spec
}
func (pq *PlayerQuery) sqlQuery(ctx context.Context) *sql.Selector {
builder := sql.Dialect(pq.driver.Dialect())
func (_q *PlayerQuery) sqlQuery(ctx context.Context) *sql.Selector {
builder := sql.Dialect(_q.driver.Dialect())
t1 := builder.Table(player.Table)
columns := pq.ctx.Fields
columns := _q.ctx.Fields
if len(columns) == 0 {
columns = player.Columns
}
selector := builder.Select(t1.Columns(columns...)...).From(t1)
if pq.sql != nil {
selector = pq.sql
if _q.sql != nil {
selector = _q.sql
selector.Select(selector.Columns(columns...)...)
}
if pq.ctx.Unique != nil && *pq.ctx.Unique {
if _q.ctx.Unique != nil && *_q.ctx.Unique {
selector.Distinct()
}
for _, m := range pq.modifiers {
for _, m := range _q.modifiers {
m(selector)
}
for _, p := range pq.predicates {
for _, p := range _q.predicates {
p(selector)
}
for _, p := range pq.order {
for _, p := range _q.order {
p(selector)
}
if offset := pq.ctx.Offset; offset != nil {
if offset := _q.ctx.Offset; offset != nil {
// limit is mandatory for offset clause. We start
// with default value, and override it below if needed.
selector.Offset(*offset).Limit(math.MaxInt32)
}
if limit := pq.ctx.Limit; limit != nil {
if limit := _q.ctx.Limit; limit != nil {
selector.Limit(*limit)
}
return selector
}
// Modify adds a query modifier for attaching custom logic to queries.
func (pq *PlayerQuery) Modify(modifiers ...func(s *sql.Selector)) *PlayerSelect {
pq.modifiers = append(pq.modifiers, modifiers...)
return pq.Select()
func (_q *PlayerQuery) Modify(modifiers ...func(s *sql.Selector)) *PlayerSelect {
_q.modifiers = append(_q.modifiers, modifiers...)
return _q.Select()
}
// PlayerGroupBy is the group-by builder for Player entities.
@@ -642,41 +644,41 @@ type PlayerGroupBy struct {
}
// Aggregate adds the given aggregation functions to the group-by query.
func (pgb *PlayerGroupBy) Aggregate(fns ...AggregateFunc) *PlayerGroupBy {
pgb.fns = append(pgb.fns, fns...)
return pgb
func (_g *PlayerGroupBy) Aggregate(fns ...AggregateFunc) *PlayerGroupBy {
_g.fns = append(_g.fns, fns...)
return _g
}
// Scan applies the selector query and scans the result into the given value.
func (pgb *PlayerGroupBy) Scan(ctx context.Context, v any) error {
ctx = setContextOp(ctx, pgb.build.ctx, "GroupBy")
if err := pgb.build.prepareQuery(ctx); err != nil {
func (_g *PlayerGroupBy) Scan(ctx context.Context, v any) error {
ctx = setContextOp(ctx, _g.build.ctx, ent.OpQueryGroupBy)
if err := _g.build.prepareQuery(ctx); err != nil {
return err
}
return scanWithInterceptors[*PlayerQuery, *PlayerGroupBy](ctx, pgb.build, pgb, pgb.build.inters, v)
return scanWithInterceptors[*PlayerQuery, *PlayerGroupBy](ctx, _g.build, _g, _g.build.inters, v)
}
func (pgb *PlayerGroupBy) sqlScan(ctx context.Context, root *PlayerQuery, v any) error {
func (_g *PlayerGroupBy) sqlScan(ctx context.Context, root *PlayerQuery, v any) error {
selector := root.sqlQuery(ctx).Select()
aggregation := make([]string, 0, len(pgb.fns))
for _, fn := range pgb.fns {
aggregation := make([]string, 0, len(_g.fns))
for _, fn := range _g.fns {
aggregation = append(aggregation, fn(selector))
}
if len(selector.SelectedColumns()) == 0 {
columns := make([]string, 0, len(*pgb.flds)+len(pgb.fns))
for _, f := range *pgb.flds {
columns := make([]string, 0, len(*_g.flds)+len(_g.fns))
for _, f := range *_g.flds {
columns = append(columns, selector.C(f))
}
columns = append(columns, aggregation...)
selector.Select(columns...)
}
selector.GroupBy(selector.Columns(*pgb.flds...)...)
selector.GroupBy(selector.Columns(*_g.flds...)...)
if err := selector.Err(); err != nil {
return err
}
rows := &sql.Rows{}
query, args := selector.Query()
if err := pgb.build.driver.Query(ctx, query, args, rows); err != nil {
if err := _g.build.driver.Query(ctx, query, args, rows); err != nil {
return err
}
defer rows.Close()
@@ -690,27 +692,27 @@ type PlayerSelect struct {
}
// Aggregate adds the given aggregation functions to the selector query.
func (ps *PlayerSelect) Aggregate(fns ...AggregateFunc) *PlayerSelect {
ps.fns = append(ps.fns, fns...)
return ps
func (_s *PlayerSelect) Aggregate(fns ...AggregateFunc) *PlayerSelect {
_s.fns = append(_s.fns, fns...)
return _s
}
// Scan applies the selector query and scans the result into the given value.
func (ps *PlayerSelect) Scan(ctx context.Context, v any) error {
ctx = setContextOp(ctx, ps.ctx, "Select")
if err := ps.prepareQuery(ctx); err != nil {
func (_s *PlayerSelect) Scan(ctx context.Context, v any) error {
ctx = setContextOp(ctx, _s.ctx, ent.OpQuerySelect)
if err := _s.prepareQuery(ctx); err != nil {
return err
}
return scanWithInterceptors[*PlayerQuery, *PlayerSelect](ctx, ps.PlayerQuery, ps, ps.inters, v)
return scanWithInterceptors[*PlayerQuery, *PlayerSelect](ctx, _s.PlayerQuery, _s, _s.inters, v)
}
func (ps *PlayerSelect) sqlScan(ctx context.Context, root *PlayerQuery, v any) error {
func (_s *PlayerSelect) sqlScan(ctx context.Context, root *PlayerQuery, v any) error {
selector := root.sqlQuery(ctx)
aggregation := make([]string, 0, len(ps.fns))
for _, fn := range ps.fns {
aggregation := make([]string, 0, len(_s.fns))
for _, fn := range _s.fns {
aggregation = append(aggregation, fn(selector))
}
switch n := len(*ps.selector.flds); {
switch n := len(*_s.selector.flds); {
case n == 0 && len(aggregation) > 0:
selector.Select(aggregation...)
case n != 0 && len(aggregation) > 0:
@@ -718,7 +720,7 @@ func (ps *PlayerSelect) sqlScan(ctx context.Context, root *PlayerQuery, v any) e
}
rows := &sql.Rows{}
query, args := selector.Query()
if err := ps.driver.Query(ctx, query, args, rows); err != nil {
if err := _s.driver.Query(ctx, query, args, rows); err != nil {
return err
}
defer rows.Close()
@@ -726,7 +728,7 @@ func (ps *PlayerSelect) sqlScan(ctx context.Context, root *PlayerQuery, v any) e
}
// Modify adds a query modifier for attaching custom logic to queries.
func (ps *PlayerSelect) Modify(modifiers ...func(s *sql.Selector)) *PlayerSelect {
ps.modifiers = append(ps.modifiers, modifiers...)
return ps
func (_s *PlayerSelect) Modify(modifiers ...func(s *sql.Selector)) *PlayerSelect {
_s.modifiers = append(_s.modifiers, modifiers...)
return _s
}