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

regenerate ent

Browse Source
This commit is contained in:
Giovanni Harting
2025-10-26 05:09:47 +01:00
parent 5358d9dd0f
commit ab8b0b983c
46 changed files with 6050 additions and 5607 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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