matosbox/backend/internal/data/ent/categorie_query.go

// 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"
	"gitea.maison43.duckdns.org/gilles/matosbox/internal/data/ent/categorie"
	"gitea.maison43.duckdns.org/gilles/matosbox/internal/data/ent/predicate"
	"github.com/google/uuid"
)

// CategorieQuery is the builder for querying Categorie entities.
type CategorieQuery struct {
	config
	ctx         *QueryContext
	order       []categorie.OrderOption
	inters      []Interceptor
	predicates  []predicate.Categorie
	withParent  *CategorieQuery
	withEnfants *CategorieQuery
	// intermediate query (i.e. traversal path).
	sql  *sql.Selector
	path func(context.Context) (*sql.Selector, error)
}

// Where adds a new predicate for the CategorieQuery builder.
func (_q *CategorieQuery) Where(ps ...predicate.Categorie) *CategorieQuery {
	_q.predicates = append(_q.predicates, ps...)
	return _q
}

// Limit the number of records to be returned by this query.
func (_q *CategorieQuery) Limit(limit int) *CategorieQuery {
	_q.ctx.Limit = &limit
	return _q
}

// Offset to start from.
func (_q *CategorieQuery) Offset(offset int) *CategorieQuery {
	_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 *CategorieQuery) Unique(unique bool) *CategorieQuery {
	_q.ctx.Unique = &unique
	return _q
}

// Order specifies how the records should be ordered.
func (_q *CategorieQuery) Order(o ...categorie.OrderOption) *CategorieQuery {
	_q.order = append(_q.order, o...)
	return _q
}

// QueryParent chains the current query on the "parent" edge.
func (_q *CategorieQuery) QueryParent() *CategorieQuery {
	query := (&CategorieClient{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(categorie.Table, categorie.FieldID, selector),
			sqlgraph.To(categorie.Table, categorie.FieldID),
			sqlgraph.Edge(sqlgraph.M2O, true, categorie.ParentTable, categorie.ParentColumn),
		)
		fromU = sqlgraph.SetNeighbors(_q.driver.Dialect(), step)
		return fromU, nil
	}
	return query
}

// QueryEnfants chains the current query on the "enfants" edge.
func (_q *CategorieQuery) QueryEnfants() *CategorieQuery {
	query := (&CategorieClient{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(categorie.Table, categorie.FieldID, selector),
			sqlgraph.To(categorie.Table, categorie.FieldID),
			sqlgraph.Edge(sqlgraph.O2M, false, categorie.EnfantsTable, categorie.EnfantsColumn),
		)
		fromU = sqlgraph.SetNeighbors(_q.driver.Dialect(), step)
		return fromU, nil
	}
	return query
}

// First returns the first Categorie entity from the query.
// Returns a *NotFoundError when no Categorie was found.
func (_q *CategorieQuery) First(ctx context.Context) (*Categorie, 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{categorie.Label}
	}
	return nodes[0], nil
}

// FirstX is like First, but panics if an error occurs.
func (_q *CategorieQuery) FirstX(ctx context.Context) *Categorie {
	node, err := _q.First(ctx)
	if err != nil && !IsNotFound(err) {
		panic(err)
	}
	return node
}

// FirstID returns the first Categorie ID from the query.
// Returns a *NotFoundError when no Categorie ID was found.
func (_q *CategorieQuery) 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{categorie.Label}
		return
	}
	return ids[0], nil
}

// FirstIDX is like FirstID, but panics if an error occurs.
func (_q *CategorieQuery) FirstIDX(ctx context.Context) uuid.UUID {
	id, err := _q.FirstID(ctx)
	if err != nil && !IsNotFound(err) {
		panic(err)
	}
	return id
}

// Only returns a single Categorie entity found by the query, ensuring it only returns one.
// Returns a *NotSingularError when more than one Categorie entity is found.
// Returns a *NotFoundError when no Categorie entities are found.
func (_q *CategorieQuery) Only(ctx context.Context) (*Categorie, 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{categorie.Label}
	default:
		return nil, &NotSingularError{categorie.Label}
	}
}

// OnlyX is like Only, but panics if an error occurs.
func (_q *CategorieQuery) OnlyX(ctx context.Context) *Categorie {
	node, err := _q.Only(ctx)
	if err != nil {
		panic(err)
	}
	return node
}

// OnlyID is like Only, but returns the only Categorie ID in the query.
// Returns a *NotSingularError when more than one Categorie ID is found.
// Returns a *NotFoundError when no entities are found.
func (_q *CategorieQuery) 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{categorie.Label}
	default:
		err = &NotSingularError{categorie.Label}
	}
	return
}

