mirror of
https://github.com/ent/ent.git
synced 2026-05-24 09:31:56 +03:00
* update GroupReceiver and SelectReceiver * update examples * update entc/integration generated code * Update entc/gen/type.go Co-authored-by: Ariel Mashraki <7413593+a8m@users.noreply.github.com> --------- Co-authored-by: Ariel Mashraki <7413593+a8m@users.noreply.github.com>
597 lines
16 KiB
Go
597 lines
16 KiB
Go
// Copyright 2019-present Facebook Inc. All rights reserved.
|
|
// This source code is licensed under the Apache 2.0 license found
|
|
// in the LICENSE file in the root directory of this source tree.
|
|
|
|
// Code generated by ent, DO NOT EDIT.
|
|
|
|
package entv1
|
|
|
|
import (
|
|
"context"
|
|
"fmt"
|
|
"math"
|
|
|
|
"entgo.io/ent"
|
|
"entgo.io/ent/dialect/sql"
|
|
"entgo.io/ent/dialect/sql/sqlgraph"
|
|
"entgo.io/ent/entc/integration/migrate/entv1/car"
|
|
"entgo.io/ent/entc/integration/migrate/entv1/predicate"
|
|
"entgo.io/ent/entc/integration/migrate/entv1/user"
|
|
"entgo.io/ent/schema/field"
|
|
)
|
|
|
|
// CarQuery is the builder for querying Car entities.
|
|
type CarQuery struct {
|
|
config
|
|
ctx *QueryContext
|
|
order []car.OrderOption
|
|
inters []Interceptor
|
|
predicates []predicate.Car
|
|
withOwner *UserQuery
|
|
withFKs bool
|
|
// intermediate query (i.e. traversal path).
|
|
sql *sql.Selector
|
|
path func(context.Context) (*sql.Selector, error)
|
|
}
|
|
|
|
// Where adds a new predicate for the CarQuery builder.
|
|
func (_q *CarQuery) Where(ps ...predicate.Car) *CarQuery {
|
|
_q.predicates = append(_q.predicates, ps...)
|
|
return _q
|
|
}
|
|
|
|
// Limit the number of records to be returned by this query.
|
|
func (_q *CarQuery) Limit(limit int) *CarQuery {
|
|
_q.ctx.Limit = &limit
|
|
return _q
|
|
}
|
|
|
|
// Offset to start from.
|
|
func (_q *CarQuery) Offset(offset int) *CarQuery {
|
|
_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 *CarQuery) Unique(unique bool) *CarQuery {
|
|
_q.ctx.Unique = &unique
|
|
return _q
|
|
}
|
|
|
|
// Order specifies how the records should be ordered.
|
|
func (_q *CarQuery) Order(o ...car.OrderOption) *CarQuery {
|
|
_q.order = append(_q.order, o...)
|
|
return _q
|
|
}
|
|
|
|
// QueryOwner chains the current query on the "owner" edge.
|
|
func (_q *CarQuery) QueryOwner() *UserQuery {
|
|
query := (&UserClient{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(car.Table, car.FieldID, selector),
|
|
sqlgraph.To(user.Table, user.FieldID),
|
|
sqlgraph.Edge(sqlgraph.O2O, true, car.OwnerTable, car.OwnerColumn),
|
|
)
|
|
fromU = sqlgraph.SetNeighbors(_q.driver.Dialect(), step)
|
|
return fromU, nil
|
|
}
|
|
return query
|
|
}
|
|
|
|
// First returns the first Car entity from the query.
|
|
// Returns a *NotFoundError when no Car was found.
|
|
func (_q *CarQuery) First(ctx context.Context) (*Car, 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{car.Label}
|
|
}
|
|
return nodes[0], nil
|
|
}
|
|
|
|
// FirstX is like First, but panics if an error occurs.
|
|
func (_q *CarQuery) FirstX(ctx context.Context) *Car {
|
|
node, err := _q.First(ctx)
|
|
if err != nil && !IsNotFound(err) {
|
|
panic(err)
|
|
}
|
|
return node
|
|
}
|
|
|
|
// FirstID returns the first Car ID from the query.
|
|
// Returns a *NotFoundError when no Car ID was found.
|
|
func (_q *CarQuery) FirstID(ctx context.Context) (id int, err error) {
|
|
var ids []int
|
|
if ids, err = _q.Limit(1).IDs(setContextOp(ctx, _q.ctx, ent.OpQueryFirstID)); err != nil {
|
|
return
|
|
}
|
|
if len(ids) == 0 {
|
|
err = &NotFoundError{car.Label}
|
|
return
|
|
}
|
|
return ids[0], nil
|
|
}
|
|
|
|
// FirstIDX is like FirstID, but panics if an error occurs.
|
|
func (_q *CarQuery) FirstIDX(ctx context.Context) int {
|
|
id, err := _q.FirstID(ctx)
|
|
if err != nil && !IsNotFound(err) {
|
|
panic(err)
|
|
}
|
|
return id
|
|
}
|
|
|
|
// Only returns a single Car entity found by the query, ensuring it only returns one.
|
|
// Returns a *NotSingularError when more than one Car entity is found.
|
|
// Returns a *NotFoundError when no Car entities are found.
|
|
func (_q *CarQuery) Only(ctx context.Context) (*Car, 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{car.Label}
|
|
default:
|
|
return nil, &NotSingularError{car.Label}
|
|
}
|
|
}
|
|
|
|
// OnlyX is like Only, but panics if an error occurs.
|
|
func (_q *CarQuery) OnlyX(ctx context.Context) *Car {
|
|
node, err := _q.Only(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return node
|
|
}
|
|
|
|
// OnlyID is like Only, but returns the only Car ID in the query.
|
|
// Returns a *NotSingularError when more than one Car ID is found.
|
|
// Returns a *NotFoundError when no entities are found.
|
|
func (_q *CarQuery) OnlyID(ctx context.Context) (id int, err error) {
|
|
var ids []int
|
|
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{car.Label}
|
|
default:
|
|
err = &NotSingularError{car.Label}
|
|
}
|
|
return
|
|
}
|
|
|
|
// OnlyIDX is like OnlyID, but panics if an error occurs.
|
|
func (_q *CarQuery) OnlyIDX(ctx context.Context) int {
|
|
id, err := _q.OnlyID(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return id
|
|
}
|
|
|
|
// All executes the query and returns a list of Cars.
|
|
func (_q *CarQuery) All(ctx context.Context) ([]*Car, error) {
|
|
ctx = setContextOp(ctx, _q.ctx, ent.OpQueryAll)
|
|
if err := _q.prepareQuery(ctx); err != nil {
|
|
return nil, err
|
|
}
|
|
qr := querierAll[[]*Car, *CarQuery]()
|
|
return withInterceptors[[]*Car](ctx, _q, qr, _q.inters)
|
|
}
|
|
|
|
// AllX is like All, but panics if an error occurs.
|
|
func (_q *CarQuery) AllX(ctx context.Context) []*Car {
|
|
nodes, err := _q.All(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return nodes
|
|
}
|
|
|
|
// IDs executes the query and returns a list of Car IDs.
|
|
func (_q *CarQuery) IDs(ctx context.Context) (ids []int, err error) {
|
|
if _q.ctx.Unique == nil && _q.path != nil {
|
|
_q.Unique(true)
|
|
}
|
|
ctx = setContextOp(ctx, _q.ctx, ent.OpQueryIDs)
|
|
if err = _q.Select(car.FieldID).Scan(ctx, &ids); err != nil {
|
|
return nil, err
|
|
}
|
|
return ids, nil
|
|
}
|
|
|
|
// IDsX is like IDs, but panics if an error occurs.
|
|
func (_q *CarQuery) IDsX(ctx context.Context) []int {
|
|
ids, err := _q.IDs(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return ids
|
|
}
|
|
|
|
// Count returns the count of the given query.
|
|
func (_q *CarQuery) 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[*CarQuery](), _q.inters)
|
|
}
|
|
|
|
// CountX is like Count, but panics if an error occurs.
|
|
func (_q *CarQuery) 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 *CarQuery) 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("entv1: check existence: %w", err)
|
|
default:
|
|
return true, nil
|
|
}
|
|
}
|
|
|
|
// ExistX is like Exist, but panics if an error occurs.
|
|
func (_q *CarQuery) ExistX(ctx context.Context) bool {
|
|
exist, err := _q.Exist(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return exist
|
|
}
|
|
|
|
// Clone returns a duplicate of the CarQuery 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 *CarQuery) Clone() *CarQuery {
|
|
if _q == nil {
|
|
return nil
|
|
}
|
|
return &CarQuery{
|
|
config: _q.config,
|
|
ctx: _q.ctx.Clone(),
|
|
order: append([]car.OrderOption{}, _q.order...),
|
|
inters: append([]Interceptor{}, _q.inters...),
|
|
predicates: append([]predicate.Car{}, _q.predicates...),
|
|
withOwner: _q.withOwner.Clone(),
|
|
// clone intermediate query.
|
|
sql: _q.sql.Clone(),
|
|
path: _q.path,
|
|
}
|
|
}
|
|
|
|
// WithOwner tells the query-builder to eager-load the nodes that are connected to
|
|
// the "owner" edge. The optional arguments are used to configure the query builder of the edge.
|
|
func (_q *CarQuery) WithOwner(opts ...func(*UserQuery)) *CarQuery {
|
|
query := (&UserClient{config: _q.config}).Query()
|
|
for _, opt := range opts {
|
|
opt(query)
|
|
}
|
|
_q.withOwner = 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.
|
|
func (_q *CarQuery) GroupBy(field string, fields ...string) *CarGroupBy {
|
|
_q.ctx.Fields = append([]string{field}, fields...)
|
|
grbuild := &CarGroupBy{build: _q}
|
|
grbuild.flds = &_q.ctx.Fields
|
|
grbuild.label = car.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.
|
|
func (_q *CarQuery) Select(fields ...string) *CarSelect {
|
|
_q.ctx.Fields = append(_q.ctx.Fields, fields...)
|
|
sbuild := &CarSelect{CarQuery: _q}
|
|
sbuild.label = car.Label
|
|
sbuild.flds, sbuild.scan = &_q.ctx.Fields, sbuild.Scan
|
|
return sbuild
|
|
}
|
|
|
|
// Aggregate returns a CarSelect configured with the given aggregations.
|
|
func (_q *CarQuery) Aggregate(fns ...AggregateFunc) *CarSelect {
|
|
return _q.Select().Aggregate(fns...)
|
|
}
|
|
|
|
func (_q *CarQuery) prepareQuery(ctx context.Context) error {
|
|
for _, inter := range _q.inters {
|
|
if inter == nil {
|
|
return fmt.Errorf("entv1: uninitialized interceptor (forgotten import entv1/runtime?)")
|
|
}
|
|
if trv, ok := inter.(Traverser); ok {
|
|
if err := trv.Traverse(ctx, _q); err != nil {
|
|
return err
|
|
}
|
|
}
|
|
}
|
|
for _, f := range _q.ctx.Fields {
|
|
if !car.ValidColumn(f) {
|
|
return &ValidationError{Name: f, err: fmt.Errorf("entv1: 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 *CarQuery) sqlAll(ctx context.Context, hooks ...queryHook) ([]*Car, error) {
|
|
var (
|
|
nodes = []*Car{}
|
|
withFKs = _q.withFKs
|
|
_spec = _q.querySpec()
|
|
loadedTypes = [1]bool{
|
|
_q.withOwner != nil,
|
|
}
|
|
)
|
|
if _q.withOwner != nil {
|
|
withFKs = true
|
|
}
|
|
if withFKs {
|
|
_spec.Node.Columns = append(_spec.Node.Columns, car.ForeignKeys...)
|
|
}
|
|
_spec.ScanValues = func(columns []string) ([]any, error) {
|
|
return (*Car).scanValues(nil, columns)
|
|
}
|
|
_spec.Assign = func(columns []string, values []any) error {
|
|
node := &Car{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.withOwner; query != nil {
|
|
if err := _q.loadOwner(ctx, query, nodes, nil,
|
|
func(n *Car, e *User) { n.Edges.Owner = e }); err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
return nodes, nil
|
|
}
|
|
|
|
func (_q *CarQuery) loadOwner(ctx context.Context, query *UserQuery, nodes []*Car, init func(*Car), assign func(*Car, *User)) error {
|
|
ids := make([]int, 0, len(nodes))
|
|
nodeids := make(map[int][]*Car)
|
|
for i := range nodes {
|
|
if nodes[i].user_car == nil {
|
|
continue
|
|
}
|
|
fk := *nodes[i].user_car
|
|
if _, ok := nodeids[fk]; !ok {
|
|
ids = append(ids, fk)
|
|
}
|
|
nodeids[fk] = append(nodeids[fk], nodes[i])
|
|
}
|
|
if len(ids) == 0 {
|
|
return nil
|
|
}
|
|
query.Where(user.IDIn(ids...))
|
|
neighbors, err := query.All(ctx)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
for _, n := range neighbors {
|
|
nodes, ok := nodeids[n.ID]
|
|
if !ok {
|
|
return fmt.Errorf(`unexpected foreign-key "user_car" returned %v`, n.ID)
|
|
}
|
|
for i := range nodes {
|
|
assign(nodes[i], n)
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (_q *CarQuery) 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 *CarQuery) querySpec() *sqlgraph.QuerySpec {
|
|
_spec := sqlgraph.NewQuerySpec(car.Table, car.Columns, sqlgraph.NewFieldSpec(car.FieldID, field.TypeInt))
|
|
_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, car.FieldID)
|
|
for i := range fields {
|
|
if fields[i] != car.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 *CarQuery) sqlQuery(ctx context.Context) *sql.Selector {
|
|
builder := sql.Dialect(_q.driver.Dialect())
|
|
t1 := builder.Table(car.Table)
|
|
columns := _q.ctx.Fields
|
|
if len(columns) == 0 {
|
|
columns = car.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
|
|
}
|
|
|
|
// CarGroupBy is the group-by builder for Car entities.
|
|
type CarGroupBy struct {
|
|
selector
|
|
build *CarQuery
|
|
}
|
|
|
|
// Aggregate adds the given aggregation functions to the group-by query.
|
|
func (_g *CarGroupBy) Aggregate(fns ...AggregateFunc) *CarGroupBy {
|
|
_g.fns = append(_g.fns, fns...)
|
|
return _g
|
|
}
|
|
|
|
// Scan applies the selector query and scans the result into the given value.
|
|
func (_g *CarGroupBy) 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[*CarQuery, *CarGroupBy](ctx, _g.build, _g, _g.build.inters, v)
|
|
}
|
|
|
|
func (_g *CarGroupBy) sqlScan(ctx context.Context, root *CarQuery, 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)
|
|
}
|
|
|
|
// CarSelect is the builder for selecting fields of Car entities.
|
|
type CarSelect struct {
|
|
*CarQuery
|
|
selector
|
|
}
|
|
|
|
// Aggregate adds the given aggregation functions to the selector query.
|
|
func (_s *CarSelect) Aggregate(fns ...AggregateFunc) *CarSelect {
|
|
_s.fns = append(_s.fns, fns...)
|
|
return _s
|
|
}
|
|
|
|
// Scan applies the selector query and scans the result into the given value.
|
|
func (_s *CarSelect) 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[*CarQuery, *CarSelect](ctx, _s.CarQuery, _s, _s.inters, v)
|
|
}
|
|
|
|
func (_s *CarSelect) sqlScan(ctx context.Context, root *CarQuery, 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)
|
|
}
|