// 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/ent/group" "github.com/hay-kot/homebox/backend/ent/item" "github.com/hay-kot/homebox/backend/ent/label" "github.com/hay-kot/homebox/backend/ent/predicate" ) // LabelQuery is the builder for querying Label entities. type LabelQuery struct { config limit *int offset *int unique *bool order []OrderFunc fields []string 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 adds a limit step to the query. func (lq *LabelQuery) Limit(limit int) *LabelQuery { lq.limit = &limit return lq } // Offset adds an offset step to the query. func (lq *LabelQuery) Offset(offset int) *LabelQuery { lq.offset = &offset 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 { lq.unique = &unique return lq } // Order adds an order step to the query. 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 := &GroupQuery{config: lq.config} 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 := &ItemQuery{config: lq.config} 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) { nodes, err := lq.Limit(1).All(ctx) 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 if ids, err = lq.Limit(1).IDs(ctx); err != nil { 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) { nodes, err := lq.Limit(2).All(ctx) 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 if ids, err = lq.Limit(2).IDs(ctx); err != nil { 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) { if err := lq.prepareQuery(ctx); err != nil { return nil, err } return lq.sqlAll(ctx) } // 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) ([]uuid.UUID, error) { var ids []uuid.UUID if err := lq.Select(label.FieldID).Scan(ctx, &ids); err != nil { 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) { if err := lq.prepareQuery(ctx); err != nil { return 0, err } return lq.sqlCount(ctx) } // 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) { if err := lq.prepareQuery(ctx); err != nil { return false, err } return lq.sqlExist(ctx) } // 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, limit: lq.limit, offset: lq.offset, order: append([]OrderFunc{}, lq.order...), predicates: append([]predicate.Label{}, lq.predicates...), withGroup: lq.withGroup.Clone(), withItems: lq.withItems.Clone(), // clone intermediate query. sql: lq.sql.Clone(), path: lq.path, unique: lq.unique, } } // 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 := &GroupQuery{config: lq.config} 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 := &ItemQuery{config: lq.config} 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 { grbuild := &LabelGroupBy{config: lq.config} grbuild.fields = append([]string{field}, fields...) grbuild.path = func(ctx context.Context) (prev *sql.Selector, err error) { if err := lq.prepareQuery(ctx); err != nil { return nil, err } return lq.sqlQuery(ctx), nil } grbuild.label = label.Label grbuild.flds, grbuild.scan = &grbuild.fields, 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.Label.Query(). // Select(label.FieldCreatedAt). // Scan(ctx, &v) func (lq *LabelQuery) Select(fields ...string) *LabelSelect { lq.fields = append(lq.fields, fields...) selbuild := &LabelSelect{LabelQuery: lq} selbuild.label = label.Label selbuild.flds, selbuild.scan = &lq.fields, selbuild.Scan return selbuild } func (lq *LabelQuery) prepareQuery(ctx context.Context) error { for _, f := range lq.fields { 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) ([]interface{}, error) { return (*Label).scanValues(nil, columns) } _spec.Assign = func(columns []string, values []interface{}) error { 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]) } 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 } neighbors, err := query.sqlAll(ctx, func(_ context.Context, spec *sqlgraph.QuerySpec) { assign := spec.Assign values := spec.ScanValues spec.ScanValues = func(columns []string) ([]interface{}, error) { values, err := values(columns[1:]) if err != nil { return nil, err } return append([]interface{}{new(uuid.UUID)}, values...), nil } spec.Assign = func(columns []string, values []interface{}) error { outValue := *values[0].(*uuid.UUID) inValue := *values[1].(*uuid.UUID) if nids[inValue] == nil { nids[inValue] = map[*Label]struct{}{byID[outValue]: struct{}{}} return assign(columns[1:], values[1:]) } nids[inValue][byID[outValue]] = struct{}{} return nil } }) 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() _spec.Node.Columns = lq.fields if len(lq.fields) > 0 { _spec.Unique = lq.unique != nil && *lq.unique } return sqlgraph.CountNodes(ctx, lq.driver, _spec) } func (lq *LabelQuery) sqlExist(ctx context.Context) (bool, error) { n, err := lq.sqlCount(ctx) if err != nil { return false, fmt.Errorf("ent: check existence: %w", err) } return n > 0, nil } func (lq *LabelQuery) querySpec() *sqlgraph.QuerySpec { _spec := &sqlgraph.QuerySpec{ Node: &sqlgraph.NodeSpec{ Table: label.Table, Columns: label.Columns, ID: &sqlgraph.FieldSpec{ Type: field.TypeUUID, Column: label.FieldID, }, }, From: lq.sql, Unique: true, } if unique := lq.unique; unique != nil { _spec.Unique = *unique } if fields := lq.fields; len(fields) > 0 { _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) } } } if limit := lq.limit; limit != nil { _spec.Limit = *limit } if offset := lq.offset; offset != nil { _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) columns := lq.fields 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...)...) } if lq.unique != nil && *lq.unique { selector.Distinct() } for _, p := range lq.predicates { p(selector) } for _, p := range lq.order { p(selector) } if offset := lq.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 := lq.limit; limit != nil { selector.Limit(*limit) } return selector } // LabelGroupBy is the group-by builder for Label entities. type LabelGroupBy struct { config selector fields []string fns []AggregateFunc // intermediate query (i.e. traversal path). sql *sql.Selector path func(context.Context) (*sql.Selector, error) } // 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 group-by query and scans the result into the given value. func (lgb *LabelGroupBy) Scan(ctx context.Context, v interface{}) error { query, err := lgb.path(ctx) if err != nil { return err } lgb.sql = query return lgb.sqlScan(ctx, v) } func (lgb *LabelGroupBy) sqlScan(ctx context.Context, v interface{}) error { for _, f := range lgb.fields { if !label.ValidColumn(f) { return &ValidationError{Name: f, err: fmt.Errorf("invalid field %q for group-by", f)} } } selector := lgb.sqlQuery() if err := selector.Err(); err != nil { return err } rows := &sql.Rows{} query, args := selector.Query() if err := lgb.driver.Query(ctx, query, args, rows); err != nil { return err } defer rows.Close() return sql.ScanSlice(rows, v) } func (lgb *LabelGroupBy) sqlQuery() *sql.Selector { selector := lgb.sql.Select() aggregation := make([]string, 0, len(lgb.fns)) for _, fn := range lgb.fns { aggregation = append(aggregation, fn(selector)) } // If no columns were selected in a custom aggregation function, the default // selection is the fields used for "group-by", and the aggregation functions. if len(selector.SelectedColumns()) == 0 { columns := make([]string, 0, len(lgb.fields)+len(lgb.fns)) for _, f := range lgb.fields { columns = append(columns, selector.C(f)) } columns = append(columns, aggregation...) selector.Select(columns...) } return selector.GroupBy(selector.Columns(lgb.fields...)...) } // LabelSelect is the builder for selecting fields of Label entities. type LabelSelect struct { *LabelQuery selector // intermediate query (i.e. traversal path). sql *sql.Selector } // Scan applies the selector query and scans the result into the given value. func (ls *LabelSelect) Scan(ctx context.Context, v interface{}) error { if err := ls.prepareQuery(ctx); err != nil { return err } ls.sql = ls.LabelQuery.sqlQuery(ctx) return ls.sqlScan(ctx, v) } func (ls *LabelSelect) sqlScan(ctx context.Context, v interface{}) error { rows := &sql.Rows{} query, args := ls.sql.Query() if err := ls.driver.Query(ctx, query, args, rows); err != nil { return err } defer rows.Close() return sql.ScanSlice(rows, v) }