// OnlyIDX is like OnlyID, but panics if an error occurs.
func (_q *CategorieQuery) 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 Categories.
func (_q *CategorieQuery) All(ctx context.Context) ([]*Categorie, error) {
	ctx = setContextOp(ctx, _q.ctx, ent.OpQueryAll)
	if err := _q.prepareQuery(ctx); err != nil {
		return nil, err
	}
	qr := querierAll[[]*Categorie, *CategorieQuery]()
	return withInterceptors[[]*Categorie](ctx, _q, qr, _q.inters)
}

// AllX is like All, but panics if an error occurs.
func (_q *CategorieQuery) AllX(ctx context.Context) []*Categorie {
	nodes, err := _q.All(ctx)
	if err != nil {
		panic(err)
	}
	return nodes
}

// IDs executes the query and returns a list of Categorie IDs.
func (_q *CategorieQuery) 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(categorie.FieldID).Scan(ctx, &ids); err != nil {
		return nil, err
	}
	return ids, nil
}

// IDsX is like IDs, but panics if an error occurs.
func (_q *CategorieQuery) 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 *CategorieQuery) 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[*CategorieQuery](), _q.inters)
}

// CountX is like Count, but panics if an error occurs.
func (_q *CategorieQuery) 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 *CategorieQuery) 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 *CategorieQuery) ExistX(ctx context.Context) bool {
	exist, err := _q.Exist(ctx)
	if err != nil {
		panic(err)
	}
	return exist
}

// Clone returns a duplicate of the CategorieQuery 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 *CategorieQuery) Clone() *CategorieQuery {
	if _q == nil {
		return nil
	}
	return &CategorieQuery{
		config:      _q.config,
		ctx:         _q.ctx.Clone(),
		order:       append([]categorie.OrderOption{}, _q.order...),
		inters:      append([]Interceptor{}, _q.inters...),
		predicates:  append([]predicate.Categorie{}, _q.predicates...),
		withParent:  _q.withParent.Clone(),
		withEnfants: _q.withEnfants.Clone(),
		// clone intermediate query.
		sql:  _q.sql.Clone(),
		path: _q.path,
	}
}

// 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 *CategorieQuery) WithParent(opts ...func(*CategorieQuery)) *CategorieQuery {
	query := (&CategorieClient{config: _q.config}).Query()
	for _, opt := range opts {
		opt(query)
	}
	_q.withParent = query
	return _q
}

