642 lines
17 KiB
Go
642 lines
17 KiB
Go
|
// Code generated by ent, DO NOT EDIT.
|
||
|
|
|
||
|
|
package ent
|
||
|
|
|
||
|
|
import (
|
||
|
|
"context"
|
||
|
|
"database/sql/driver"
|
||
|
|
"fmt"
|
||
|
|
"math"
|
||
|
|
"thesis/ent/key"
|
||
|
|
"thesis/ent/predicate"
|
||
|
|
"thesis/ent/transactions"
|
||
|
|
|
||
|
|
"entgo.io/ent/dialect/sql"
|
||
|
|
"entgo.io/ent/dialect/sql/sqlgraph"
|
||
|
|
"entgo.io/ent/schema/field"
|
||
|
|
)
|
||
|
|
|
||
|
|
// KeyQuery is the builder for querying Key entities.
|
||
|
|
type KeyQuery struct {
|
||
|
|
config
|
||
|
|
ctx *QueryContext
|
||
|
|
order []key.OrderOption
|
||
|
|
inters []Interceptor
|
||
|
|
predicates []predicate.Key
|
||
|
|
withSigned *TransactionsQuery
|
||
|
|
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 KeyQuery builder.
|
||
|
|
func (kq *KeyQuery) Where(ps ...predicate.Key) *KeyQuery {
|
||
|
|
kq.predicates = append(kq.predicates, ps...)
|
||
|
|
return kq
|
||
|
|
}
|
||
|
|
|
||
|
|
// Limit the number of records to be returned by this query.
|
||
|
|
func (kq *KeyQuery) Limit(limit int) *KeyQuery {
|
||
|
|
kq.ctx.Limit = &limit
|
||
|
|
return kq
|
||
|
|
}
|
||
|
|
|
||
|
|
// Offset to start from.
|
||
|
|
func (kq *KeyQuery) Offset(offset int) *KeyQuery {
|
||
|
|
kq.ctx.Offset = &offset
|
||
|
|
return kq
|
||
|
|
}
|
||
|
|
|
||
|
|
// 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 (kq *KeyQuery) Unique(unique bool) *KeyQuery {
|
||
|
|
kq.ctx.Unique = &unique
|
||
|
|
return kq
|
||
|
|
}
|
||
|
|
|
||
|
|
// Order specifies how the records should be ordered.
|
||
|
|
func (kq *KeyQuery) Order(o ...key.OrderOption) *KeyQuery {
|
||
|
|
kq.order = append(kq.order, o...)
|
||
|
|
return kq
|
||
|
|
}
|
||
|
|
|
||
|
|
// QuerySigned chains the current query on the "Signed" edge.
|
||
|
|
func (kq *KeyQuery) QuerySigned() *TransactionsQuery {
|
||
|
|
query := (&TransactionsClient{config: kq.config}).Query()
|
||
|
|
query.path = func(ctx context.Context) (fromU *sql.Selector, err error) {
|
||
|
|
if err := kq.prepareQuery(ctx); err != nil {
|
||
|
|
return nil, err
|
||
|
|
}
|
||
|
|
selector := kq.sqlQuery(ctx)
|
||
|
|
if err := selector.Err(); err != nil {
|
||
|
|
return nil, err
|
||
|
|
}
|
||
|
|
step := sqlgraph.NewStep(
|
||
|
|
sqlgraph.From(key.Table, key.FieldID, selector),
|
||
|
|
sqlgraph.To(transactions.Table, transactions.FieldID),
|
||
|
|
sqlgraph.Edge(sqlgraph.M2M, false, key.SignedTable, key.SignedPrimaryKey...),
|
||
|
|
)
|
||
|
|
fromU = sqlgraph.SetNeighbors(kq.driver.Dialect(), step)
|
||
|
|
return fromU, nil
|
||
|
|
}
|
||
|
|
return query
|
||
|
|
}
|
||
|
|
|
||
|
|
// First returns the first Key entity from the query.
|
||
|
|
// Returns a *NotFoundError when no Key was found.
|
||
|
|
func (kq *KeyQuery) First(ctx context.Context) (*Key, error) {
|
||
|
|
nodes, err := kq.Limit(1).All(setContextOp(ctx, kq.ctx, "First"))
|
||
|
|
if err != nil {
|
||
|
|
return nil, err
|
||
|
|
}
|
||
|
|
if len(nodes) == 0 {
|
||
|
|
return nil, &NotFoundError{key.Label}
|
||
|
|
}
|
||
|
|
return nodes[0], nil
|
||
|
|
}
|
||
|
|
|
||
|
|
// FirstX is like First, but panics if an error occurs.
|
||
|
|
func (kq *KeyQuery) FirstX(ctx context.Context) *Key {
|
||
|
|
node, err := kq.First(ctx)
|
||
|
|
if err != nil && !IsNotFound(err) {
|
||
|
|
panic(err)
|
||
|
|
}
|
||
|
|
return node
|
||
|
|
}
|
||
|
|
|
||
|
|
// FirstID returns the first Key ID from the query.
|
||
|
|
// Returns a *NotFoundError when no Key ID was found.
|
||
|
|
func (kq *KeyQuery) FirstID(ctx context.Context) (id int, err error) {
|
||
|
|
var ids []int
|
||
|
|
if ids, err = kq.Limit(1).IDs(setContextOp(ctx, kq.ctx, "FirstID")); err != nil {
|
||
|
|
return
|
||
|
|
}
|
||
|
|
if len(ids) == 0 {
|
||
|
|
err = &NotFoundError{key.Label}
|
||
|
|
return
|
||
|
|
}
|
||
|
|
return ids[0], nil
|
||
|
|
}
|
||
|
|
|
||
|
|
// FirstIDX is like FirstID, but panics if an error occurs.
|
||
|
|
func (kq *KeyQuery) FirstIDX(ctx context.Context) int {
|
||
|
|
id, err := kq.FirstID(ctx)
|
||
|
|
if err != nil && !IsNotFound(err) {
|
||
|
|
panic(err)
|
||
|
|
}
|
||
|
|
return id
|
||
|
|
}
|
||
|
|
|
||
|
|
// Only returns a single Key entity found by the query, ensuring it only returns one.
|
||
|
|
// Returns a *NotSingularError when more than one Key entity is found.
|
||
|
|
// Returns a *NotFoundError when no Key entities are found.
|
||
|
|
func (kq *KeyQuery) Only(ctx context.Context) (*Key, error) {
|
||
|
|
nodes, err := kq.Limit(2).All(setContextOp(ctx, kq.ctx, "Only"))
|
||
|
|
if err != nil {
|
||
|
|
return nil, err
|
||
|
|
}
|
||
|
|
switch len(nodes) {
|
||
|
|
case 1:
|
||
|
|
return nodes[0], nil
|
||
|
|
case 0:
|
||
|
|
return nil, &NotFoundError{key.Label}
|
||
|
|
default:
|
||
|
|
return nil, &NotSingularError{key.Label}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
// OnlyX is like Only, but panics if an error occurs.
|
||
|
|
func (kq *KeyQuery) OnlyX(ctx context.Context) *Key {
|
||
|
|
node, err := kq.Only(ctx)
|
||
|
|
if err != nil {
|
||
|
|
panic(err)
|
||
|
|
}
|
||
|
|
return node
|
||
|
|
}
|
||
|
|
|
||
|
|
// OnlyID is like Only, but returns the only Key ID in the query.
|
||
|
|
// Returns a *NotSingularError when more than one Key ID is found.
|
||
|
|
// Returns a *NotFoundError when no entities are found.
|
||
|
|
func (kq *KeyQuery) OnlyID(ctx context.Context) (id int, err error) {
|
||
|
|
var ids []int
|
||
|
|
if ids, err = kq.Limit(2).IDs(setContextOp(ctx, kq.ctx, "OnlyID")); err != nil {
|
||
|
|
return
|
||
|
|
}
|
||
|
|
switch len(ids) {
|
||
|
|
case 1:
|
||
|
|
id = ids[0]
|
||
|
|
case 0:
|
||
|
|
err = &NotFoundError{key.Label}
|
||
|
|
default:
|
||
|
|
err = &NotSingularError{key.Label}
|
||
|
|
}
|
||
|
|
return
|
||
|
|
}
|
||
|
|
|
||
|
|
// OnlyIDX is like OnlyID, but panics if an error occurs.
|
||
|
|
func (kq *KeyQuery) OnlyIDX(ctx context.Context) int {
|
||
|
|
id, err := kq.OnlyID(ctx)
|
||
|
|
if err != nil {
|
||
|
|
panic(err)
|
||
|
|
}
|
||
|
|
return id
|
||
|
|
}
|
||
|
|
|
||
|
|
// All executes the query and returns a list of Keys.
|
||
|
|
func (kq *KeyQuery) All(ctx context.Context) ([]*Key, error) {
|
||
|
|
ctx = setContextOp(ctx, kq.ctx, "All")
|
||
|
|
if err := kq.prepareQuery(ctx); err != nil {
|
||
|
|
return nil, err
|
||
|
|
}
|
||
|
|
qr := querierAll[[]*Key, *KeyQuery]()
|
||
|
|
return withInterceptors[[]*Key](ctx, kq, qr, kq.inters)
|
||
|
|
}
|
||
|
|
|
||
|
|
// AllX is like All, but panics if an error occurs.
|
||
|
|
func (kq *KeyQuery) AllX(ctx context.Context) []*Key {
|
||
|
|
nodes, err := kq.All(ctx)
|
||
|
|
if err != nil {
|
||
|
|
panic(err)
|
||
|
|
}
|
||
|
|
return nodes
|
||
|
|
}
|
||
|
|
|
||
|
|
// IDs executes the query and returns a list of Key IDs.
|
||
|
|
func (kq *KeyQuery) IDs(ctx context.Context) (ids []int, err error) {
|
||
|
|
if kq.ctx.Unique == nil && kq.path != nil {
|
||
|
|
kq.Unique(true)
|
||
|
|
}
|
||
|
|
ctx = setContextOp(ctx, kq.ctx, "IDs")
|
||
|
|
if err = kq.Select(key.FieldID).Scan(ctx, &ids); err != nil {
|
||
|
|
return nil, err
|
||
|
|
}
|
||
|
|
return ids, nil
|
||
|
|
}
|
||
|
|
|
||
|
|
// IDsX is like IDs, but panics if an error occurs.
|
||
|
|
func (kq *KeyQuery) IDsX(ctx context.Context) []int {
|
||
|
|
ids, err := kq.IDs(ctx)
|
||
|
|
if err != nil {
|
||
|
|
panic(err)
|
||
|
|
}
|
||
|
|
return ids
|
||
|
|
}
|
||
|
|
|
||
|
|
// Count returns the count of the given query.
|
||
|
|
func (kq *KeyQuery) Count(ctx context.Context) (int, error) {
|
||
|
|
ctx = setContextOp(ctx, kq.ctx, "Count")
|
||
|
|
if err := kq.prepareQuery(ctx); err != nil {
|
||
|
|
return 0, err
|
||
|
|
}
|
||
|
|
return withInterceptors[int](ctx, kq, querierCount[*KeyQuery](), kq.inters)
|
||
|
|
}
|
||
|
|
|
||
|
|
// CountX is like Count, but panics if an error occurs.
|
||
|
|
func (kq *KeyQuery) CountX(ctx context.Context) int {
|
||
|
|
count, err := kq.Count(ctx)
|
||
|
|
if err != nil {
|
||
|
|
panic(err)
|
||
|
|
}
|
||
|
|
return count
|
||
|
|
}
|
||
|
|
|
||
|
|
// Exist returns true if the query has elements in the graph.
|
||
|
|
func (kq *KeyQuery) Exist(ctx context.Context) (bool, error) {
|
||
|
|
ctx = setContextOp(ctx, kq.ctx, "Exist")
|
||
|
|
switch _, err := kq.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 (kq *KeyQuery) ExistX(ctx context.Context) bool {
|
||
|
|
exist, err := kq.Exist(ctx)
|
||
|
|
if err != nil {
|
||
|
|
panic(err)
|
||
|
|
}
|
||
|
|
return exist
|
||
|
|
}
|
||
|
|
|
||
|
|
// Clone returns a duplicate of the KeyQuery builder, including all associated steps. It can be
|
||
|
|
// used to prepare common query builders and use them differently after the clone is made.
|
||
|
|
func (kq *KeyQuery) Clone() *KeyQuery {
|
||
|
|
if kq == nil {
|
||
|
|
return nil
|
||
|
|
}
|
||
|
|
return &KeyQuery{
|
||
|
|
config: kq.config,
|
||
|
|
ctx: kq.ctx.Clone(),
|
||
|
|
order: append([]key.OrderOption{}, kq.order...),
|
||
|
|
inters: append([]Interceptor{}, kq.inters...),
|
||
|
|
predicates: append([]predicate.Key{}, kq.predicates...),
|
||
|
|
withSigned: kq.withSigned.Clone(),
|
||
|
|
// clone intermediate query.
|
||
|
|
sql: kq.sql.Clone(),
|
||
|
|
path: kq.path,
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
// WithSigned tells the query-builder to eager-load the nodes that are connected to
|
||
|
|
// the "Signed" edge. The optional arguments are used to configure the query builder of the edge.
|
||
|
|
func (kq *KeyQuery) WithSigned(opts ...func(*TransactionsQuery)) *KeyQuery {
|
||
|
|
query := (&TransactionsClient{config: kq.config}).Query()
|
||
|
|
for _, opt := range opts {
|
||
|
|
opt(query)
|
||
|
|
}
|
||
|
|
kq.withSigned = query
|
||
|
|
return kq
|
||
|
|
}
|
||
|
|
|
||
|
|
// 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 {
|
||
|
|
// PublicKey string `json:"publicKey,omitempty"`
|
||
|
|
// Count int `json:"count,omitempty"`
|
||
|
|
// }
|
||
|
|
//
|
||
|
|
// client.Key.Query().
|
||
|
|
// GroupBy(key.FieldPublicKey).
|
||
|
|
// Aggregate(ent.Count()).
|
||
|
|
// Scan(ctx, &v)
|
||
|
|
func (kq *KeyQuery) GroupBy(field string, fields ...string) *KeyGroupBy {
|
||
|
|
kq.ctx.Fields = append([]string{field}, fields...)
|
||
|
|
grbuild := &KeyGroupBy{build: kq}
|
||
|
|
grbuild.flds = &kq.ctx.Fields
|
||
|
|
grbuild.label = key.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 {
|
||
|
|
// PublicKey string `json:"publicKey,omitempty"`
|
||
|
|
// }
|
||
|
|
//
|
||
|
|
// client.Key.Query().
|
||
|
|
// Select(key.FieldPublicKey).
|
||
|
|
// Scan(ctx, &v)
|
||
|
|
func (kq *KeyQuery) Select(fields ...string) *KeySelect {
|
||
|
|
kq.ctx.Fields = append(kq.ctx.Fields, fields...)
|
||
|
|
sbuild := &KeySelect{KeyQuery: kq}
|
||
|
|
sbuild.label = key.Label
|
||
|
|
sbuild.flds, sbuild.scan = &kq.ctx.Fields, sbuild.Scan
|
||
|
|
return sbuild
|
||
|
|
}
|
||
|
|
|
||
|
|
// Aggregate returns a KeySelect configured with the given aggregations.
|
||
|
|
func (kq *KeyQuery) Aggregate(fns ...AggregateFunc) *KeySelect {
|
||
|
|
return kq.Select().Aggregate(fns...)
|
||
|
|
}
|
||
|
|
|
||
|
|
func (kq *KeyQuery) prepareQuery(ctx context.Context) error {
|
||
|
|
for _, inter := range kq.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, kq); err != nil {
|
||
|
|
return err
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
for _, f := range kq.ctx.Fields {
|
||
|
|
if !key.ValidColumn(f) {
|
||
|
|
return &ValidationError{Name: f, err: fmt.Errorf("ent: invalid field %q for query", f)}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if kq.path != nil {
|
||
|
|
prev, err := kq.path(ctx)
|
||
|
|
if err != nil {
|
||
|
|
return err
|
||
|
|
}
|
||
|
|
kq.sql = prev
|
||
|
|
}
|
||
|
|
return nil
|
||
|
|
}
|
||
|
|
|
||
|
|
func (kq *KeyQuery) sqlAll(ctx context.Context, hooks ...queryHook) ([]*Key, error) {
|
||
|
|
var (
|
||
|
|
nodes = []*Key{}
|
||
|
|
withFKs = kq.withFKs
|
||
|
|
_spec = kq.querySpec()
|
||
|
|
loadedTypes = [1]bool{
|
||
|
|
kq.withSigned != nil,
|
||
|
|
}
|
||
|
|
)
|
||
|
|
if withFKs {
|
||
|
|
_spec.Node.Columns = append(_spec.Node.Columns, key.ForeignKeys...)
|
||
|
|
}
|
||
|
|
_spec.ScanValues = func(columns []string) ([]any, error) {
|
||
|
|
return (*Key).scanValues(nil, columns)
|
||
|
|
}
|
||
|
|
_spec.Assign = func(columns []string, values []any) error {
|
||
|
|
node := &Key{config: kq.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, kq.driver, _spec); err != nil {
|
||
|
|
return nil, err
|
||
|
|
}
|
||
|
|
if len(nodes) == 0 {
|
||
|
|
return nodes, nil
|
||
|
|
}
|
||
|
|
if query := kq.withSigned; query != nil {
|
||
|
|
if err := kq.loadSigned(ctx, query, nodes,
|
||
|
|
func(n *Key) { n.Edges.Signed = []*Transactions{} },
|
||
|
|
func(n *Key, e *Transactions) { n.Edges.Signed = append(n.Edges.Signed, e) }); err != nil {
|
||
|
|
return nil, err
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return nodes, nil
|
||
|
|
}
|
||
|
|
|
||
|
|
func (kq *KeyQuery) loadSigned(ctx context.Context, query *TransactionsQuery, nodes []*Key, init func(*Key), assign func(*Key, *Transactions)) error {
|
||
|
|
edgeIDs := make([]driver.Value, len(nodes))
|
||
|
|
byID := make(map[int]*Key)
|
||
|
|
nids := make(map[int]map[*Key]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(key.SignedTable)
|
||
|
|
s.Join(joinT).On(s.C(transactions.FieldID), joinT.C(key.SignedPrimaryKey[1]))
|
||
|
|
s.Where(sql.InValues(joinT.C(key.SignedPrimaryKey[0]), edgeIDs...))
|
||
|
|
columns := s.SelectedColumns()
|
||
|
|
s.Select(joinT.C(key.SignedPrimaryKey[0]))
|
||
|
|
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 := int(values[0].(*sql.NullInt64).Int64)
|
||
|
|
inValue := int(values[1].(*sql.NullInt64).Int64)
|
||
|
|
if nids[inValue] == nil {
|
||
|
|
nids[inValue] = map[*Key]struct{}{byID[outValue]: {}}
|
||
|
|
return assign(columns[1:], values[1:])
|
||
|
|
}
|
||
|
|
nids[inValue][byID[outValue]] = struct{}{}
|
||
|
|
return nil
|
||
|
|
}
|
||
|
|
})
|
||
|
|
})
|
||
|
|
neighbors, err := withInterceptors[[]*Transactions](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 "Signed" node returned %v`, n.ID)
|
||
|
|
}
|
||
|
|
for kn := range nodes {
|
||
|
|
assign(kn, n)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return nil
|
||
|
|
}
|
||
|
|
|
||
|
|
func (kq *KeyQuery) sqlCount(ctx context.Context) (int, error) {
|
||
|
|
_spec := kq.querySpec()
|
||
|
|
_spec.Node.Columns = kq.ctx.Fields
|
||
|
|
if len(kq.ctx.Fields) > 0 {
|
||
|
|
_spec.Unique = kq.ctx.Unique != nil && *kq.ctx.Unique
|
||
|
|
}
|
||
|
|
return sqlgraph.CountNodes(ctx, kq.driver, _spec)
|
||
|
|
}
|
||
|
|
|
||
|
|
func (kq *KeyQuery) querySpec() *sqlgraph.QuerySpec {
|
||
|
|
_spec := sqlgraph.NewQuerySpec(key.Table, key.Columns, sqlgraph.NewFieldSpec(key.FieldID, field.TypeInt))
|
||
|
|
_spec.From = kq.sql
|
||
|
|
if unique := kq.ctx.Unique; unique != nil {
|
||
|
|
_spec.Unique = *unique
|
||
|
|
} else if kq.path != nil {
|
||
|
|
_spec.Unique = true
|
||
|
|
}
|
||
|
|
if fields := kq.ctx.Fields; len(fields) > 0 {
|
||
|
|
_spec.Node.Columns = make([]string, 0, len(fields))
|
||
|
|
_spec.Node.Columns = append(_spec.Node.Columns, key.FieldID)
|
||
|
|
for i := range fields {
|
||
|
|
if fields[i] != key.FieldID {
|
||
|
|
_spec.Node.Columns = append(_spec.Node.Columns, fields[i])
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if ps := kq.predicates; len(ps) > 0 {
|
||
|
|
_spec.Predicate = func(selector *sql.Selector) {
|
||
|
|
for i := range ps {
|
||
|
|
ps[i](selector)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if limit := kq.ctx.Limit; limit != nil {
|
||
|
|
_spec.Limit = *limit
|
||
|
|
}
|
||
|
|
if offset := kq.ctx.Offset; offset != nil {
|
||
|
|
_spec.Offset = *offset
|
||
|
|
}
|
||
|
|
if ps := kq.order; len(ps) > 0 {
|
||
|
|
_spec.Order = func(selector *sql.Selector) {
|
||
|
|
for i := range ps {
|
||
|
|
ps[i](selector)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return _spec
|
||
|
|
}
|
||
|
|
|
||
|
|
func (kq *KeyQuery) sqlQuery(ctx context.Context) *sql.Selector {
|
||
|
|
builder := sql.Dialect(kq.driver.Dialect())
|
||
|
|
t1 := builder.Table(key.Table)
|
||
|
|
columns := kq.ctx.Fields
|
||
|
|
if len(columns) == 0 {
|
||
|
|
columns = key.Columns
|
||
|
|
}
|
||
|
|
selector := builder.Select(t1.Columns(columns...)...).From(t1)
|
||
|
|
if kq.sql != nil {
|
||
|
|
selector = kq.sql
|
||
|
|
selector.Select(selector.Columns(columns...)...)
|
||
|
|
}
|
||
|
|
if kq.ctx.Unique != nil && *kq.ctx.Unique {
|
||
|
|
selector.Distinct()
|
||
|
|
}
|
||
|
|
for _, p := range kq.predicates {
|
||
|
|
p(selector)
|
||
|
|
}
|
||
|
|
for _, p := range kq.order {
|
||
|
|
p(selector)
|
||
|
|
}
|
||
|
|
if offset := kq.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 := kq.ctx.Limit; limit != nil {
|
||
|
|
selector.Limit(*limit)
|
||
|
|
}
|
||
|
|
return selector
|
||
|
|
}
|
||
|
|
|
||
|
|
// KeyGroupBy is the group-by builder for Key entities.
|
||
|
|
type KeyGroupBy struct {
|
||
|
|
selector
|
||
|
|
build *KeyQuery
|
||
|
|
}
|
||
|
|
|
||
|
|
// Aggregate adds the given aggregation functions to the group-by query.
|
||
|
|
func (kgb *KeyGroupBy) Aggregate(fns ...AggregateFunc) *KeyGroupBy {
|
||
|
|
kgb.fns = append(kgb.fns, fns...)
|
||
|
|
return kgb
|
||
|
|
}
|
||
|
|
|
||
|
|
// Scan applies the selector query and scans the result into the given value.
|
||
|
|
func (kgb *KeyGroupBy) Scan(ctx context.Context, v any) error {
|
||
|
|
ctx = setContextOp(ctx, kgb.build.ctx, "GroupBy")
|
||
|
|
if err := kgb.build.prepareQuery(ctx); err != nil {
|
||
|
|
return err
|
||
|
|
}
|
||
|
|
return scanWithInterceptors[*KeyQuery, *KeyGroupBy](ctx, kgb.build, kgb, kgb.build.inters, v)
|
||
|
|
}
|
||
|
|
|
||
|
|
func (kgb *KeyGroupBy) sqlScan(ctx context.Context, root *KeyQuery, v any) error {
|
||
|
|
selector := root.sqlQuery(ctx).Select()
|
||
|
|
aggregation := make([]string, 0, len(kgb.fns))
|
||
|
|
for _, fn := range kgb.fns {
|
||
|
|
aggregation = append(aggregation, fn(selector))
|
||
|
|
}
|
||
|
|
if len(selector.SelectedColumns()) == 0 {
|
||
|
|
columns := make([]string, 0, len(*kgb.flds)+len(kgb.fns))
|
||
|
|
for _, f := range *kgb.flds {
|
||
|
|
columns = append(columns, selector.C(f))
|
||
|
|
}
|
||
|
|
columns = append(columns, aggregation...)
|
||
|
|
selector.Select(columns...)
|
||
|
|
}
|
||
|
|
selector.GroupBy(selector.Columns(*kgb.flds...)...)
|
||
|
|
if err := selector.Err(); err != nil {
|
||
|
|
return err
|
||
|
|
}
|
||
|
|
rows := &sql.Rows{}
|
||
|
|
query, args := selector.Query()
|
||
|
|
if err := kgb.build.driver.Query(ctx, query, args, rows); err != nil {
|
||
|
|
return err
|
||
|
|
}
|
||
|
|
defer rows.Close()
|
||
|
|
return sql.ScanSlice(rows, v)
|
||
|
|
}
|
||
|
|
|
||
|
|
// KeySelect is the builder for selecting fields of Key entities.
|
||
|
|
type KeySelect struct {
|
||
|
|
*KeyQuery
|
||
|
|
selector
|
||
|
|
}
|
||
|
|
|
||
|
|
// Aggregate adds the given aggregation functions to the selector query.
|
||
|
|
func (ks *KeySelect) Aggregate(fns ...AggregateFunc) *KeySelect {
|
||
|
|
ks.fns = append(ks.fns, fns...)
|
||
|
|
return ks
|
||
|
|
}
|
||
|
|
|
||
|
|
// Scan applies the selector query and scans the result into the given value.
|
||
|
|
func (ks *KeySelect) Scan(ctx context.Context, v any) error {
|
||
|
|
ctx = setContextOp(ctx, ks.ctx, "Select")
|
||
|
|
if err := ks.prepareQuery(ctx); err != nil {
|
||
|
|
return err
|
||
|
|
}
|
||
|
|
return scanWithInterceptors[*KeyQuery, *KeySelect](ctx, ks.KeyQuery, ks, ks.inters, v)
|
||
|
|
}
|
||
|
|
|
||
|
|
func (ks *KeySelect) sqlScan(ctx context.Context, root *KeyQuery, v any) error {
|
||
|
|
selector := root.sqlQuery(ctx)
|
||
|
|
aggregation := make([]string, 0, len(ks.fns))
|
||
|
|
for _, fn := range ks.fns {
|
||
|
|
aggregation = append(aggregation, fn(selector))
|
||
|
|
}
|
||
|
|
switch n := len(*ks.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 := ks.driver.Query(ctx, query, args, rows); err != nil {
|
||
|
|
return err
|
||
|
|
}
|
||
|
|
defer rows.Close()
|
||
|
|
return sql.ScanSlice(rows, v)
|
||
|
|
}
|