mirror of
https://github.com/sysadminsmedia/homebox.git
synced 2025-12-25 23:03:41 +01:00
* ent re-generation
* add oidc integration
* document oidc integration
* go fmt
* address backend linter findings
* run prettier on index.vue
* State cookie domain can mismatch when Hostname override is used (breaks CSRF check). Add SameSite.
Co-authored-by: coderabbitai[bot] <136622811+coderabbitai[bot]@users.noreply.github.com>
* Delete state cookie with matching domain and MaxAge; add SameSite.
Co-authored-by: coderabbitai[bot] <136622811+coderabbitai[bot]@users.noreply.github.com>
* Fix endpoint path in comments and error to include /api/v1.
Co-authored-by: coderabbitai[bot] <136622811+coderabbitai[bot]@users.noreply.github.com>
* Also use request context when verifying the ID token.
* Do not return raw auth errors to clients (user-enumeration risk).
* consistently set cookie the same way across function
* remove baseURL after declaration
* only enable OIDC routes if OIDC is enabled
* swagger doc for failure
* Only block when provider=local; move the check after parsing provider
* fix extended session comment
* reduce pii logging
* futher reduce pii logging
* remove unused DiscoveryDocument
* remove unused offline_access from default oidc scopes
* remove offline access from AuthCodeURL
* support host from X-Forwarded-Host
* set sane default claim names if unset
* error strings should not be capitalized
* Revert "run prettier on index.vue"
This reverts commit aa22330a23.
* Add timeout to provider discovery
* Split scopes robustly
* refactor hostname calculation
* address frontend prettier findings
* add property oidc on type APISummary
* LoginOIDC: Normalize inputs, only create if not found
* add oidc email verification
* oidc handleCallback: clear state cookie before each return
* add support for oidc nonce parameter
* Harden first-login race: handle concurrent creates gracefully and fix log key.
Co-authored-by: coderabbitai[bot] <136622811+coderabbitai[bot]@users.noreply.github.com>
* support email verified claim as bool or string
* fail fast on empty email
* PKCE verifier
* fix: add timing delay to attachment test to resolve CI race condition
The attachment test was failing intermittently in CI due to a race condition
between attachment creation and retrieval. Adding a small 100ms delay after
attachment creation ensures the file system and database operations complete
before the test attempts to verify the attachment exists.
* Revert "fix: add timing delay to attachment test to resolve CI race condition"
This reverts commit 4aa8b2a0d829753e8d2dd1ba76f4b1e04e28c45e.
* oidc error state, use ref
* rename oidc.force to oidc.authRedirect
* remove hardcoded oidc error timeout
* feat: sub/iss based identity matching and userinfo endpoint collection
---------
Co-authored-by: coderabbitai[bot] <136622811+coderabbitai[bot]@users.noreply.github.com>
Co-authored-by: Matthew Kilgore <matthew@kilgore.dev>
1169 lines
34 KiB
Go
Generated
1169 lines
34 KiB
Go
Generated
// 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"
|
|
"github.com/google/uuid"
|
|
"github.com/sysadminsmedia/homebox/backend/internal/data/ent/attachment"
|
|
"github.com/sysadminsmedia/homebox/backend/internal/data/ent/group"
|
|
"github.com/sysadminsmedia/homebox/backend/internal/data/ent/item"
|
|
"github.com/sysadminsmedia/homebox/backend/internal/data/ent/itemfield"
|
|
"github.com/sysadminsmedia/homebox/backend/internal/data/ent/label"
|
|
"github.com/sysadminsmedia/homebox/backend/internal/data/ent/location"
|
|
"github.com/sysadminsmedia/homebox/backend/internal/data/ent/maintenanceentry"
|
|
"github.com/sysadminsmedia/homebox/backend/internal/data/ent/predicate"
|
|
)
|
|
|
|
// ItemQuery is the builder for querying Item entities.
|
|
type ItemQuery struct {
|
|
config
|
|
ctx *QueryContext
|
|
order []item.OrderOption
|
|
inters []Interceptor
|
|
predicates []predicate.Item
|
|
withGroup *GroupQuery
|
|
withParent *ItemQuery
|
|
withChildren *ItemQuery
|
|
withLabel *LabelQuery
|
|
withLocation *LocationQuery
|
|
withFields *ItemFieldQuery
|
|
withMaintenanceEntries *MaintenanceEntryQuery
|
|
withAttachments *AttachmentQuery
|
|
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 ItemQuery builder.
|
|
func (_q *ItemQuery) Where(ps ...predicate.Item) *ItemQuery {
|
|
_q.predicates = append(_q.predicates, ps...)
|
|
return _q
|
|
}
|
|
|
|
// Limit the number of records to be returned by this query.
|
|
func (_q *ItemQuery) Limit(limit int) *ItemQuery {
|
|
_q.ctx.Limit = &limit
|
|
return _q
|
|
}
|
|
|
|
// Offset to start from.
|
|
func (_q *ItemQuery) Offset(offset int) *ItemQuery {
|
|
_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 *ItemQuery) Unique(unique bool) *ItemQuery {
|
|
_q.ctx.Unique = &unique
|
|
return _q
|
|
}
|
|
|
|
// Order specifies how the records should be ordered.
|
|
func (_q *ItemQuery) Order(o ...item.OrderOption) *ItemQuery {
|
|
_q.order = append(_q.order, o...)
|
|
return _q
|
|
}
|
|
|
|
// QueryGroup chains the current query on the "group" edge.
|
|
func (_q *ItemQuery) QueryGroup() *GroupQuery {
|
|
query := (&GroupClient{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(item.Table, item.FieldID, selector),
|
|
sqlgraph.To(group.Table, group.FieldID),
|
|
sqlgraph.Edge(sqlgraph.M2O, true, item.GroupTable, item.GroupColumn),
|
|
)
|
|
fromU = sqlgraph.SetNeighbors(_q.driver.Dialect(), step)
|
|
return fromU, nil
|
|
}
|
|
return query
|
|
}
|
|
|
|
// QueryParent chains the current query on the "parent" edge.
|
|
func (_q *ItemQuery) QueryParent() *ItemQuery {
|
|
query := (&ItemClient{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(item.Table, item.FieldID, selector),
|
|
sqlgraph.To(item.Table, item.FieldID),
|
|
sqlgraph.Edge(sqlgraph.M2O, true, item.ParentTable, item.ParentColumn),
|
|
)
|
|
fromU = sqlgraph.SetNeighbors(_q.driver.Dialect(), step)
|
|
return fromU, nil
|
|
}
|
|
return query
|
|
}
|
|
|
|
// QueryChildren chains the current query on the "children" edge.
|
|
func (_q *ItemQuery) QueryChildren() *ItemQuery {
|
|
query := (&ItemClient{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(item.Table, item.FieldID, selector),
|
|
sqlgraph.To(item.Table, item.FieldID),
|
|
sqlgraph.Edge(sqlgraph.O2M, false, item.ChildrenTable, item.ChildrenColumn),
|
|
)
|
|
fromU = sqlgraph.SetNeighbors(_q.driver.Dialect(), step)
|
|
return fromU, nil
|
|
}
|
|
return query
|
|
}
|
|
|
|
// QueryLabel chains the current query on the "label" edge.
|
|
func (_q *ItemQuery) QueryLabel() *LabelQuery {
|
|
query := (&LabelClient{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(item.Table, item.FieldID, selector),
|
|
sqlgraph.To(label.Table, label.FieldID),
|
|
sqlgraph.Edge(sqlgraph.M2M, true, item.LabelTable, item.LabelPrimaryKey...),
|
|
)
|
|
fromU = sqlgraph.SetNeighbors(_q.driver.Dialect(), step)
|
|
return fromU, nil
|
|
}
|
|
return query
|
|
}
|
|
|
|
// QueryLocation chains the current query on the "location" edge.
|
|
func (_q *ItemQuery) QueryLocation() *LocationQuery {
|
|
query := (&LocationClient{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(item.Table, item.FieldID, selector),
|
|
sqlgraph.To(location.Table, location.FieldID),
|
|
sqlgraph.Edge(sqlgraph.M2O, true, item.LocationTable, item.LocationColumn),
|
|
)
|
|
fromU = sqlgraph.SetNeighbors(_q.driver.Dialect(), step)
|
|
return fromU, nil
|
|
}
|
|
return query
|
|
}
|
|
|
|
// QueryFields chains the current query on the "fields" edge.
|
|
func (_q *ItemQuery) QueryFields() *ItemFieldQuery {
|
|
query := (&ItemFieldClient{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(item.Table, item.FieldID, selector),
|
|
sqlgraph.To(itemfield.Table, itemfield.FieldID),
|
|
sqlgraph.Edge(sqlgraph.O2M, false, item.FieldsTable, item.FieldsColumn),
|
|
)
|
|
fromU = sqlgraph.SetNeighbors(_q.driver.Dialect(), step)
|
|
return fromU, nil
|
|
}
|
|
return query
|
|
}
|
|
|
|
// QueryMaintenanceEntries chains the current query on the "maintenance_entries" edge.
|
|
func (_q *ItemQuery) QueryMaintenanceEntries() *MaintenanceEntryQuery {
|
|
query := (&MaintenanceEntryClient{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(item.Table, item.FieldID, selector),
|
|
sqlgraph.To(maintenanceentry.Table, maintenanceentry.FieldID),
|
|
sqlgraph.Edge(sqlgraph.O2M, false, item.MaintenanceEntriesTable, item.MaintenanceEntriesColumn),
|
|
)
|
|
fromU = sqlgraph.SetNeighbors(_q.driver.Dialect(), step)
|
|
return fromU, nil
|
|
}
|
|
return query
|
|
}
|
|
|
|
// QueryAttachments chains the current query on the "attachments" edge.
|
|
func (_q *ItemQuery) QueryAttachments() *AttachmentQuery {
|
|
query := (&AttachmentClient{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(item.Table, item.FieldID, selector),
|
|
sqlgraph.To(attachment.Table, attachment.FieldID),
|
|
sqlgraph.Edge(sqlgraph.O2M, false, item.AttachmentsTable, item.AttachmentsColumn),
|
|
)
|
|
fromU = sqlgraph.SetNeighbors(_q.driver.Dialect(), step)
|
|
return fromU, nil
|
|
}
|
|
return query
|
|
}
|
|
|
|
// First returns the first Item entity from the query.
|
|
// Returns a *NotFoundError when no Item was found.
|
|
func (_q *ItemQuery) First(ctx context.Context) (*Item, 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{item.Label}
|
|
}
|
|
return nodes[0], nil
|
|
}
|
|
|
|
// FirstX is like First, but panics if an error occurs.
|
|
func (_q *ItemQuery) FirstX(ctx context.Context) *Item {
|
|
node, err := _q.First(ctx)
|
|
if err != nil && !IsNotFound(err) {
|
|
panic(err)
|
|
}
|
|
return node
|
|
}
|
|
|
|
// FirstID returns the first Item ID from the query.
|
|
// Returns a *NotFoundError when no Item ID was found.
|
|
func (_q *ItemQuery) FirstID(ctx context.Context) (id uuid.UUID, err error) {
|
|
var ids []uuid.UUID
|
|
if ids, err = _q.Limit(1).IDs(setContextOp(ctx, _q.ctx, ent.OpQueryFirstID)); err != nil {
|
|
return
|
|
}
|
|
if len(ids) == 0 {
|
|
err = &NotFoundError{item.Label}
|
|
return
|
|
}
|
|
return ids[0], nil
|
|
}
|
|
|
|
// FirstIDX is like FirstID, but panics if an error occurs.
|
|
func (_q *ItemQuery) FirstIDX(ctx context.Context) uuid.UUID {
|
|
id, err := _q.FirstID(ctx)
|
|
if err != nil && !IsNotFound(err) {
|
|
panic(err)
|
|
}
|
|
return id
|
|
}
|
|
|
|
// Only returns a single Item entity found by the query, ensuring it only returns one.
|
|
// Returns a *NotSingularError when more than one Item entity is found.
|
|
// Returns a *NotFoundError when no Item entities are found.
|
|
func (_q *ItemQuery) Only(ctx context.Context) (*Item, 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{item.Label}
|
|
default:
|
|
return nil, &NotSingularError{item.Label}
|
|
}
|
|
}
|
|
|
|
// OnlyX is like Only, but panics if an error occurs.
|
|
func (_q *ItemQuery) OnlyX(ctx context.Context) *Item {
|
|
node, err := _q.Only(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return node
|
|
}
|
|
|
|
// OnlyID is like Only, but returns the only Item ID in the query.
|
|
// Returns a *NotSingularError when more than one Item ID is found.
|
|
// Returns a *NotFoundError when no entities are found.
|
|
func (_q *ItemQuery) OnlyID(ctx context.Context) (id uuid.UUID, err error) {
|
|
var ids []uuid.UUID
|
|
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{item.Label}
|
|
default:
|
|
err = &NotSingularError{item.Label}
|
|
}
|
|
return
|
|
}
|
|
|
|
// OnlyIDX is like OnlyID, but panics if an error occurs.
|
|
func (_q *ItemQuery) OnlyIDX(ctx context.Context) uuid.UUID {
|
|
id, err := _q.OnlyID(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return id
|
|
}
|
|
|
|
// All executes the query and returns a list of Items.
|
|
func (_q *ItemQuery) All(ctx context.Context) ([]*Item, error) {
|
|
ctx = setContextOp(ctx, _q.ctx, ent.OpQueryAll)
|
|
if err := _q.prepareQuery(ctx); err != nil {
|
|
return nil, err
|
|
}
|
|
qr := querierAll[[]*Item, *ItemQuery]()
|
|
return withInterceptors[[]*Item](ctx, _q, qr, _q.inters)
|
|
}
|
|
|
|
// AllX is like All, but panics if an error occurs.
|
|
func (_q *ItemQuery) AllX(ctx context.Context) []*Item {
|
|
nodes, err := _q.All(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return nodes
|
|
}
|
|
|
|
// IDs executes the query and returns a list of Item IDs.
|
|
func (_q *ItemQuery) IDs(ctx context.Context) (ids []uuid.UUID, err error) {
|
|
if _q.ctx.Unique == nil && _q.path != nil {
|
|
_q.Unique(true)
|
|
}
|
|
ctx = setContextOp(ctx, _q.ctx, ent.OpQueryIDs)
|
|
if err = _q.Select(item.FieldID).Scan(ctx, &ids); err != nil {
|
|
return nil, err
|
|
}
|
|
return ids, nil
|
|
}
|
|
|
|
// IDsX is like IDs, but panics if an error occurs.
|
|
func (_q *ItemQuery) IDsX(ctx context.Context) []uuid.UUID {
|
|
ids, err := _q.IDs(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return ids
|
|
}
|
|
|
|
// Count returns the count of the given query.
|
|
func (_q *ItemQuery) 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[*ItemQuery](), _q.inters)
|
|
}
|
|
|
|
// CountX is like Count, but panics if an error occurs.
|
|
func (_q *ItemQuery) 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 *ItemQuery) 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 *ItemQuery) ExistX(ctx context.Context) bool {
|
|
exist, err := _q.Exist(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return exist
|
|
}
|
|
|
|
// Clone returns a duplicate of the ItemQuery 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 *ItemQuery) Clone() *ItemQuery {
|
|
if _q == nil {
|
|
return nil
|
|
}
|
|
return &ItemQuery{
|
|
config: _q.config,
|
|
ctx: _q.ctx.Clone(),
|
|
order: append([]item.OrderOption{}, _q.order...),
|
|
inters: append([]Interceptor{}, _q.inters...),
|
|
predicates: append([]predicate.Item{}, _q.predicates...),
|
|
withGroup: _q.withGroup.Clone(),
|
|
withParent: _q.withParent.Clone(),
|
|
withChildren: _q.withChildren.Clone(),
|
|
withLabel: _q.withLabel.Clone(),
|
|
withLocation: _q.withLocation.Clone(),
|
|
withFields: _q.withFields.Clone(),
|
|
withMaintenanceEntries: _q.withMaintenanceEntries.Clone(),
|
|
withAttachments: _q.withAttachments.Clone(),
|
|
// clone intermediate query.
|
|
sql: _q.sql.Clone(),
|
|
path: _q.path,
|
|
}
|
|
}
|
|
|
|
// 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 (_q *ItemQuery) WithGroup(opts ...func(*GroupQuery)) *ItemQuery {
|
|
query := (&GroupClient{config: _q.config}).Query()
|
|
for _, opt := range opts {
|
|
opt(query)
|
|
}
|
|
_q.withGroup = query
|
|
return _q
|
|
}
|
|
|
|
// WithParent tells the query-builder to eager-load the nodes that are connected to
|
|
// the "parent" edge. The optional arguments are used to configure the query builder of the edge.
|
|
func (_q *ItemQuery) WithParent(opts ...func(*ItemQuery)) *ItemQuery {
|
|
query := (&ItemClient{config: _q.config}).Query()
|
|
for _, opt := range opts {
|
|
opt(query)
|
|
}
|
|
_q.withParent = query
|
|
return _q
|
|
}
|
|
|
|
// WithChildren tells the query-builder to eager-load the nodes that are connected to
|
|
// the "children" edge. The optional arguments are used to configure the query builder of the edge.
|
|
func (_q *ItemQuery) WithChildren(opts ...func(*ItemQuery)) *ItemQuery {
|
|
query := (&ItemClient{config: _q.config}).Query()
|
|
for _, opt := range opts {
|
|
opt(query)
|
|
}
|
|
_q.withChildren = query
|
|
return _q
|
|
}
|
|
|
|
// WithLabel tells the query-builder to eager-load the nodes that are connected to
|
|
// the "label" edge. The optional arguments are used to configure the query builder of the edge.
|
|
func (_q *ItemQuery) WithLabel(opts ...func(*LabelQuery)) *ItemQuery {
|
|
query := (&LabelClient{config: _q.config}).Query()
|
|
for _, opt := range opts {
|
|
opt(query)
|
|
}
|
|
_q.withLabel = query
|
|
return _q
|
|
}
|
|
|
|
// WithLocation tells the query-builder to eager-load the nodes that are connected to
|
|
// the "location" edge. The optional arguments are used to configure the query builder of the edge.
|
|
func (_q *ItemQuery) WithLocation(opts ...func(*LocationQuery)) *ItemQuery {
|
|
query := (&LocationClient{config: _q.config}).Query()
|
|
for _, opt := range opts {
|
|
opt(query)
|
|
}
|
|
_q.withLocation = query
|
|
return _q
|
|
}
|
|
|
|
// WithFields tells the query-builder to eager-load the nodes that are connected to
|
|
// the "fields" edge. The optional arguments are used to configure the query builder of the edge.
|
|
func (_q *ItemQuery) WithFields(opts ...func(*ItemFieldQuery)) *ItemQuery {
|
|
query := (&ItemFieldClient{config: _q.config}).Query()
|
|
for _, opt := range opts {
|
|
opt(query)
|
|
}
|
|
_q.withFields = query
|
|
return _q
|
|
}
|
|
|
|
// WithMaintenanceEntries tells the query-builder to eager-load the nodes that are connected to
|
|
// the "maintenance_entries" edge. The optional arguments are used to configure the query builder of the edge.
|
|
func (_q *ItemQuery) WithMaintenanceEntries(opts ...func(*MaintenanceEntryQuery)) *ItemQuery {
|
|
query := (&MaintenanceEntryClient{config: _q.config}).Query()
|
|
for _, opt := range opts {
|
|
opt(query)
|
|
}
|
|
_q.withMaintenanceEntries = query
|
|
return _q
|
|
}
|
|
|
|
// WithAttachments tells the query-builder to eager-load the nodes that are connected to
|
|
// the "attachments" edge. The optional arguments are used to configure the query builder of the edge.
|
|
func (_q *ItemQuery) WithAttachments(opts ...func(*AttachmentQuery)) *ItemQuery {
|
|
query := (&AttachmentClient{config: _q.config}).Query()
|
|
for _, opt := range opts {
|
|
opt(query)
|
|
}
|
|
_q.withAttachments = 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 {
|
|
// CreatedAt time.Time `json:"created_at,omitempty"`
|
|
// Count int `json:"count,omitempty"`
|
|
// }
|
|
//
|
|
// client.Item.Query().
|
|
// GroupBy(item.FieldCreatedAt).
|
|
// Aggregate(ent.Count()).
|
|
// Scan(ctx, &v)
|
|
func (_q *ItemQuery) GroupBy(field string, fields ...string) *ItemGroupBy {
|
|
_q.ctx.Fields = append([]string{field}, fields...)
|
|
grbuild := &ItemGroupBy{build: _q}
|
|
grbuild.flds = &_q.ctx.Fields
|
|
grbuild.label = item.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 {
|
|
// CreatedAt time.Time `json:"created_at,omitempty"`
|
|
// }
|
|
//
|
|
// client.Item.Query().
|
|
// Select(item.FieldCreatedAt).
|
|
// Scan(ctx, &v)
|
|
func (_q *ItemQuery) Select(fields ...string) *ItemSelect {
|
|
_q.ctx.Fields = append(_q.ctx.Fields, fields...)
|
|
sbuild := &ItemSelect{ItemQuery: _q}
|
|
sbuild.label = item.Label
|
|
sbuild.flds, sbuild.scan = &_q.ctx.Fields, sbuild.Scan
|
|
return sbuild
|
|
}
|
|
|
|
// Aggregate returns a ItemSelect configured with the given aggregations.
|
|
func (_q *ItemQuery) Aggregate(fns ...AggregateFunc) *ItemSelect {
|
|
return _q.Select().Aggregate(fns...)
|
|
}
|
|
|
|
func (_q *ItemQuery) 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 !item.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 *ItemQuery) sqlAll(ctx context.Context, hooks ...queryHook) ([]*Item, error) {
|
|
var (
|
|
nodes = []*Item{}
|
|
withFKs = _q.withFKs
|
|
_spec = _q.querySpec()
|
|
loadedTypes = [8]bool{
|
|
_q.withGroup != nil,
|
|
_q.withParent != nil,
|
|
_q.withChildren != nil,
|
|
_q.withLabel != nil,
|
|
_q.withLocation != nil,
|
|
_q.withFields != nil,
|
|
_q.withMaintenanceEntries != nil,
|
|
_q.withAttachments != nil,
|
|
}
|
|
)
|
|
if _q.withGroup != nil || _q.withParent != nil || _q.withLocation != nil {
|
|
withFKs = true
|
|
}
|
|
if withFKs {
|
|
_spec.Node.Columns = append(_spec.Node.Columns, item.ForeignKeys...)
|
|
}
|
|
_spec.ScanValues = func(columns []string) ([]any, error) {
|
|
return (*Item).scanValues(nil, columns)
|
|
}
|
|
_spec.Assign = func(columns []string, values []any) error {
|
|
node := &Item{config: _q.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, _q.driver, _spec); err != nil {
|
|
return nil, err
|
|
}
|
|
if len(nodes) == 0 {
|
|
return nodes, nil
|
|
}
|
|
if query := _q.withGroup; query != nil {
|
|
if err := _q.loadGroup(ctx, query, nodes, nil,
|
|
func(n *Item, e *Group) { n.Edges.Group = e }); err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
if query := _q.withParent; query != nil {
|
|
if err := _q.loadParent(ctx, query, nodes, nil,
|
|
func(n *Item, e *Item) { n.Edges.Parent = e }); err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
if query := _q.withChildren; query != nil {
|
|
if err := _q.loadChildren(ctx, query, nodes,
|
|
func(n *Item) { n.Edges.Children = []*Item{} },
|
|
func(n *Item, e *Item) { n.Edges.Children = append(n.Edges.Children, e) }); err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
if query := _q.withLabel; query != nil {
|
|
if err := _q.loadLabel(ctx, query, nodes,
|
|
func(n *Item) { n.Edges.Label = []*Label{} },
|
|
func(n *Item, e *Label) { n.Edges.Label = append(n.Edges.Label, e) }); err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
if query := _q.withLocation; query != nil {
|
|
if err := _q.loadLocation(ctx, query, nodes, nil,
|
|
func(n *Item, e *Location) { n.Edges.Location = e }); err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
if query := _q.withFields; query != nil {
|
|
if err := _q.loadFields(ctx, query, nodes,
|
|
func(n *Item) { n.Edges.Fields = []*ItemField{} },
|
|
func(n *Item, e *ItemField) { n.Edges.Fields = append(n.Edges.Fields, e) }); err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
if query := _q.withMaintenanceEntries; query != nil {
|
|
if err := _q.loadMaintenanceEntries(ctx, query, nodes,
|
|
func(n *Item) { n.Edges.MaintenanceEntries = []*MaintenanceEntry{} },
|
|
func(n *Item, e *MaintenanceEntry) { n.Edges.MaintenanceEntries = append(n.Edges.MaintenanceEntries, e) }); err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
if query := _q.withAttachments; query != nil {
|
|
if err := _q.loadAttachments(ctx, query, nodes,
|
|
func(n *Item) { n.Edges.Attachments = []*Attachment{} },
|
|
func(n *Item, e *Attachment) { n.Edges.Attachments = append(n.Edges.Attachments, e) }); err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
return nodes, nil
|
|
}
|
|
|
|
func (_q *ItemQuery) loadGroup(ctx context.Context, query *GroupQuery, nodes []*Item, init func(*Item), assign func(*Item, *Group)) error {
|
|
ids := make([]uuid.UUID, 0, len(nodes))
|
|
nodeids := make(map[uuid.UUID][]*Item)
|
|
for i := range nodes {
|
|
if nodes[i].group_items == nil {
|
|
continue
|
|
}
|
|
fk := *nodes[i].group_items
|
|
if _, ok := nodeids[fk]; !ok {
|
|
ids = append(ids, fk)
|
|
}
|
|
nodeids[fk] = append(nodeids[fk], nodes[i])
|
|
}
|
|
if len(ids) == 0 {
|
|
return nil
|
|
}
|
|
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_items" returned %v`, n.ID)
|
|
}
|
|
for i := range nodes {
|
|
assign(nodes[i], n)
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
func (_q *ItemQuery) loadParent(ctx context.Context, query *ItemQuery, nodes []*Item, init func(*Item), assign func(*Item, *Item)) error {
|
|
ids := make([]uuid.UUID, 0, len(nodes))
|
|
nodeids := make(map[uuid.UUID][]*Item)
|
|
for i := range nodes {
|
|
if nodes[i].item_children == nil {
|
|
continue
|
|
}
|
|
fk := *nodes[i].item_children
|
|
if _, ok := nodeids[fk]; !ok {
|
|
ids = append(ids, fk)
|
|
}
|
|
nodeids[fk] = append(nodeids[fk], nodes[i])
|
|
}
|
|
if len(ids) == 0 {
|
|
return nil
|
|
}
|
|
query.Where(item.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 "item_children" returned %v`, n.ID)
|
|
}
|
|
for i := range nodes {
|
|
assign(nodes[i], n)
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
func (_q *ItemQuery) loadChildren(ctx context.Context, query *ItemQuery, nodes []*Item, init func(*Item), assign func(*Item, *Item)) error {
|
|
fks := make([]driver.Value, 0, len(nodes))
|
|
nodeids := make(map[uuid.UUID]*Item)
|
|
for i := range nodes {
|
|
fks = append(fks, nodes[i].ID)
|
|
nodeids[nodes[i].ID] = nodes[i]
|
|
if init != nil {
|
|
init(nodes[i])
|
|
}
|
|
}
|
|
query.withFKs = true
|
|
query.Where(predicate.Item(func(s *sql.Selector) {
|
|
s.Where(sql.InValues(s.C(item.ChildrenColumn), fks...))
|
|
}))
|
|
neighbors, err := query.All(ctx)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
for _, n := range neighbors {
|
|
fk := n.item_children
|
|
if fk == nil {
|
|
return fmt.Errorf(`foreign-key "item_children" is nil for node %v`, n.ID)
|
|
}
|
|
node, ok := nodeids[*fk]
|
|
if !ok {
|
|
return fmt.Errorf(`unexpected referenced foreign-key "item_children" returned %v for node %v`, *fk, n.ID)
|
|
}
|
|
assign(node, n)
|
|
}
|
|
return nil
|
|
}
|
|
func (_q *ItemQuery) loadLabel(ctx context.Context, query *LabelQuery, nodes []*Item, init func(*Item), assign func(*Item, *Label)) error {
|
|
edgeIDs := make([]driver.Value, len(nodes))
|
|
byID := make(map[uuid.UUID]*Item)
|
|
nids := make(map[uuid.UUID]map[*Item]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(item.LabelTable)
|
|
s.Join(joinT).On(s.C(label.FieldID), joinT.C(item.LabelPrimaryKey[0]))
|
|
s.Where(sql.InValues(joinT.C(item.LabelPrimaryKey[1]), edgeIDs...))
|
|
columns := s.SelectedColumns()
|
|
s.Select(joinT.C(item.LabelPrimaryKey[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(uuid.UUID)}, values...), nil
|
|
}
|
|
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[*Item]struct{}{byID[outValue]: {}}
|
|
return assign(columns[1:], values[1:])
|
|
}
|
|
nids[inValue][byID[outValue]] = struct{}{}
|
|
return nil
|
|
}
|
|
})
|
|
})
|
|
neighbors, err := withInterceptors[[]*Label](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 "label" node returned %v`, n.ID)
|
|
}
|
|
for kn := range nodes {
|
|
assign(kn, n)
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
func (_q *ItemQuery) loadLocation(ctx context.Context, query *LocationQuery, nodes []*Item, init func(*Item), assign func(*Item, *Location)) error {
|
|
ids := make([]uuid.UUID, 0, len(nodes))
|
|
nodeids := make(map[uuid.UUID][]*Item)
|
|
for i := range nodes {
|
|
if nodes[i].location_items == nil {
|
|
continue
|
|
}
|
|
fk := *nodes[i].location_items
|
|
if _, ok := nodeids[fk]; !ok {
|
|
ids = append(ids, fk)
|
|
}
|
|
nodeids[fk] = append(nodeids[fk], nodes[i])
|
|
}
|
|
if len(ids) == 0 {
|
|
return nil
|
|
}
|
|
query.Where(location.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 "location_items" returned %v`, n.ID)
|
|
}
|
|
for i := range nodes {
|
|
assign(nodes[i], n)
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
func (_q *ItemQuery) loadFields(ctx context.Context, query *ItemFieldQuery, nodes []*Item, init func(*Item), assign func(*Item, *ItemField)) error {
|
|
fks := make([]driver.Value, 0, len(nodes))
|
|
nodeids := make(map[uuid.UUID]*Item)
|
|
for i := range nodes {
|
|
fks = append(fks, nodes[i].ID)
|
|
nodeids[nodes[i].ID] = nodes[i]
|
|
if init != nil {
|
|
init(nodes[i])
|
|
}
|
|
}
|
|
query.withFKs = true
|
|
query.Where(predicate.ItemField(func(s *sql.Selector) {
|
|
s.Where(sql.InValues(s.C(item.FieldsColumn), fks...))
|
|
}))
|
|
neighbors, err := query.All(ctx)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
for _, n := range neighbors {
|
|
fk := n.item_fields
|
|
if fk == nil {
|
|
return fmt.Errorf(`foreign-key "item_fields" is nil for node %v`, n.ID)
|
|
}
|
|
node, ok := nodeids[*fk]
|
|
if !ok {
|
|
return fmt.Errorf(`unexpected referenced foreign-key "item_fields" returned %v for node %v`, *fk, n.ID)
|
|
}
|
|
assign(node, n)
|
|
}
|
|
return nil
|
|
}
|
|
func (_q *ItemQuery) loadMaintenanceEntries(ctx context.Context, query *MaintenanceEntryQuery, nodes []*Item, init func(*Item), assign func(*Item, *MaintenanceEntry)) error {
|
|
fks := make([]driver.Value, 0, len(nodes))
|
|
nodeids := make(map[uuid.UUID]*Item)
|
|
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(maintenanceentry.FieldItemID)
|
|
}
|
|
query.Where(predicate.MaintenanceEntry(func(s *sql.Selector) {
|
|
s.Where(sql.InValues(s.C(item.MaintenanceEntriesColumn), fks...))
|
|
}))
|
|
neighbors, err := query.All(ctx)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
for _, n := range neighbors {
|
|
fk := n.ItemID
|
|
node, ok := nodeids[fk]
|
|
if !ok {
|
|
return fmt.Errorf(`unexpected referenced foreign-key "item_id" returned %v for node %v`, fk, n.ID)
|
|
}
|
|
assign(node, n)
|
|
}
|
|
return nil
|
|
}
|
|
func (_q *ItemQuery) loadAttachments(ctx context.Context, query *AttachmentQuery, nodes []*Item, init func(*Item), assign func(*Item, *Attachment)) error {
|
|
fks := make([]driver.Value, 0, len(nodes))
|
|
nodeids := make(map[uuid.UUID]*Item)
|
|
for i := range nodes {
|
|
fks = append(fks, nodes[i].ID)
|
|
nodeids[nodes[i].ID] = nodes[i]
|
|
if init != nil {
|
|
init(nodes[i])
|
|
}
|
|
}
|
|
query.withFKs = true
|
|
query.Where(predicate.Attachment(func(s *sql.Selector) {
|
|
s.Where(sql.InValues(s.C(item.AttachmentsColumn), fks...))
|
|
}))
|
|
neighbors, err := query.All(ctx)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
for _, n := range neighbors {
|
|
fk := n.item_attachments
|
|
if fk == nil {
|
|
return fmt.Errorf(`foreign-key "item_attachments" is nil for node %v`, n.ID)
|
|
}
|
|
node, ok := nodeids[*fk]
|
|
if !ok {
|
|
return fmt.Errorf(`unexpected referenced foreign-key "item_attachments" returned %v for node %v`, *fk, n.ID)
|
|
}
|
|
assign(node, n)
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (_q *ItemQuery) sqlCount(ctx context.Context) (int, error) {
|
|
_spec := _q.querySpec()
|
|
_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 *ItemQuery) querySpec() *sqlgraph.QuerySpec {
|
|
_spec := sqlgraph.NewQuerySpec(item.Table, item.Columns, sqlgraph.NewFieldSpec(item.FieldID, field.TypeUUID))
|
|
_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, item.FieldID)
|
|
for i := range fields {
|
|
if fields[i] != item.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 *ItemQuery) sqlQuery(ctx context.Context) *sql.Selector {
|
|
builder := sql.Dialect(_q.driver.Dialect())
|
|
t1 := builder.Table(item.Table)
|
|
columns := _q.ctx.Fields
|
|
if len(columns) == 0 {
|
|
columns = item.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 _, 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
|
|
}
|
|
|
|
// ItemGroupBy is the group-by builder for Item entities.
|
|
type ItemGroupBy struct {
|
|
selector
|
|
build *ItemQuery
|
|
}
|
|
|
|
// Aggregate adds the given aggregation functions to the group-by query.
|
|
func (_g *ItemGroupBy) Aggregate(fns ...AggregateFunc) *ItemGroupBy {
|
|
_g.fns = append(_g.fns, fns...)
|
|
return _g
|
|
}
|
|
|
|
// Scan applies the selector query and scans the result into the given value.
|
|
func (_g *ItemGroupBy) 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[*ItemQuery, *ItemGroupBy](ctx, _g.build, _g, _g.build.inters, v)
|
|
}
|
|
|
|
func (_g *ItemGroupBy) sqlScan(ctx context.Context, root *ItemQuery, 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)
|
|
}
|
|
|
|
// ItemSelect is the builder for selecting fields of Item entities.
|
|
type ItemSelect struct {
|
|
*ItemQuery
|
|
selector
|
|
}
|
|
|
|
// Aggregate adds the given aggregation functions to the selector query.
|
|
func (_s *ItemSelect) Aggregate(fns ...AggregateFunc) *ItemSelect {
|
|
_s.fns = append(_s.fns, fns...)
|
|
return _s
|
|
}
|
|
|
|
// Scan applies the selector query and scans the result into the given value.
|
|
func (_s *ItemSelect) 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[*ItemQuery, *ItemSelect](ctx, _s.ItemQuery, _s, _s.inters, v)
|
|
}
|
|
|
|
func (_s *ItemSelect) sqlScan(ctx context.Context, root *ItemQuery, 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)
|
|
}
|