// WithEnfants tells the query-builder to eager-load the nodes that are connected to
// the "enfants" edge. The optional arguments are used to configure the query builder of the edge.
func (_q *CategorieQuery) WithEnfants(opts ...func(*CategorieQuery)) *CategorieQuery {
	query := (&CategorieClient{config: _q.config}).Query()
	for _, opt := range opts {
		opt(query)
	}
	_q.withEnfants = 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 {
//		Nom string `json:"nom,omitempty"`
//		Count int `json:"count,omitempty"`
//	}
//
//	client.Categorie.Query().
//		GroupBy(categorie.FieldNom).
//		Aggregate(ent.Count()).
//		Scan(ctx, &v)
func (_q *CategorieQuery) GroupBy(field string, fields ...string) *CategorieGroupBy {
	_q.ctx.Fields = append([]string{field}, fields...)
	grbuild := &CategorieGroupBy{build: _q}
	grbuild.flds = &_q.ctx.Fields
	grbuild.label = categorie.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 {
//		Nom string `json:"nom,omitempty"`
//	}
//
//	client.Categorie.Query().
//		Select(categorie.FieldNom).
//		Scan(ctx, &v)
func (_q *CategorieQuery) Select(fields ...string) *CategorieSelect {
	_q.ctx.Fields = append(_q.ctx.Fields, fields...)
	sbuild := &CategorieSelect{CategorieQuery: _q}
	sbuild.label = categorie.Label
	sbuild.flds, sbuild.scan = &_q.ctx.Fields, sbuild.Scan
	return sbuild
}

// Aggregate returns a CategorieSelect configured with the given aggregations.
func (_q *CategorieQuery) Aggregate(fns ...AggregateFunc) *CategorieSelect {
	return _q.Select().Aggregate(fns...)
}

func (_q *CategorieQuery) 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 !categorie.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 *CategorieQuery) sqlAll(ctx context.Context, hooks ...queryHook) ([]*Categorie, error) {
	var (
		nodes       = []*Categorie{}
		_spec       = _q.querySpec()
		loadedTypes = [2]bool{
			_q.withParent != nil,
			_q.withEnfants != nil,
		}
	)
	_spec.ScanValues = func(columns []string) ([]any, error) {
		return (*Categorie).scanValues(nil, columns)
	}
	_spec.Assign = func(columns []string, values []any) error {
		node := &Categorie{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.withParent; query != nil {
		if err := _q.loadParent(ctx, query, nodes, nil,
			func(n *Categorie, e *Categorie) { n.Edges.Parent = e }); err != nil {
			return nil, err
		}
	}
	if query := _q.withEnfants; query != nil {
		if err := _q.loadEnfants(ctx, query, nodes,
			func(n *Categorie) { n.Edges.Enfants = []*Categorie{} },
			func(n *Categorie, e *Categorie) { n.Edges.Enfants = append(n.Edges.Enfants, e) }); err != nil {
			return nil, err
		}
	}
	return nodes, nil
}

func (_q *CategorieQuery) loadParent(ctx context.Context, query *CategorieQuery, nodes []*Categorie, init func(*Categorie), assign func(*Categorie, *Categorie)) error {
	ids := make([]uuid.UUID, 0, len(nodes))
	nodeids := make(map[uuid.UUID][]*Categorie)
	for i := range nodes {
		if nodes[i].ParentID == nil {
			continue
		}
		fk := *nodes[i].ParentID
		if _, ok := nodeids[fk]; !ok {
			ids = append(ids, fk)
		}
		nodeids[fk] = append(nodeids[fk], nodes[i])
	}
	if len(ids) == 0 {
		return nil
	}
	query.Where(categorie.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 "parent_id" returned %v`, n.ID)
		}
		for i := range nodes {
			assign(nodes[i], n)
		}
	}
	return nil
}
func (_q *CategorieQuery) loadEnfants(ctx context.Context, query *CategorieQuery, nodes []*Categorie, init func(*Categorie), assign func(*Categorie, *Categorie)) error {
	fks := make([]driver.Value, 0, len(nodes))
	nodeids := make(map[uuid.UUID]*Categorie)
	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(categorie.FieldParentID)
	}
	query.Where(predicate.Categorie(func(s *sql.Selector) {
		s.Where(sql.InValues(s.C(categorie.EnfantsColumn), fks...))
	}))
	neighbors, err := query.All(ctx)
	if err != nil {
		return err
	}
	for _, n := range neighbors {
		fk := n.ParentID
		if fk == nil {
			return fmt.Errorf(`foreign-key "parent_id" is nil for node %v`, n.ID)
		}
		node, ok := nodeids[*fk]
		if !ok {
			return fmt.Errorf(`unexpected referenced foreign-key "parent_id" returned %v for node %v`, *fk, n.ID)
		}
		assign(node, n)
	}
	return nil
}

func (_q *CategorieQuery) 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 *CategorieQuery) querySpec() *sqlgraph.QuerySpec {
	_spec := sqlgraph.NewQuerySpec(categorie.Table, categorie.Columns, sqlgraph.NewFieldSpec(categorie.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, categorie.FieldID)
		for i := range fields {
			if fields[i] != categorie.FieldID {
				_spec.Node.Columns = append(_spec.Node.Columns, fields[i])
			}
		}
		if _q.withParent != nil {
			_spec.Node.AddColumnOnce(categorie.FieldParentID)
		}
	}
	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 *CategorieQuery) sqlQuery(ctx context.Context) *sql.Selector {
	builder := sql.Dialect(_q.driver.Dialect())
	t1 := builder.Table(categorie.Table)
	columns := _q.ctx.Fields
	if len(columns) == 0 {
		columns = categorie.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
}

// CategorieGroupBy is the group-by builder for Categorie entities.
type CategorieGroupBy struct {
	selector
	build *CategorieQuery
}

// Aggregate adds the given aggregation functions to the group-by query.
func (_g *CategorieGroupBy) Aggregate(fns ...AggregateFunc) *CategorieGroupBy {
	_g.fns = append(_g.fns, fns...)
	return _g
}

// Scan applies the selector query and scans the result into the given value.
func (_g *CategorieGroupBy) 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[*CategorieQuery, *CategorieGroupBy](ctx, _g.build, _g, _g.build.inters, v)
}

func (_g *CategorieGroupBy) sqlScan(ctx context.Context, root *CategorieQuery, 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)
}

// CategorieSelect is the builder for selecting fields of Categorie entities.
type CategorieSelect struct {
	*CategorieQuery
	selector
}

// Aggregate adds the given aggregation functions to the selector query.
func (_s *CategorieSelect) Aggregate(fns ...AggregateFunc) *CategorieSelect {
	_s.fns = append(_s.fns, fns...)
	return _s
}

// Scan applies the selector query and scans the result into the given value.
func (_s *CategorieSelect) 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[*CategorieQuery, *CategorieSelect](ctx, _s.CategorieQuery, _s, _s.inters, v)
}

func (_s *CategorieSelect) sqlScan(ctx context.Context, root *CategorieQuery, 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)
}