735 lines
21 KiB
Go
735 lines
21 KiB
Go
// Code generated by ent, DO NOT EDIT.
|
|
|
|
package ent
|
|
|
|
import (
|
|
"context"
|
|
"database/sql/driver"
|
|
"fmt"
|
|
"math"
|
|
|
|
"entgo.io/ent"
|
|
"entgo.io/ent/dialect/sql"
|
|
"entgo.io/ent/dialect/sql/sqlgraph"
|
|
"entgo.io/ent/schema/field"
|
|
"somegit.dev/csgowtf/csgowtfd/ent/match"
|
|
"somegit.dev/csgowtf/csgowtfd/ent/matchplayer"
|
|
"somegit.dev/csgowtf/csgowtfd/ent/player"
|
|
"somegit.dev/csgowtf/csgowtfd/ent/predicate"
|
|
)
|
|
|
|
// MatchQuery is the builder for querying Match entities.
|
|
type MatchQuery struct {
|
|
config
|
|
ctx *QueryContext
|
|
order []match.OrderOption
|
|
inters []Interceptor
|
|
predicates []predicate.Match
|
|
withStats *MatchPlayerQuery
|
|
withPlayers *PlayerQuery
|
|
modifiers []func(*sql.Selector)
|
|
// intermediate query (i.e. traversal path).
|
|
sql *sql.Selector
|
|
path func(context.Context) (*sql.Selector, error)
|
|
}
|
|
|
|
// Where adds a new predicate for the MatchQuery builder.
|
|
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 (_q *MatchQuery) Limit(limit int) *MatchQuery {
|
|
_q.ctx.Limit = &limit
|
|
return _q
|
|
}
|
|
|
|
// Offset to start from.
|
|
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 (_q *MatchQuery) Unique(unique bool) *MatchQuery {
|
|
_q.ctx.Unique = &unique
|
|
return _q
|
|
}
|
|
|
|
// Order specifies how the records should be ordered.
|
|
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 (_q *MatchQuery) QueryStats() *MatchPlayerQuery {
|
|
query := (&MatchPlayerClient{config: _q.config}).Query()
|
|
query.path = func(ctx context.Context) (fromU *sql.Selector, err error) {
|
|
if err := _q.prepareQuery(ctx); err != nil {
|
|
return nil, err
|
|
}
|
|
selector := _q.sqlQuery(ctx)
|
|
if err := selector.Err(); err != nil {
|
|
return nil, err
|
|
}
|
|
step := sqlgraph.NewStep(
|
|
sqlgraph.From(match.Table, match.FieldID, selector),
|
|
sqlgraph.To(matchplayer.Table, matchplayer.FieldID),
|
|
sqlgraph.Edge(sqlgraph.O2M, false, match.StatsTable, match.StatsColumn),
|
|
)
|
|
fromU = sqlgraph.SetNeighbors(_q.driver.Dialect(), step)
|
|
return fromU, nil
|
|
}
|
|
return query
|
|
}
|
|
|
|
// QueryPlayers chains the current query on the "players" edge.
|
|
func (_q *MatchQuery) QueryPlayers() *PlayerQuery {
|
|
query := (&PlayerClient{config: _q.config}).Query()
|
|
query.path = func(ctx context.Context) (fromU *sql.Selector, err error) {
|
|
if err := _q.prepareQuery(ctx); err != nil {
|
|
return nil, err
|
|
}
|
|
selector := _q.sqlQuery(ctx)
|
|
if err := selector.Err(); err != nil {
|
|
return nil, err
|
|
}
|
|
step := sqlgraph.NewStep(
|
|
sqlgraph.From(match.Table, match.FieldID, selector),
|
|
sqlgraph.To(player.Table, player.FieldID),
|
|
sqlgraph.Edge(sqlgraph.M2M, true, match.PlayersTable, match.PlayersPrimaryKey...),
|
|
)
|
|
fromU = sqlgraph.SetNeighbors(_q.driver.Dialect(), step)
|
|
return fromU, nil
|
|
}
|
|
return query
|
|
}
|
|
|
|
// First returns the first Match entity from the query.
|
|
// Returns a *NotFoundError when no Match was found.
|
|
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
|
|
}
|
|
if len(nodes) == 0 {
|
|
return nil, &NotFoundError{match.Label}
|
|
}
|
|
return nodes[0], nil
|
|
}
|
|
|
|
// FirstX is like First, but panics if an error occurs.
|
|
func (_q *MatchQuery) FirstX(ctx context.Context) *Match {
|
|
node, err := _q.First(ctx)
|
|
if err != nil && !IsNotFound(err) {
|
|
panic(err)
|
|
}
|
|
return node
|
|
}
|
|
|
|
// FirstID returns the first Match ID from the query.
|
|
// Returns a *NotFoundError when no Match ID was found.
|
|
func (_q *MatchQuery) FirstID(ctx context.Context) (id uint64, err error) {
|
|
var ids []uint64
|
|
if ids, err = _q.Limit(1).IDs(setContextOp(ctx, _q.ctx, ent.OpQueryFirstID)); err != nil {
|
|
return
|
|
}
|
|
if len(ids) == 0 {
|
|
err = &NotFoundError{match.Label}
|
|
return
|
|
}
|
|
return ids[0], nil
|
|
}
|
|
|
|
// FirstIDX is like FirstID, but panics if an error occurs.
|
|
func (_q *MatchQuery) FirstIDX(ctx context.Context) uint64 {
|
|
id, err := _q.FirstID(ctx)
|
|
if err != nil && !IsNotFound(err) {
|
|
panic(err)
|
|
}
|
|
return id
|
|
}
|
|
|
|
// 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 (_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
|
|
}
|
|
switch len(nodes) {
|
|
case 1:
|
|
return nodes[0], nil
|
|
case 0:
|
|
return nil, &NotFoundError{match.Label}
|
|
default:
|
|
return nil, &NotSingularError{match.Label}
|
|
}
|
|
}
|
|
|
|
// OnlyX is like Only, but panics if an error occurs.
|
|
func (_q *MatchQuery) OnlyX(ctx context.Context) *Match {
|
|
node, err := _q.Only(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return node
|
|
}
|
|
|
|
// 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 (_q *MatchQuery) OnlyID(ctx context.Context) (id uint64, err error) {
|
|
var ids []uint64
|
|
if ids, err = _q.Limit(2).IDs(setContextOp(ctx, _q.ctx, ent.OpQueryOnlyID)); err != nil {
|
|
return
|
|
}
|
|
switch len(ids) {
|
|
case 1:
|
|
id = ids[0]
|
|
case 0:
|
|
err = &NotFoundError{match.Label}
|
|
default:
|
|
err = &NotSingularError{match.Label}
|
|
}
|
|
return
|
|
}
|
|
|
|
// OnlyIDX is like OnlyID, but panics if an error occurs.
|
|
func (_q *MatchQuery) OnlyIDX(ctx context.Context) uint64 {
|
|
id, err := _q.OnlyID(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return id
|
|
}
|
|
|
|
// All executes the query and returns a list of Matches.
|
|
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, _q, qr, _q.inters)
|
|
}
|
|
|
|
// AllX is like All, but panics if an error occurs.
|
|
func (_q *MatchQuery) AllX(ctx context.Context) []*Match {
|
|
nodes, err := _q.All(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return nodes
|
|
}
|
|
|
|
// IDs executes the query and returns a list of Match IDs.
|
|
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, _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 (_q *MatchQuery) IDsX(ctx context.Context) []uint64 {
|
|
ids, err := _q.IDs(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return ids
|
|
}
|
|
|
|
// Count returns the count of the given query.
|
|
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, _q, querierCount[*MatchQuery](), _q.inters)
|
|
}
|
|
|
|
// CountX is like Count, but panics if an error occurs.
|
|
func (_q *MatchQuery) CountX(ctx context.Context) int {
|
|
count, err := _q.Count(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return count
|
|
}
|
|
|
|
// Exist returns true if the query has elements in the graph.
|
|
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:
|
|
return false, fmt.Errorf("ent: check existence: %w", err)
|
|
default:
|
|
return true, nil
|
|
}
|
|
}
|
|
|
|
// ExistX is like Exist, but panics if an error occurs.
|
|
func (_q *MatchQuery) ExistX(ctx context.Context) bool {
|
|
exist, err := _q.Exist(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return exist
|
|
}
|
|
|
|
// 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 (_q *MatchQuery) Clone() *MatchQuery {
|
|
if _q == nil {
|
|
return nil
|
|
}
|
|
return &MatchQuery{
|
|
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: _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 (_q *MatchQuery) WithStats(opts ...func(*MatchPlayerQuery)) *MatchQuery {
|
|
query := (&MatchPlayerClient{config: _q.config}).Query()
|
|
for _, opt := range opts {
|
|
opt(query)
|
|
}
|
|
_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 (_q *MatchQuery) WithPlayers(opts ...func(*PlayerQuery)) *MatchQuery {
|
|
query := (&PlayerClient{config: _q.config}).Query()
|
|
for _, opt := range opts {
|
|
opt(query)
|
|
}
|
|
_q.withPlayers = query
|
|
return _q
|
|
}
|
|
|
|
// GroupBy is used to group vertices by one or more fields/columns.
|
|
// It is often used with aggregate functions, like: count, max, mean, min, sum.
|
|
//
|
|
// Example:
|
|
//
|
|
// var v []struct {
|
|
// ShareCode string `json:"share_code,omitempty"`
|
|
// Count int `json:"count,omitempty"`
|
|
// }
|
|
//
|
|
// client.Match.Query().
|
|
// GroupBy(match.FieldShareCode).
|
|
// Aggregate(ent.Count()).
|
|
// Scan(ctx, &v)
|
|
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
|
|
}
|
|
|
|
// Select allows the selection one or more fields/columns for the given query,
|
|
// instead of selecting all fields in the entity.
|
|
//
|
|
// Example:
|
|
//
|
|
// var v []struct {
|
|
// ShareCode string `json:"share_code,omitempty"`
|
|
// }
|
|
//
|
|
// client.Match.Query().
|
|
// Select(match.FieldShareCode).
|
|
// Scan(ctx, &v)
|
|
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 = &_q.ctx.Fields, sbuild.Scan
|
|
return sbuild
|
|
}
|
|
|
|
// Aggregate returns a MatchSelect configured with the given aggregations.
|
|
func (_q *MatchQuery) Aggregate(fns ...AggregateFunc) *MatchSelect {
|
|
return _q.Select().Aggregate(fns...)
|
|
}
|
|
|
|
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, _q); err != nil {
|
|
return err
|
|
}
|
|
}
|
|
}
|
|
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 _q.path != nil {
|
|
prev, err := _q.path(ctx)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
_q.sql = prev
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (_q *MatchQuery) sqlAll(ctx context.Context, hooks ...queryHook) ([]*Match, error) {
|
|
var (
|
|
nodes = []*Match{}
|
|
_spec = _q.querySpec()
|
|
loadedTypes = [2]bool{
|
|
_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: _q.config}
|
|
nodes = append(nodes, node)
|
|
node.Edges.loadedTypes = loadedTypes
|
|
return node.assignValues(columns, values)
|
|
}
|
|
if len(_q.modifiers) > 0 {
|
|
_spec.Modifiers = _q.modifiers
|
|
}
|
|
for i := range hooks {
|
|
hooks[i](ctx, _spec)
|
|
}
|
|
if err := sqlgraph.QueryNodes(ctx, _q.driver, _spec); err != nil {
|
|
return nil, err
|
|
}
|
|
if len(nodes) == 0 {
|
|
return nodes, nil
|
|
}
|
|
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 := _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
|
|
}
|
|
}
|
|
return nodes, nil
|
|
}
|
|
|
|
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 {
|
|
fks = append(fks, nodes[i].ID)
|
|
nodeids[nodes[i].ID] = nodes[i]
|
|
if init != nil {
|
|
init(nodes[i])
|
|
}
|
|
}
|
|
if len(query.ctx.Fields) > 0 {
|
|
query.ctx.AppendFieldOnce(matchplayer.FieldMatchStats)
|
|
}
|
|
query.Where(predicate.MatchPlayer(func(s *sql.Selector) {
|
|
s.Where(sql.InValues(s.C(match.StatsColumn), fks...))
|
|
}))
|
|
neighbors, err := query.All(ctx)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
for _, n := range neighbors {
|
|
fk := n.MatchStats
|
|
node, ok := nodeids[fk]
|
|
if !ok {
|
|
return fmt.Errorf(`unexpected referenced foreign-key "match_stats" returned %v for node %v`, fk, n.ID)
|
|
}
|
|
assign(node, n)
|
|
}
|
|
return nil
|
|
}
|
|
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{})
|
|
for i, node := range nodes {
|
|
edgeIDs[i] = node.ID
|
|
byID[node.ID] = node
|
|
if init != nil {
|
|
init(node)
|
|
}
|
|
}
|
|
query.Where(func(s *sql.Selector) {
|
|
joinT := sql.Table(match.PlayersTable)
|
|
s.Join(joinT).On(s.C(player.FieldID), joinT.C(match.PlayersPrimaryKey[0]))
|
|
s.Where(sql.InValues(joinT.C(match.PlayersPrimaryKey[1]), edgeIDs...))
|
|
columns := s.SelectedColumns()
|
|
s.Select(joinT.C(match.PlayersPrimaryKey[1]))
|
|
s.AppendSelect(columns...)
|
|
s.SetDistinct(false)
|
|
})
|
|
if err := query.prepareQuery(ctx); err != nil {
|
|
return err
|
|
}
|
|
qr := QuerierFunc(func(ctx context.Context, q Query) (Value, error) {
|
|
return query.sqlAll(ctx, func(_ context.Context, spec *sqlgraph.QuerySpec) {
|
|
assign := spec.Assign
|
|
values := spec.ScanValues
|
|
spec.ScanValues = func(columns []string) ([]any, error) {
|
|
values, err := values(columns[1:])
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return append([]any{new(sql.NullInt64)}, values...), nil
|
|
}
|
|
spec.Assign = func(columns []string, values []any) error {
|
|
outValue := uint64(values[0].(*sql.NullInt64).Int64)
|
|
inValue := uint64(values[1].(*sql.NullInt64).Int64)
|
|
if nids[inValue] == nil {
|
|
nids[inValue] = map[*Match]struct{}{byID[outValue]: {}}
|
|
return assign(columns[1:], values[1:])
|
|
}
|
|
nids[inValue][byID[outValue]] = struct{}{}
|
|
return nil
|
|
}
|
|
})
|
|
})
|
|
neighbors, err := withInterceptors[[]*Player](ctx, query, qr, query.inters)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
for _, n := range neighbors {
|
|
nodes, ok := nids[n.ID]
|
|
if !ok {
|
|
return fmt.Errorf(`unexpected "players" node returned %v`, n.ID)
|
|
}
|
|
for kn := range nodes {
|
|
assign(kn, n)
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (_q *MatchQuery) sqlCount(ctx context.Context) (int, error) {
|
|
_spec := _q.querySpec()
|
|
if len(_q.modifiers) > 0 {
|
|
_spec.Modifiers = _q.modifiers
|
|
}
|
|
_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, _q.driver, _spec)
|
|
}
|
|
|
|
func (_q *MatchQuery) querySpec() *sqlgraph.QuerySpec {
|
|
_spec := sqlgraph.NewQuerySpec(match.Table, match.Columns, sqlgraph.NewFieldSpec(match.FieldID, field.TypeUint64))
|
|
_spec.From = _q.sql
|
|
if unique := _q.ctx.Unique; unique != nil {
|
|
_spec.Unique = *unique
|
|
} else if _q.path != nil {
|
|
_spec.Unique = true
|
|
}
|
|
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 {
|
|
if fields[i] != match.FieldID {
|
|
_spec.Node.Columns = append(_spec.Node.Columns, fields[i])
|
|
}
|
|
}
|
|
}
|
|
if ps := _q.predicates; len(ps) > 0 {
|
|
_spec.Predicate = func(selector *sql.Selector) {
|
|
for i := range ps {
|
|
ps[i](selector)
|
|
}
|
|
}
|
|
}
|
|
if limit := _q.ctx.Limit; limit != nil {
|
|
_spec.Limit = *limit
|
|
}
|
|
if offset := _q.ctx.Offset; offset != nil {
|
|
_spec.Offset = *offset
|
|
}
|
|
if ps := _q.order; len(ps) > 0 {
|
|
_spec.Order = func(selector *sql.Selector) {
|
|
for i := range ps {
|
|
ps[i](selector)
|
|
}
|
|
}
|
|
}
|
|
return _spec
|
|
}
|
|
|
|
func (_q *MatchQuery) sqlQuery(ctx context.Context) *sql.Selector {
|
|
builder := sql.Dialect(_q.driver.Dialect())
|
|
t1 := builder.Table(match.Table)
|
|
columns := _q.ctx.Fields
|
|
if len(columns) == 0 {
|
|
columns = match.Columns
|
|
}
|
|
selector := builder.Select(t1.Columns(columns...)...).From(t1)
|
|
if _q.sql != nil {
|
|
selector = _q.sql
|
|
selector.Select(selector.Columns(columns...)...)
|
|
}
|
|
if _q.ctx.Unique != nil && *_q.ctx.Unique {
|
|
selector.Distinct()
|
|
}
|
|
for _, m := range _q.modifiers {
|
|
m(selector)
|
|
}
|
|
for _, p := range _q.predicates {
|
|
p(selector)
|
|
}
|
|
for _, p := range _q.order {
|
|
p(selector)
|
|
}
|
|
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 := _q.ctx.Limit; limit != nil {
|
|
selector.Limit(*limit)
|
|
}
|
|
return selector
|
|
}
|
|
|
|
// Modify adds a query modifier for attaching custom logic to queries.
|
|
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.
|
|
type MatchGroupBy struct {
|
|
selector
|
|
build *MatchQuery
|
|
}
|
|
|
|
// Aggregate adds the given aggregation functions to the group-by query.
|
|
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 (_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, _g.build, _g, _g.build.inters, v)
|
|
}
|
|
|
|
func (_g *MatchGroupBy) sqlScan(ctx context.Context, root *MatchQuery, v any) error {
|
|
selector := root.sqlQuery(ctx).Select()
|
|
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(*_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(*_g.flds...)...)
|
|
if err := selector.Err(); err != nil {
|
|
return err
|
|
}
|
|
rows := &sql.Rows{}
|
|
query, args := selector.Query()
|
|
if err := _g.build.driver.Query(ctx, query, args, rows); err != nil {
|
|
return err
|
|
}
|
|
defer rows.Close()
|
|
return sql.ScanSlice(rows, v)
|
|
}
|
|
|
|
// MatchSelect is the builder for selecting fields of Match entities.
|
|
type MatchSelect struct {
|
|
*MatchQuery
|
|
selector
|
|
}
|
|
|
|
// Aggregate adds the given aggregation functions to the selector query.
|
|
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 (_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, _s.MatchQuery, _s, _s.inters, v)
|
|
}
|
|
|
|
func (_s *MatchSelect) sqlScan(ctx context.Context, root *MatchQuery, v any) error {
|
|
selector := root.sqlQuery(ctx)
|
|
aggregation := make([]string, 0, len(_s.fns))
|
|
for _, fn := range _s.fns {
|
|
aggregation = append(aggregation, fn(selector))
|
|
}
|
|
switch n := len(*_s.selector.flds); {
|
|
case n == 0 && len(aggregation) > 0:
|
|
selector.Select(aggregation...)
|
|
case n != 0 && len(aggregation) > 0:
|
|
selector.AppendSelect(aggregation...)
|
|
}
|
|
rows := &sql.Rows{}
|
|
query, args := selector.Query()
|
|
if err := _s.driver.Query(ctx, query, args, rows); err != nil {
|
|
return err
|
|
}
|
|
defer rows.Close()
|
|
return sql.ScanSlice(rows, v)
|
|
}
|
|
|
|
// Modify adds a query modifier for attaching custom logic to queries.
|
|
func (_s *MatchSelect) Modify(modifiers ...func(s *sql.Selector)) *MatchSelect {
|
|
_s.modifiers = append(_s.modifiers, modifiers...)
|
|
return _s
|
|
}
|