homebox/backend/internal/data/ent/label_query.go

721 lines
20 KiB
Go
Raw Normal View History

2022-08-30 18:04:50 +00:00
// Code generated by ent, DO NOT EDIT.
package ent
import (
"context"
"database/sql/driver"
"fmt"
"math"
"entgo.io/ent/dialect/sql"
"entgo.io/ent/dialect/sql/sqlgraph"
"entgo.io/ent/schema/field"
"github.com/google/uuid"
"github.com/hay-kot/homebox/backend/internal/data/ent/group"
"github.com/hay-kot/homebox/backend/internal/data/ent/item"
"github.com/hay-kot/homebox/backend/internal/data/ent/label"
"github.com/hay-kot/homebox/backend/internal/data/ent/predicate"
2022-08-30 18:04:50 +00:00
)
// LabelQuery is the builder for querying Label entities.
type LabelQuery struct {
config
2023-01-28 21:03:51 +00:00
ctx *QueryContext
2022-08-30 18:04:50 +00:00
order []OrderFunc
inters []Interceptor
2022-08-30 18:04:50 +00:00
predicates []predicate.Label
withGroup *GroupQuery
withItems *ItemQuery
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 LabelQuery builder.
func (lq *LabelQuery) Where(ps ...predicate.Label) *LabelQuery {
lq.predicates = append(lq.predicates, ps...)
return lq
}
// Limit the number of records to be returned by this query.
2022-08-30 18:04:50 +00:00
func (lq *LabelQuery) Limit(limit int) *LabelQuery {
2023-01-28 21:03:51 +00:00
lq.ctx.Limit = &limit
2022-08-30 18:04:50 +00:00
return lq
}
// Offset to start from.
2022-08-30 18:04:50 +00:00
func (lq *LabelQuery) Offset(offset int) *LabelQuery {
2023-01-28 21:03:51 +00:00
lq.ctx.Offset = &offset
2022-08-30 18:04:50 +00:00
return lq
}
// 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 (lq *LabelQuery) Unique(unique bool) *LabelQuery {
2023-01-28 21:03:51 +00:00
lq.ctx.Unique = &unique
2022-08-30 18:04:50 +00:00
return lq
}
// Order specifies how the records should be ordered.
2022-08-30 18:04:50 +00:00
func (lq *LabelQuery) Order(o ...OrderFunc) *LabelQuery {
lq.order = append(lq.order, o...)
return lq
}
// QueryGroup chains the current query on the "group" edge.
func (lq *LabelQuery) QueryGroup() *GroupQuery {
query := (&GroupClient{config: lq.config}).Query()
2022-08-30 18:04:50 +00:00
query.path = func(ctx context.Context) (fromU *sql.Selector, err error) {
if err := lq.prepareQuery(ctx); err != nil {
return nil, err
}
selector := lq.sqlQuery(ctx)
if err := selector.Err(); err != nil {
return nil, err
}
step := sqlgraph.NewStep(
sqlgraph.From(label.Table, label.FieldID, selector),
sqlgraph.To(group.Table, group.FieldID),
sqlgraph.Edge(sqlgraph.M2O, true, label.GroupTable, label.GroupColumn),
)
fromU = sqlgraph.SetNeighbors(lq.driver.Dialect(), step)
return fromU, nil
}
return query
}
// QueryItems chains the current query on the "items" edge.
func (lq *LabelQuery) QueryItems() *ItemQuery {
query := (&ItemClient{config: lq.config}).Query()
2022-08-30 18:04:50 +00:00
query.path = func(ctx context.Context) (fromU *sql.Selector, err error) {
if err := lq.prepareQuery(ctx); err != nil {
return nil, err
}
selector := lq.sqlQuery(ctx)
if err := selector.Err(); err != nil {
return nil, err
}
step := sqlgraph.NewStep(
sqlgraph.From(label.Table, label.FieldID, selector),
sqlgraph.To(item.Table, item.FieldID),
sqlgraph.Edge(sqlgraph.M2M, false, label.ItemsTable, label.ItemsPrimaryKey...),
)
fromU = sqlgraph.SetNeighbors(lq.driver.Dialect(), step)
return fromU, nil
}
return query
}
// First returns the first Label entity from the query.
// Returns a *NotFoundError when no Label was found.
func (lq *LabelQuery) First(ctx context.Context) (*Label, error) {
2023-01-28 21:03:51 +00:00
nodes, err := lq.Limit(1).All(setContextOp(ctx, lq.ctx, "First"))
2022-08-30 18:04:50 +00:00
if err != nil {
return nil, err
}
if len(nodes) == 0 {
return nil, &NotFoundError{label.Label}
}
return nodes[0], nil
}
// FirstX is like First, but panics if an error occurs.
func (lq *LabelQuery) FirstX(ctx context.Context) *Label {
node, err := lq.First(ctx)
if err != nil && !IsNotFound(err) {
panic(err)
}
return node
}
// FirstID returns the first Label ID from the query.
// Returns a *NotFoundError when no Label ID was found.
func (lq *LabelQuery) FirstID(ctx context.Context) (id uuid.UUID, err error) {
var ids []uuid.UUID
2023-01-28 21:03:51 +00:00
if ids, err = lq.Limit(1).IDs(setContextOp(ctx, lq.ctx, "FirstID")); err != nil {
2022-08-30 18:04:50 +00:00
return
}
if len(ids) == 0 {
err = &NotFoundError{label.Label}
return
}
return ids[0], nil
}
// FirstIDX is like FirstID, but panics if an error occurs.
func (lq *LabelQuery) FirstIDX(ctx context.Context) uuid.UUID {
id, err := lq.FirstID(ctx)
if err != nil && !IsNotFound(err) {
panic(err)
}
return id
}
// Only returns a single Label entity found by the query, ensuring it only returns one.
// Returns a *NotSingularError when more than one Label entity is found.
// Returns a *NotFoundError when no Label entities are found.
func (lq *LabelQuery) Only(ctx context.Context) (*Label, error) {
2023-01-28 21:03:51 +00:00
nodes, err := lq.Limit(2).All(setContextOp(ctx, lq.ctx, "Only"))
2022-08-30 18:04:50 +00:00
if err != nil {
return nil, err
}
switch len(nodes) {
case 1:
return nodes[0], nil
case 0:
return nil, &NotFoundError{label.Label}
default:
return nil, &NotSingularError{label.Label}
}
}
// OnlyX is like Only, but panics if an error occurs.
func (lq *LabelQuery) OnlyX(ctx context.Context) *Label {
node, err := lq.Only(ctx)
if err != nil {
panic(err)
}
return node
}
// OnlyID is like Only, but returns the only Label ID in the query.
// Returns a *NotSingularError when more than one Label ID is found.
// Returns a *NotFoundError when no entities are found.
func (lq *LabelQuery) OnlyID(ctx context.Context) (id uuid.UUID, err error) {
var ids []uuid.UUID
2023-01-28 21:03:51 +00:00
if ids, err = lq.Limit(2).IDs(setContextOp(ctx, lq.ctx, "OnlyID")); err != nil {
2022-08-30 18:04:50 +00:00
return
}
switch len(ids) {
case 1:
id = ids[0]
case 0:
err = &NotFoundError{label.Label}
default:
err = &NotSingularError{label.Label}
}
return
}
// OnlyIDX is like OnlyID, but panics if an error occurs.
func (lq *LabelQuery) OnlyIDX(ctx context.Context) uuid.UUID {
id, err := lq.OnlyID(ctx)
if err != nil {
panic(err)
}
return id
}
// All executes the query and returns a list of Labels.
func (lq *LabelQuery) All(ctx context.Context) ([]*Label, error) {
2023-01-28 21:03:51 +00:00
ctx = setContextOp(ctx, lq.ctx, "All")
2022-08-30 18:04:50 +00:00
if err := lq.prepareQuery(ctx); err != nil {
return nil, err
}
qr := querierAll[[]*Label, *LabelQuery]()
return withInterceptors[[]*Label](ctx, lq, qr, lq.inters)
2022-08-30 18:04:50 +00:00
}
// AllX is like All, but panics if an error occurs.
func (lq *LabelQuery) AllX(ctx context.Context) []*Label {
nodes, err := lq.All(ctx)
if err != nil {
panic(err)
}
return nodes
}
// IDs executes the query and returns a list of Label IDs.
func (lq *LabelQuery) IDs(ctx context.Context) (ids []uuid.UUID, err error) {
if lq.ctx.Unique == nil && lq.path != nil {
lq.Unique(true)
}
2023-01-28 21:03:51 +00:00
ctx = setContextOp(ctx, lq.ctx, "IDs")
if err = lq.Select(label.FieldID).Scan(ctx, &ids); err != nil {
2022-08-30 18:04:50 +00:00
return nil, err
}
return ids, nil
}
// IDsX is like IDs, but panics if an error occurs.
func (lq *LabelQuery) IDsX(ctx context.Context) []uuid.UUID {
ids, err := lq.IDs(ctx)
if err != nil {
panic(err)
}
return ids
}
// Count returns the count of the given query.
func (lq *LabelQuery) Count(ctx context.Context) (int, error) {
2023-01-28 21:03:51 +00:00
ctx = setContextOp(ctx, lq.ctx, "Count")
2022-08-30 18:04:50 +00:00
if err := lq.prepareQuery(ctx); err != nil {
return 0, err
}
return withInterceptors[int](ctx, lq, querierCount[*LabelQuery](), lq.inters)
2022-08-30 18:04:50 +00:00
}
// CountX is like Count, but panics if an error occurs.
func (lq *LabelQuery) CountX(ctx context.Context) int {
count, err := lq.Count(ctx)
if err != nil {
panic(err)
}
return count
}
// Exist returns true if the query has elements in the graph.
func (lq *LabelQuery) Exist(ctx context.Context) (bool, error) {
2023-01-28 21:03:51 +00:00
ctx = setContextOp(ctx, lq.ctx, "Exist")
switch _, err := lq.FirstID(ctx); {
case IsNotFound(err):
return false, nil
case err != nil:
return false, fmt.Errorf("ent: check existence: %w", err)
default:
return true, nil
2022-08-30 18:04:50 +00:00
}
}
// ExistX is like Exist, but panics if an error occurs.
func (lq *LabelQuery) ExistX(ctx context.Context) bool {
exist, err := lq.Exist(ctx)
if err != nil {
panic(err)
}
return exist
}
// Clone returns a duplicate of the LabelQuery builder, including all associated steps. It can be
// used to prepare common query builders and use them differently after the clone is made.
func (lq *LabelQuery) Clone() *LabelQuery {
if lq == nil {
return nil
}
return &LabelQuery{
config: lq.config,
2023-01-28 21:03:51 +00:00
ctx: lq.ctx.Clone(),
2022-08-30 18:04:50 +00:00
order: append([]OrderFunc{}, lq.order...),
inters: append([]Interceptor{}, lq.inters...),
2022-08-30 18:04:50 +00:00
predicates: append([]predicate.Label{}, lq.predicates...),
withGroup: lq.withGroup.Clone(),
withItems: lq.withItems.Clone(),
// clone intermediate query.
2023-01-28 21:03:51 +00:00
sql: lq.sql.Clone(),
path: lq.path,
2022-08-30 18:04:50 +00:00
}
}
// WithGroup tells the query-builder to eager-load the nodes that are connected to
// the "group" edge. The optional arguments are used to configure the query builder of the edge.
func (lq *LabelQuery) WithGroup(opts ...func(*GroupQuery)) *LabelQuery {
query := (&GroupClient{config: lq.config}).Query()
2022-08-30 18:04:50 +00:00
for _, opt := range opts {
opt(query)
}
lq.withGroup = query
return lq
}
// WithItems tells the query-builder to eager-load the nodes that are connected to
// the "items" edge. The optional arguments are used to configure the query builder of the edge.
func (lq *LabelQuery) WithItems(opts ...func(*ItemQuery)) *LabelQuery {
query := (&ItemClient{config: lq.config}).Query()
2022-08-30 18:04:50 +00:00
for _, opt := range opts {
opt(query)
}
lq.withItems = query
return lq
}
// 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 {
// CreatedAt time.Time `json:"created_at,omitempty"`
// Count int `json:"count,omitempty"`
// }
//
// client.Label.Query().
// GroupBy(label.FieldCreatedAt).
// Aggregate(ent.Count()).
// Scan(ctx, &v)
func (lq *LabelQuery) GroupBy(field string, fields ...string) *LabelGroupBy {
2023-01-28 21:03:51 +00:00
lq.ctx.Fields = append([]string{field}, fields...)
grbuild := &LabelGroupBy{build: lq}
2023-01-28 21:03:51 +00:00
grbuild.flds = &lq.ctx.Fields
2022-08-30 18:04:50 +00:00
grbuild.label = label.Label
grbuild.scan = grbuild.Scan
2022-08-30 18:04:50 +00:00
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 {
// CreatedAt time.Time `json:"created_at,omitempty"`
// }
//
// client.Label.Query().
// Select(label.FieldCreatedAt).
// Scan(ctx, &v)
func (lq *LabelQuery) Select(fields ...string) *LabelSelect {
2023-01-28 21:03:51 +00:00
lq.ctx.Fields = append(lq.ctx.Fields, fields...)
sbuild := &LabelSelect{LabelQuery: lq}
sbuild.label = label.Label
2023-01-28 21:03:51 +00:00
sbuild.flds, sbuild.scan = &lq.ctx.Fields, sbuild.Scan
return sbuild
2022-08-30 18:04:50 +00:00
}
// Aggregate returns a LabelSelect configured with the given aggregations.
func (lq *LabelQuery) Aggregate(fns ...AggregateFunc) *LabelSelect {
return lq.Select().Aggregate(fns...)
}
2022-08-30 18:04:50 +00:00
func (lq *LabelQuery) prepareQuery(ctx context.Context) error {
for _, inter := range lq.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, lq); err != nil {
return err
}
}
}
2023-01-28 21:03:51 +00:00
for _, f := range lq.ctx.Fields {
2022-08-30 18:04:50 +00:00
if !label.ValidColumn(f) {
return &ValidationError{Name: f, err: fmt.Errorf("ent: invalid field %q for query", f)}
}
}
if lq.path != nil {
prev, err := lq.path(ctx)
if err != nil {
return err
}
lq.sql = prev
}
return nil
}
func (lq *LabelQuery) sqlAll(ctx context.Context, hooks ...queryHook) ([]*Label, error) {
var (
nodes = []*Label{}
withFKs = lq.withFKs
_spec = lq.querySpec()
loadedTypes = [2]bool{
lq.withGroup != nil,
lq.withItems != nil,
}
)
if lq.withGroup != nil {
withFKs = true
}
if withFKs {
_spec.Node.Columns = append(_spec.Node.Columns, label.ForeignKeys...)
}
_spec.ScanValues = func(columns []string) ([]any, error) {
2022-08-30 18:04:50 +00:00
return (*Label).scanValues(nil, columns)
}
_spec.Assign = func(columns []string, values []any) error {
2022-08-30 18:04:50 +00:00
node := &Label{config: lq.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, lq.driver, _spec); err != nil {
return nil, err
}
if len(nodes) == 0 {
return nodes, nil
}
if query := lq.withGroup; query != nil {
if err := lq.loadGroup(ctx, query, nodes, nil,
func(n *Label, e *Group) { n.Edges.Group = e }); err != nil {
return nil, err
}
}
if query := lq.withItems; query != nil {
if err := lq.loadItems(ctx, query, nodes,
func(n *Label) { n.Edges.Items = []*Item{} },
func(n *Label, e *Item) { n.Edges.Items = append(n.Edges.Items, e) }); err != nil {
return nil, err
}
}
return nodes, nil
}
func (lq *LabelQuery) loadGroup(ctx context.Context, query *GroupQuery, nodes []*Label, init func(*Label), assign func(*Label, *Group)) error {
ids := make([]uuid.UUID, 0, len(nodes))
nodeids := make(map[uuid.UUID][]*Label)
for i := range nodes {
if nodes[i].group_labels == nil {
continue
}
fk := *nodes[i].group_labels
if _, ok := nodeids[fk]; !ok {
ids = append(ids, fk)
}
nodeids[fk] = append(nodeids[fk], nodes[i])
}
2023-01-28 21:03:51 +00:00
if len(ids) == 0 {
return nil
}
2022-08-30 18:04:50 +00:00
query.Where(group.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 "group_labels" returned %v`, n.ID)
}
for i := range nodes {
assign(nodes[i], n)
}
}
return nil
}
func (lq *LabelQuery) loadItems(ctx context.Context, query *ItemQuery, nodes []*Label, init func(*Label), assign func(*Label, *Item)) error {
edgeIDs := make([]driver.Value, len(nodes))
byID := make(map[uuid.UUID]*Label)
nids := make(map[uuid.UUID]map[*Label]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(label.ItemsTable)
s.Join(joinT).On(s.C(item.FieldID), joinT.C(label.ItemsPrimaryKey[1]))
s.Where(sql.InValues(joinT.C(label.ItemsPrimaryKey[0]), edgeIDs...))
columns := s.SelectedColumns()
s.Select(joinT.C(label.ItemsPrimaryKey[0]))
s.AppendSelect(columns...)
s.SetDistinct(false)
})
if err := query.prepareQuery(ctx); err != nil {
return err
}
2023-01-28 21:03:51 +00:00
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(uuid.UUID)}, values...), nil
2022-08-30 18:04:50 +00:00
}
2023-01-28 21:03:51 +00:00
spec.Assign = func(columns []string, values []any) error {
outValue := *values[0].(*uuid.UUID)
inValue := *values[1].(*uuid.UUID)
if nids[inValue] == nil {
nids[inValue] = map[*Label]struct{}{byID[outValue]: {}}
return assign(columns[1:], values[1:])
}
nids[inValue][byID[outValue]] = struct{}{}
return nil
2022-08-30 18:04:50 +00:00
}
2023-01-28 21:03:51 +00:00
})
2022-08-30 18:04:50 +00:00
})
2023-01-28 21:03:51 +00:00
neighbors, err := withInterceptors[[]*Item](ctx, query, qr, query.inters)
2022-08-30 18:04:50 +00:00
if err != nil {
return err
}
for _, n := range neighbors {
nodes, ok := nids[n.ID]
if !ok {
return fmt.Errorf(`unexpected "items" node returned %v`, n.ID)
}
for kn := range nodes {
assign(kn, n)
}
}
return nil
}
func (lq *LabelQuery) sqlCount(ctx context.Context) (int, error) {
_spec := lq.querySpec()
2023-01-28 21:03:51 +00:00
_spec.Node.Columns = lq.ctx.Fields
if len(lq.ctx.Fields) > 0 {
_spec.Unique = lq.ctx.Unique != nil && *lq.ctx.Unique
2022-08-30 18:04:50 +00:00
}
return sqlgraph.CountNodes(ctx, lq.driver, _spec)
}
func (lq *LabelQuery) querySpec() *sqlgraph.QuerySpec {
_spec := sqlgraph.NewQuerySpec(label.Table, label.Columns, sqlgraph.NewFieldSpec(label.FieldID, field.TypeUUID))
_spec.From = lq.sql
2023-01-28 21:03:51 +00:00
if unique := lq.ctx.Unique; unique != nil {
2022-08-30 18:04:50 +00:00
_spec.Unique = *unique
} else if lq.path != nil {
_spec.Unique = true
2022-08-30 18:04:50 +00:00
}
2023-01-28 21:03:51 +00:00
if fields := lq.ctx.Fields; len(fields) > 0 {
2022-08-30 18:04:50 +00:00
_spec.Node.Columns = make([]string, 0, len(fields))
_spec.Node.Columns = append(_spec.Node.Columns, label.FieldID)
for i := range fields {
if fields[i] != label.FieldID {
_spec.Node.Columns = append(_spec.Node.Columns, fields[i])
}
}
}
if ps := lq.predicates; len(ps) > 0 {
_spec.Predicate = func(selector *sql.Selector) {
for i := range ps {
ps[i](selector)
}
}
}
2023-01-28 21:03:51 +00:00
if limit := lq.ctx.Limit; limit != nil {
2022-08-30 18:04:50 +00:00
_spec.Limit = *limit
}
2023-01-28 21:03:51 +00:00
if offset := lq.ctx.Offset; offset != nil {
2022-08-30 18:04:50 +00:00
_spec.Offset = *offset
}
if ps := lq.order; len(ps) > 0 {
_spec.Order = func(selector *sql.Selector) {
for i := range ps {
ps[i](selector)
}
}
}
return _spec
}
func (lq *LabelQuery) sqlQuery(ctx context.Context) *sql.Selector {
builder := sql.Dialect(lq.driver.Dialect())
t1 := builder.Table(label.Table)
2023-01-28 21:03:51 +00:00
columns := lq.ctx.Fields
2022-08-30 18:04:50 +00:00
if len(columns) == 0 {
columns = label.Columns
}
selector := builder.Select(t1.Columns(columns...)...).From(t1)
if lq.sql != nil {
selector = lq.sql
selector.Select(selector.Columns(columns...)...)
}
2023-01-28 21:03:51 +00:00
if lq.ctx.Unique != nil && *lq.ctx.Unique {
2022-08-30 18:04:50 +00:00
selector.Distinct()
}
for _, p := range lq.predicates {
p(selector)
}
for _, p := range lq.order {
p(selector)
}
2023-01-28 21:03:51 +00:00
if offset := lq.ctx.Offset; offset != nil {
2022-08-30 18:04:50 +00:00
// limit is mandatory for offset clause. We start
// with default value, and override it below if needed.
selector.Offset(*offset).Limit(math.MaxInt32)
}
2023-01-28 21:03:51 +00:00
if limit := lq.ctx.Limit; limit != nil {
2022-08-30 18:04:50 +00:00
selector.Limit(*limit)
}
return selector
}
// LabelGroupBy is the group-by builder for Label entities.
type LabelGroupBy struct {
selector
build *LabelQuery
2022-08-30 18:04:50 +00:00
}
// Aggregate adds the given aggregation functions to the group-by query.
func (lgb *LabelGroupBy) Aggregate(fns ...AggregateFunc) *LabelGroupBy {
lgb.fns = append(lgb.fns, fns...)
return lgb
}
// Scan applies the selector query and scans the result into the given value.
func (lgb *LabelGroupBy) Scan(ctx context.Context, v any) error {
2023-01-28 21:03:51 +00:00
ctx = setContextOp(ctx, lgb.build.ctx, "GroupBy")
if err := lgb.build.prepareQuery(ctx); err != nil {
2022-08-30 18:04:50 +00:00
return err
}
return scanWithInterceptors[*LabelQuery, *LabelGroupBy](ctx, lgb.build, lgb, lgb.build.inters, v)
2022-08-30 18:04:50 +00:00
}
func (lgb *LabelGroupBy) sqlScan(ctx context.Context, root *LabelQuery, v any) error {
selector := root.sqlQuery(ctx).Select()
aggregation := make([]string, 0, len(lgb.fns))
for _, fn := range lgb.fns {
aggregation = append(aggregation, fn(selector))
}
if len(selector.SelectedColumns()) == 0 {
columns := make([]string, 0, len(*lgb.flds)+len(lgb.fns))
for _, f := range *lgb.flds {
columns = append(columns, selector.C(f))
2022-08-30 18:04:50 +00:00
}
columns = append(columns, aggregation...)
selector.Select(columns...)
2022-08-30 18:04:50 +00:00
}
selector.GroupBy(selector.Columns(*lgb.flds...)...)
2022-08-30 18:04:50 +00:00
if err := selector.Err(); err != nil {
return err
}
rows := &sql.Rows{}
query, args := selector.Query()
if err := lgb.build.driver.Query(ctx, query, args, rows); err != nil {
2022-08-30 18:04:50 +00:00
return err
}
defer rows.Close()
return sql.ScanSlice(rows, v)
}
// LabelSelect is the builder for selecting fields of Label entities.
type LabelSelect struct {
*LabelQuery
selector
}
// Aggregate adds the given aggregation functions to the selector query.
func (ls *LabelSelect) Aggregate(fns ...AggregateFunc) *LabelSelect {
ls.fns = append(ls.fns, fns...)
return ls
}
2022-08-30 18:04:50 +00:00
// Scan applies the selector query and scans the result into the given value.
func (ls *LabelSelect) Scan(ctx context.Context, v any) error {
2023-01-28 21:03:51 +00:00
ctx = setContextOp(ctx, ls.ctx, "Select")
2022-08-30 18:04:50 +00:00
if err := ls.prepareQuery(ctx); err != nil {
return err
}
return scanWithInterceptors[*LabelQuery, *LabelSelect](ctx, ls.LabelQuery, ls, ls.inters, v)
2022-08-30 18:04:50 +00:00
}
func (ls *LabelSelect) sqlScan(ctx context.Context, root *LabelQuery, v any) error {
selector := root.sqlQuery(ctx)
aggregation := make([]string, 0, len(ls.fns))
for _, fn := range ls.fns {
aggregation = append(aggregation, fn(selector))
}
switch n := len(*ls.selector.flds); {
case n == 0 && len(aggregation) > 0:
selector.Select(aggregation...)
case n != 0 && len(aggregation) > 0:
selector.AppendSelect(aggregation...)
}
2022-08-30 18:04:50 +00:00
rows := &sql.Rows{}
query, args := selector.Query()
2022-08-30 18:04:50 +00:00
if err := ls.driver.Query(ctx, query, args, rows); err != nil {
return err
}
defer rows.Close()
return sql.ScanSlice(rows, v)
}