614 lines
16 KiB
Go
614 lines
16 KiB
Go
|
// Code generated by ent, DO NOT EDIT.
|
||
|
|
||
|
package ent
|
||
|
|
||
|
import (
|
||
|
"api/ent/ma"
|
||
|
"api/ent/predicate"
|
||
|
"api/ent/user"
|
||
|
"context"
|
||
|
"fmt"
|
||
|
"math"
|
||
|
|
||
|
"entgo.io/ent/dialect/sql"
|
||
|
"entgo.io/ent/dialect/sql/sqlgraph"
|
||
|
"entgo.io/ent/schema/field"
|
||
|
)
|
||
|
|
||
|
// MaQuery is the builder for querying Ma entities.
|
||
|
type MaQuery struct {
|
||
|
config
|
||
|
ctx *QueryContext
|
||
|
order []ma.OrderOption
|
||
|
inters []Interceptor
|
||
|
predicates []predicate.Ma
|
||
|
withOwner *UserQuery
|
||
|
withFKs bool
|
||
|
// intermediate query (i.e. traversal path).
|
||
|
sql *sql.Selector
|
||
|
path func(context.Context) (*sql.Selector, error)
|
||
|
}
|
||
|
|
||
|
// Where adds a new predicate for the MaQuery builder.
|
||
|
func (mq *MaQuery) Where(ps ...predicate.Ma) *MaQuery {
|
||
|
mq.predicates = append(mq.predicates, ps...)
|
||
|
return mq
|
||
|
}
|
||
|
|
||
|
// Limit the number of records to be returned by this query.
|
||
|
func (mq *MaQuery) Limit(limit int) *MaQuery {
|
||
|
mq.ctx.Limit = &limit
|
||
|
return mq
|
||
|
}
|
||
|
|
||
|
// Offset to start from.
|
||
|
func (mq *MaQuery) Offset(offset int) *MaQuery {
|
||
|
mq.ctx.Offset = &offset
|
||
|
return mq
|
||
|
}
|
||
|
|
||
|
// 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 *MaQuery) Unique(unique bool) *MaQuery {
|
||
|
mq.ctx.Unique = &unique
|
||
|
return mq
|
||
|
}
|
||
|
|
||
|
// Order specifies how the records should be ordered.
|
||
|
func (mq *MaQuery) Order(o ...ma.OrderOption) *MaQuery {
|
||
|
mq.order = append(mq.order, o...)
|
||
|
return mq
|
||
|
}
|
||
|
|
||
|
// QueryOwner chains the current query on the "owner" edge.
|
||
|
func (mq *MaQuery) QueryOwner() *UserQuery {
|
||
|
query := (&UserClient{config: mq.config}).Query()
|
||
|
query.path = func(ctx context.Context) (fromU *sql.Selector, err error) {
|
||
|
if err := mq.prepareQuery(ctx); err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
selector := mq.sqlQuery(ctx)
|
||
|
if err := selector.Err(); err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
step := sqlgraph.NewStep(
|
||
|
sqlgraph.From(ma.Table, ma.FieldID, selector),
|
||
|
sqlgraph.To(user.Table, user.FieldID),
|
||
|
sqlgraph.Edge(sqlgraph.M2O, true, ma.OwnerTable, ma.OwnerColumn),
|
||
|
)
|
||
|
fromU = sqlgraph.SetNeighbors(mq.driver.Dialect(), step)
|
||
|
return fromU, nil
|
||
|
}
|
||
|
return query
|
||
|
}
|
||
|
|
||
|
// First returns the first Ma entity from the query.
|
||
|
// Returns a *NotFoundError when no Ma was found.
|
||
|
func (mq *MaQuery) First(ctx context.Context) (*Ma, error) {
|
||
|
nodes, err := mq.Limit(1).All(setContextOp(ctx, mq.ctx, "First"))
|
||
|
if err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
if len(nodes) == 0 {
|
||
|
return nil, &NotFoundError{ma.Label}
|
||
|
}
|
||
|
return nodes[0], nil
|
||
|
}
|
||
|
|
||
|
// FirstX is like First, but panics if an error occurs.
|
||
|
func (mq *MaQuery) FirstX(ctx context.Context) *Ma {
|
||
|
node, err := mq.First(ctx)
|
||
|
if err != nil && !IsNotFound(err) {
|
||
|
panic(err)
|
||
|
}
|
||
|
return node
|
||
|
}
|
||
|
|
||
|
// FirstID returns the first Ma ID from the query.
|
||
|
// Returns a *NotFoundError when no Ma ID was found.
|
||
|
func (mq *MaQuery) FirstID(ctx context.Context) (id int, err error) {
|
||
|
var ids []int
|
||
|
if ids, err = mq.Limit(1).IDs(setContextOp(ctx, mq.ctx, "FirstID")); err != nil {
|
||
|
return
|
||
|
}
|
||
|
if len(ids) == 0 {
|
||
|
err = &NotFoundError{ma.Label}
|
||
|
return
|
||
|
}
|
||
|
return ids[0], nil
|
||
|
}
|
||
|
|
||
|
// FirstIDX is like FirstID, but panics if an error occurs.
|
||
|
func (mq *MaQuery) FirstIDX(ctx context.Context) int {
|
||
|
id, err := mq.FirstID(ctx)
|
||
|
if err != nil && !IsNotFound(err) {
|
||
|
panic(err)
|
||
|
}
|
||
|
return id
|
||
|
}
|
||
|
|
||
|
// Only returns a single Ma entity found by the query, ensuring it only returns one.
|
||
|
// Returns a *NotSingularError when more than one Ma entity is found.
|
||
|
// Returns a *NotFoundError when no Ma entities are found.
|
||
|
func (mq *MaQuery) Only(ctx context.Context) (*Ma, error) {
|
||
|
nodes, err := mq.Limit(2).All(setContextOp(ctx, mq.ctx, "Only"))
|
||
|
if err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
switch len(nodes) {
|
||
|
case 1:
|
||
|
return nodes[0], nil
|
||
|
case 0:
|
||
|
return nil, &NotFoundError{ma.Label}
|
||
|
default:
|
||
|
return nil, &NotSingularError{ma.Label}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// OnlyX is like Only, but panics if an error occurs.
|
||
|
func (mq *MaQuery) OnlyX(ctx context.Context) *Ma {
|
||
|
node, err := mq.Only(ctx)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
return node
|
||
|
}
|
||
|
|
||
|
// OnlyID is like Only, but returns the only Ma ID in the query.
|
||
|
// Returns a *NotSingularError when more than one Ma ID is found.
|
||
|
// Returns a *NotFoundError when no entities are found.
|
||
|
func (mq *MaQuery) OnlyID(ctx context.Context) (id int, err error) {
|
||
|
var ids []int
|
||
|
if ids, err = mq.Limit(2).IDs(setContextOp(ctx, mq.ctx, "OnlyID")); err != nil {
|
||
|
return
|
||
|
}
|
||
|
switch len(ids) {
|
||
|
case 1:
|
||
|
id = ids[0]
|
||
|
case 0:
|
||
|
err = &NotFoundError{ma.Label}
|
||
|
default:
|
||
|
err = &NotSingularError{ma.Label}
|
||
|
}
|
||
|
return
|
||
|
}
|
||
|
|
||
|
// OnlyIDX is like OnlyID, but panics if an error occurs.
|
||
|
func (mq *MaQuery) OnlyIDX(ctx context.Context) int {
|
||
|
id, err := mq.OnlyID(ctx)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
return id
|
||
|
}
|
||
|
|
||
|
// All executes the query and returns a list of Mas.
|
||
|
func (mq *MaQuery) All(ctx context.Context) ([]*Ma, error) {
|
||
|
ctx = setContextOp(ctx, mq.ctx, "All")
|
||
|
if err := mq.prepareQuery(ctx); err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
qr := querierAll[[]*Ma, *MaQuery]()
|
||
|
return withInterceptors[[]*Ma](ctx, mq, qr, mq.inters)
|
||
|
}
|
||
|
|
||
|
// AllX is like All, but panics if an error occurs.
|
||
|
func (mq *MaQuery) AllX(ctx context.Context) []*Ma {
|
||
|
nodes, err := mq.All(ctx)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
return nodes
|
||
|
}
|
||
|
|
||
|
// IDs executes the query and returns a list of Ma IDs.
|
||
|
func (mq *MaQuery) IDs(ctx context.Context) (ids []int, err error) {
|
||
|
if mq.ctx.Unique == nil && mq.path != nil {
|
||
|
mq.Unique(true)
|
||
|
}
|
||
|
ctx = setContextOp(ctx, mq.ctx, "IDs")
|
||
|
if err = mq.Select(ma.FieldID).Scan(ctx, &ids); err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
return ids, nil
|
||
|
}
|
||
|
|
||
|
// IDsX is like IDs, but panics if an error occurs.
|
||
|
func (mq *MaQuery) IDsX(ctx context.Context) []int {
|
||
|
ids, err := mq.IDs(ctx)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
return ids
|
||
|
}
|
||
|
|
||
|
// Count returns the count of the given query.
|
||
|
func (mq *MaQuery) Count(ctx context.Context) (int, error) {
|
||
|
ctx = setContextOp(ctx, mq.ctx, "Count")
|
||
|
if err := mq.prepareQuery(ctx); err != nil {
|
||
|
return 0, err
|
||
|
}
|
||
|
return withInterceptors[int](ctx, mq, querierCount[*MaQuery](), mq.inters)
|
||
|
}
|
||
|
|
||
|
// CountX is like Count, but panics if an error occurs.
|
||
|
func (mq *MaQuery) CountX(ctx context.Context) int {
|
||
|
count, err := mq.Count(ctx)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
return count
|
||
|
}
|
||
|
|
||
|
// Exist returns true if the query has elements in the graph.
|
||
|
func (mq *MaQuery) Exist(ctx context.Context) (bool, error) {
|
||
|
ctx = setContextOp(ctx, mq.ctx, "Exist")
|
||
|
switch _, err := mq.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 (mq *MaQuery) ExistX(ctx context.Context) bool {
|
||
|
exist, err := mq.Exist(ctx)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
return exist
|
||
|
}
|
||
|
|
||
|
// Clone returns a duplicate of the MaQuery 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 *MaQuery) Clone() *MaQuery {
|
||
|
if mq == nil {
|
||
|
return nil
|
||
|
}
|
||
|
return &MaQuery{
|
||
|
config: mq.config,
|
||
|
ctx: mq.ctx.Clone(),
|
||
|
order: append([]ma.OrderOption{}, mq.order...),
|
||
|
inters: append([]Interceptor{}, mq.inters...),
|
||
|
predicates: append([]predicate.Ma{}, mq.predicates...),
|
||
|
withOwner: mq.withOwner.Clone(),
|
||
|
// clone intermediate query.
|
||
|
sql: mq.sql.Clone(),
|
||
|
path: mq.path,
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// WithOwner tells the query-builder to eager-load the nodes that are connected to
|
||
|
// the "owner" edge. The optional arguments are used to configure the query builder of the edge.
|
||
|
func (mq *MaQuery) WithOwner(opts ...func(*UserQuery)) *MaQuery {
|
||
|
query := (&UserClient{config: mq.config}).Query()
|
||
|
for _, opt := range opts {
|
||
|
opt(query)
|
||
|
}
|
||
|
mq.withOwner = query
|
||
|
return mq
|
||
|
}
|
||
|
|
||
|
// 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 {
|
||
|
// Password string `json:"password,omitempty"`
|
||
|
// Count int `json:"count,omitempty"`
|
||
|
// }
|
||
|
//
|
||
|
// client.Ma.Query().
|
||
|
// GroupBy(ma.FieldPassword).
|
||
|
// Aggregate(ent.Count()).
|
||
|
// Scan(ctx, &v)
|
||
|
func (mq *MaQuery) GroupBy(field string, fields ...string) *MaGroupBy {
|
||
|
mq.ctx.Fields = append([]string{field}, fields...)
|
||
|
grbuild := &MaGroupBy{build: mq}
|
||
|
grbuild.flds = &mq.ctx.Fields
|
||
|
grbuild.label = ma.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 {
|
||
|
// Password string `json:"password,omitempty"`
|
||
|
// }
|
||
|
//
|
||
|
// client.Ma.Query().
|
||
|
// Select(ma.FieldPassword).
|
||
|
// Scan(ctx, &v)
|
||
|
func (mq *MaQuery) Select(fields ...string) *MaSelect {
|
||
|
mq.ctx.Fields = append(mq.ctx.Fields, fields...)
|
||
|
sbuild := &MaSelect{MaQuery: mq}
|
||
|
sbuild.label = ma.Label
|
||
|
sbuild.flds, sbuild.scan = &mq.ctx.Fields, sbuild.Scan
|
||
|
return sbuild
|
||
|
}
|
||
|
|
||
|
// Aggregate returns a MaSelect configured with the given aggregations.
|
||
|
func (mq *MaQuery) Aggregate(fns ...AggregateFunc) *MaSelect {
|
||
|
return mq.Select().Aggregate(fns...)
|
||
|
}
|
||
|
|
||
|
func (mq *MaQuery) prepareQuery(ctx context.Context) error {
|
||
|
for _, inter := range mq.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 {
|
||
|
return err
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
for _, f := range mq.ctx.Fields {
|
||
|
if !ma.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 err != nil {
|
||
|
return err
|
||
|
}
|
||
|
mq.sql = prev
|
||
|
}
|
||
|
return nil
|
||
|
}
|
||
|
|
||
|
func (mq *MaQuery) sqlAll(ctx context.Context, hooks ...queryHook) ([]*Ma, error) {
|
||
|
var (
|
||
|
nodes = []*Ma{}
|
||
|
withFKs = mq.withFKs
|
||
|
_spec = mq.querySpec()
|
||
|
loadedTypes = [1]bool{
|
||
|
mq.withOwner != nil,
|
||
|
}
|
||
|
)
|
||
|
if mq.withOwner != nil {
|
||
|
withFKs = true
|
||
|
}
|
||
|
if withFKs {
|
||
|
_spec.Node.Columns = append(_spec.Node.Columns, ma.ForeignKeys...)
|
||
|
}
|
||
|
_spec.ScanValues = func(columns []string) ([]any, error) {
|
||
|
return (*Ma).scanValues(nil, columns)
|
||
|
}
|
||
|
_spec.Assign = func(columns []string, values []any) error {
|
||
|
node := &Ma{config: mq.config}
|
||
|
nodes = append(nodes, node)
|
||
|
node.Edges.loadedTypes = loadedTypes
|
||
|
return node.assignValues(columns, values)
|
||
|
}
|
||
|
for i := range hooks {
|
||
|
hooks[i](ctx, _spec)
|
||
|
}
|
||
|
if err := sqlgraph.QueryNodes(ctx, mq.driver, _spec); err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
if len(nodes) == 0 {
|
||
|
return nodes, nil
|
||
|
}
|
||
|
if query := mq.withOwner; query != nil {
|
||
|
if err := mq.loadOwner(ctx, query, nodes, nil,
|
||
|
func(n *Ma, e *User) { n.Edges.Owner = e }); err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
}
|
||
|
return nodes, nil
|
||
|
}
|
||
|
|
||
|
func (mq *MaQuery) loadOwner(ctx context.Context, query *UserQuery, nodes []*Ma, init func(*Ma), assign func(*Ma, *User)) error {
|
||
|
ids := make([]int, 0, len(nodes))
|
||
|
nodeids := make(map[int][]*Ma)
|
||
|
for i := range nodes {
|
||
|
if nodes[i].user_ma == nil {
|
||
|
continue
|
||
|
}
|
||
|
fk := *nodes[i].user_ma
|
||
|
if _, ok := nodeids[fk]; !ok {
|
||
|
ids = append(ids, fk)
|
||
|
}
|
||
|
nodeids[fk] = append(nodeids[fk], nodes[i])
|
||
|
}
|
||
|
if len(ids) == 0 {
|
||
|
return nil
|
||
|
}
|
||
|
query.Where(user.IDIn(ids...))
|
||
|
neighbors, err := query.All(ctx)
|
||
|
if err != nil {
|
||
|
return err
|
||
|
}
|
||
|
for _, n := range neighbors {
|
||
|
nodes, ok := nodeids[n.ID]
|
||
|
if !ok {
|
||
|
return fmt.Errorf(`unexpected foreign-key "user_ma" returned %v`, n.ID)
|
||
|
}
|
||
|
for i := range nodes {
|
||
|
assign(nodes[i], n)
|
||
|
}
|
||
|
}
|
||
|
return nil
|
||
|
}
|
||
|
|
||
|
func (mq *MaQuery) sqlCount(ctx context.Context) (int, error) {
|
||
|
_spec := mq.querySpec()
|
||
|
_spec.Node.Columns = mq.ctx.Fields
|
||
|
if len(mq.ctx.Fields) > 0 {
|
||
|
_spec.Unique = mq.ctx.Unique != nil && *mq.ctx.Unique
|
||
|
}
|
||
|
return sqlgraph.CountNodes(ctx, mq.driver, _spec)
|
||
|
}
|
||
|
|
||
|
func (mq *MaQuery) querySpec() *sqlgraph.QuerySpec {
|
||
|
_spec := sqlgraph.NewQuerySpec(ma.Table, ma.Columns, sqlgraph.NewFieldSpec(ma.FieldID, field.TypeInt))
|
||
|
_spec.From = mq.sql
|
||
|
if unique := mq.ctx.Unique; unique != nil {
|
||
|
_spec.Unique = *unique
|
||
|
} else if mq.path != nil {
|
||
|
_spec.Unique = true
|
||
|
}
|
||
|
if fields := mq.ctx.Fields; len(fields) > 0 {
|
||
|
_spec.Node.Columns = make([]string, 0, len(fields))
|
||
|
_spec.Node.Columns = append(_spec.Node.Columns, ma.FieldID)
|
||
|
for i := range fields {
|
||
|
if fields[i] != ma.FieldID {
|
||
|
_spec.Node.Columns = append(_spec.Node.Columns, fields[i])
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
if ps := mq.predicates; len(ps) > 0 {
|
||
|
_spec.Predicate = func(selector *sql.Selector) {
|
||
|
for i := range ps {
|
||
|
ps[i](selector)
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
if limit := mq.ctx.Limit; limit != nil {
|
||
|
_spec.Limit = *limit
|
||
|
}
|
||
|
if offset := mq.ctx.Offset; offset != nil {
|
||
|
_spec.Offset = *offset
|
||
|
}
|
||
|
if ps := mq.order; len(ps) > 0 {
|
||
|
_spec.Order = func(selector *sql.Selector) {
|
||
|
for i := range ps {
|
||
|
ps[i](selector)
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
return _spec
|
||
|
}
|
||
|
|
||
|
func (mq *MaQuery) sqlQuery(ctx context.Context) *sql.Selector {
|
||
|
builder := sql.Dialect(mq.driver.Dialect())
|
||
|
t1 := builder.Table(ma.Table)
|
||
|
columns := mq.ctx.Fields
|
||
|
if len(columns) == 0 {
|
||
|
columns = ma.Columns
|
||
|
}
|
||
|
selector := builder.Select(t1.Columns(columns...)...).From(t1)
|
||
|
if mq.sql != nil {
|
||
|
selector = mq.sql
|
||
|
selector.Select(selector.Columns(columns...)...)
|
||
|
}
|
||
|
if mq.ctx.Unique != nil && *mq.ctx.Unique {
|
||
|
selector.Distinct()
|
||
|
}
|
||
|
for _, p := range mq.predicates {
|
||
|
p(selector)
|
||
|
}
|
||
|
for _, p := range mq.order {
|
||
|
p(selector)
|
||
|
}
|
||
|
if offset := mq.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 {
|
||
|
selector.Limit(*limit)
|
||
|
}
|
||
|
return selector
|
||
|
}
|
||
|
|
||
|
// MaGroupBy is the group-by builder for Ma entities.
|
||
|
type MaGroupBy struct {
|
||
|
selector
|
||
|
build *MaQuery
|
||
|
}
|
||
|
|
||
|
// Aggregate adds the given aggregation functions to the group-by query.
|
||
|
func (mgb *MaGroupBy) Aggregate(fns ...AggregateFunc) *MaGroupBy {
|
||
|
mgb.fns = append(mgb.fns, fns...)
|
||
|
return mgb
|
||
|
}
|
||
|
|
||
|
// Scan applies the selector query and scans the result into the given value.
|
||
|
func (mgb *MaGroupBy) Scan(ctx context.Context, v any) error {
|
||
|
ctx = setContextOp(ctx, mgb.build.ctx, "GroupBy")
|
||
|
if err := mgb.build.prepareQuery(ctx); err != nil {
|
||
|
return err
|
||
|
}
|
||
|
return scanWithInterceptors[*MaQuery, *MaGroupBy](ctx, mgb.build, mgb, mgb.build.inters, v)
|
||
|
}
|
||
|
|
||
|
func (mgb *MaGroupBy) sqlScan(ctx context.Context, root *MaQuery, v any) error {
|
||
|
selector := root.sqlQuery(ctx).Select()
|
||
|
aggregation := make([]string, 0, len(mgb.fns))
|
||
|
for _, fn := range mgb.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 = append(columns, selector.C(f))
|
||
|
}
|
||
|
columns = append(columns, aggregation...)
|
||
|
selector.Select(columns...)
|
||
|
}
|
||
|
selector.GroupBy(selector.Columns(*mgb.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 {
|
||
|
return err
|
||
|
}
|
||
|
defer rows.Close()
|
||
|
return sql.ScanSlice(rows, v)
|
||
|
}
|
||
|
|
||
|
// MaSelect is the builder for selecting fields of Ma entities.
|
||
|
type MaSelect struct {
|
||
|
*MaQuery
|
||
|
selector
|
||
|
}
|
||
|
|
||
|
// Aggregate adds the given aggregation functions to the selector query.
|
||
|
func (ms *MaSelect) Aggregate(fns ...AggregateFunc) *MaSelect {
|
||
|
ms.fns = append(ms.fns, fns...)
|
||
|
return ms
|
||
|
}
|
||
|
|
||
|
// Scan applies the selector query and scans the result into the given value.
|
||
|
func (ms *MaSelect) Scan(ctx context.Context, v any) error {
|
||
|
ctx = setContextOp(ctx, ms.ctx, "Select")
|
||
|
if err := ms.prepareQuery(ctx); err != nil {
|
||
|
return err
|
||
|
}
|
||
|
return scanWithInterceptors[*MaQuery, *MaSelect](ctx, ms.MaQuery, ms, ms.inters, v)
|
||
|
}
|
||
|
|
||
|
func (ms *MaSelect) sqlScan(ctx context.Context, root *MaQuery, v any) error {
|
||
|
selector := root.sqlQuery(ctx)
|
||
|
aggregation := make([]string, 0, len(ms.fns))
|
||
|
for _, fn := range ms.fns {
|
||
|
aggregation = append(aggregation, fn(selector))
|
||
|
}
|
||
|
switch n := len(*ms.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 := ms.driver.Query(ctx, query, args, rows); err != nil {
|
||
|
return err
|
||
|
}
|
||
|
defer rows.Close()
|
||
|
return sql.ScanSlice(rows, v)
|
||
|
}
|