snapshot of https://github.com/ent/ent.git (master, 2026-09-15; blobs > 131072B omitted)

entc/integration/customid/ent/car/car.go

@@ -0,0 +1,111 @@
+// 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 car
+
+import (
+	"entgo.io/ent/dialect/sql"
+	"entgo.io/ent/dialect/sql/sqlgraph"
+)
+
+const (
+	// Label holds the string label denoting the car type in the database.
+	Label = "car"
+	// FieldID holds the string denoting the id field in the database.
+	FieldID = "id"
+	// FieldBeforeID holds the string denoting the before_id field in the database.
+	FieldBeforeID = "before_id"
+	// FieldAfterID holds the string denoting the after_id field in the database.
+	FieldAfterID = "after_id"
+	// FieldModel holds the string denoting the model field in the database.
+	FieldModel = "model"
+	// EdgeOwner holds the string denoting the owner edge name in mutations.
+	EdgeOwner = "owner"
+	// Table holds the table name of the car in the database.
+	Table = "cars"
+	// OwnerTable is the table that holds the owner relation/edge.
+	OwnerTable = "cars"
+	// OwnerInverseTable is the table name for the Pet entity.
+	// It exists in this package in order to avoid circular dependency with the "pet" package.
+	OwnerInverseTable = "pets"
+	// OwnerColumn is the table column denoting the owner relation/edge.
+	OwnerColumn = "pet_cars"
+)
+
+// Columns holds all SQL columns for car fields.
+var Columns = []string{
+	FieldID,
+	FieldBeforeID,
+	FieldAfterID,
+	FieldModel,
+}
+
+// ForeignKeys holds the SQL foreign-keys that are owned by the "cars"
+// table and are not defined as standalone fields in the schema.
+var ForeignKeys = []string{
+	"pet_cars",
+}
+
+// ValidColumn reports if the column name is valid (part of the table columns).
+func ValidColumn(column string) bool {
+	for i := range Columns {
+		if column == Columns[i] {
+			return true
+		}
+	}
+	for i := range ForeignKeys {
+		if column == ForeignKeys[i] {
+			return true
+		}
+	}
+	return false
+}
+
+var (
+	// BeforeIDValidator is a validator for the "before_id" field. It is called by the builders before save.
+	BeforeIDValidator func(float64) error
+	// AfterIDValidator is a validator for the "after_id" field. It is called by the builders before save.
+	AfterIDValidator func(float64) error
+	// IDValidator is a validator for the "id" field. It is called by the builders before save.
+	IDValidator func(int) error
+)
+
+// OrderOption defines the ordering options for the Car queries.
+type OrderOption func(*sql.Selector)
+
+// ByID orders the results by the id field.
+func ByID(opts ...sql.OrderTermOption) OrderOption {
+	return sql.OrderByField(FieldID, opts...).ToFunc()
+}
+
+// ByBeforeID orders the results by the before_id field.
+func ByBeforeID(opts ...sql.OrderTermOption) OrderOption {
+	return sql.OrderByField(FieldBeforeID, opts...).ToFunc()
+}
+
+// ByAfterID orders the results by the after_id field.
+func ByAfterID(opts ...sql.OrderTermOption) OrderOption {
+	return sql.OrderByField(FieldAfterID, opts...).ToFunc()
+}
+
+// ByModel orders the results by the model field.
+func ByModel(opts ...sql.OrderTermOption) OrderOption {
+	return sql.OrderByField(FieldModel, opts...).ToFunc()
+}
+
+// ByOwnerField orders the results by owner field.
+func ByOwnerField(field string, opts ...sql.OrderTermOption) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborTerms(s, newOwnerStep(), sql.OrderByField(field, opts...))
+	}
+}
+func newOwnerStep() *sqlgraph.Step {
+	return sqlgraph.NewStep(
+		sqlgraph.From(Table, FieldID),
+		sqlgraph.To(OwnerInverseTable, FieldID),
+		sqlgraph.Edge(sqlgraph.M2O, true, OwnerTable, OwnerColumn),
+	)
+}

entc/integration/customid/ent/car/mutation.go

@@ -0,0 +1,482 @@
+// 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 car
+
+import (
+	"context"
+	"fmt"
+
+	"entgo.io/ent"
+	"entgo.io/ent/dialect/sql"
+	"entgo.io/ent/entc/integration/customid/ent/predicate"
+)
+
+// Mutation represents an operation that mutates the Car nodes in the graph.
+type Mutation struct {
+	op            ent.Op
+	typ           string
+	before_id     *float64
+	addbefore_id  *float64
+	after_id      *float64
+	addafter_id   *float64
+	model         *string
+	clearedFields map[string]struct{}
+	owner         *string
+	clearedowner  bool
+	predicates    []predicate.Car
+}
+
+// NewMutation creates a new Mutation for the Car entity.
+func NewMutation(op ent.Op) *Mutation {
+	return &Mutation{
+		op:            op,
+		typ:           "Car",
+		clearedFields: make(map[string]struct{}),
+	}
+}
+
+// Predicates returns the list of predicates set on the mutation.
+func (m *Mutation) Predicates() []predicate.Car {
+	return m.predicates
+}
+
+// SetBeforeID sets the "before_id" field.
+func (m *Mutation) SetBeforeID(f float64) {
+	m.before_id = &f
+	m.addbefore_id = nil
+}
+
+// BeforeID returns the value of the "before_id" field in the mutation.
+func (m *Mutation) BeforeID() (r float64, exists bool) {
+	v := m.before_id
+	if v == nil {
+		return
+	}
+	return *v, true
+}
+
+// AddBeforeID adds f to the "before_id" field.
+func (m *Mutation) AddBeforeID(f float64) {
+	if m.addbefore_id != nil {
+		*m.addbefore_id += f
+	} else {
+		m.addbefore_id = &f
+	}
+}
+
+// AddedBeforeID returns the value that was added to the "before_id" field in this mutation.
+func (m *Mutation) AddedBeforeID() (r float64, exists bool) {
+	v := m.addbefore_id
+	if v == nil {
+		return
+	}
+	return *v, true
+}
+
+// ClearBeforeID clears the value of the "before_id" field.
+func (m *Mutation) ClearBeforeID() {
+	m.before_id = nil
+	m.addbefore_id = nil
+	m.clearedFields[FieldBeforeID] = struct{}{}
+}
+
+// BeforeIDCleared returns if the "before_id" field was cleared in this mutation.
+func (m *Mutation) BeforeIDCleared() bool {
+	_, ok := m.clearedFields[FieldBeforeID]
+	return ok
+}
+
+// ResetBeforeID resets all changes to the "before_id" field.
+func (m *Mutation) ResetBeforeID() {
+	m.before_id = nil
+	m.addbefore_id = nil
+	delete(m.clearedFields, FieldBeforeID)
+}
+
+// SetAfterID sets the "after_id" field.
+func (m *Mutation) SetAfterID(f float64) {
+	m.after_id = &f
+	m.addafter_id = nil
+}
+
+// AfterID returns the value of the "after_id" field in the mutation.
+func (m *Mutation) AfterID() (r float64, exists bool) {
+	v := m.after_id
+	if v == nil {
+		return
+	}
+	return *v, true
+}
+
+// AddAfterID adds f to the "after_id" field.
+func (m *Mutation) AddAfterID(f float64) {
+	if m.addafter_id != nil {
+		*m.addafter_id += f
+	} else {
+		m.addafter_id = &f
+	}
+}
+
+// AddedAfterID returns the value that was added to the "after_id" field in this mutation.
+func (m *Mutation) AddedAfterID() (r float64, exists bool) {
+	v := m.addafter_id
+	if v == nil {
+		return
+	}
+	return *v, true
+}
+
+// ClearAfterID clears the value of the "after_id" field.
+func (m *Mutation) ClearAfterID() {
+	m.after_id = nil
+	m.addafter_id = nil
+	m.clearedFields[FieldAfterID] = struct{}{}
+}
+
+// AfterIDCleared returns if the "after_id" field was cleared in this mutation.
+func (m *Mutation) AfterIDCleared() bool {
+	_, ok := m.clearedFields[FieldAfterID]
+	return ok
+}
+
+// ResetAfterID resets all changes to the "after_id" field.
+func (m *Mutation) ResetAfterID() {
+	m.after_id = nil
+	m.addafter_id = nil
+	delete(m.clearedFields, FieldAfterID)
+}
+
+// SetModel sets the "model" field.
+func (m *Mutation) SetModel(s string) {
+	m.model = &s
+}
+
+// Model returns the value of the "model" field in the mutation.
+func (m *Mutation) Model() (r string, exists bool) {
+	v := m.model
+	if v == nil {
+		return
+	}
+	return *v, true
+}
+
+// ResetModel resets all changes to the "model" field.
+func (m *Mutation) ResetModel() {
+	m.model = nil
+}
+
+// SetOwnerID sets the "owner" edge to the Pet entity by id.
+func (m *Mutation) SetOwnerID(id string) {
+	m.owner = &id
+}
+
+// ClearOwner clears the "owner" edge to the Pet entity.
+func (m *Mutation) ClearOwner() {
+	m.clearedowner = true
+}
+
+// OwnerCleared reports if the "owner" edge to the Pet entity was cleared.
+func (m *Mutation) OwnerCleared() bool {
+	return m.clearedowner
+}
+
+// OwnerID returns the "owner" edge ID in the mutation.
+func (m *Mutation) OwnerID() (id string, exists bool) {
+	if m.owner != nil {
+		return *m.owner, true
+	}
+	return
+}
+
+// OwnerIDs returns the "owner" edge IDs in the mutation.
+// Note that IDs always returns len(IDs) <= 1 for unique edges, and you should use
+// OwnerID instead. It exists only for internal usage by the builders.
+func (m *Mutation) OwnerIDs() (ids []string) {
+	if id := m.owner; id != nil {
+		ids = append(ids, *id)
+	}
+	return
+}
+
+// ResetOwner resets all changes to the "owner" edge.
+func (m *Mutation) ResetOwner() {
+	m.owner = nil
+	m.clearedowner = false
+}
+
+// Where appends a list predicates to the Mutation builder.
+func (m *Mutation) Where(ps ...predicate.Car) {
+	m.predicates = append(m.predicates, ps...)
+}
+
+// WhereP appends storage-level predicates to the Mutation builder. Using this method,
+// users can use type-assertion to append predicates that do not depend on any generated package.
+func (m *Mutation) WhereP(ps ...func(*sql.Selector)) {
+	p := make([]predicate.Car, len(ps))
+	for i := range ps {
+		p[i] = ps[i]
+	}
+	m.Where(p...)
+}
+
+// Op returns the operation name.
+func (m *Mutation) Op() ent.Op {
+	return m.op
+}
+
+// SetOp allows setting the mutation operation.
+func (m *Mutation) SetOp(op ent.Op) {
+	m.op = op
+}
+
+// Type returns the node type of this mutation (Car).
+func (m *Mutation) Type() string {
+	return m.typ
+}
+
+// Fields returns all fields that were changed during this mutation. Note that in
+// order to get all numeric fields that were incremented/decremented, call
+// AddedFields().
+func (m *Mutation) Fields() []string {
+	fields := make([]string, 0, 3)
+	if m.before_id != nil {
+		fields = append(fields, FieldBeforeID)
+	}
+	if m.after_id != nil {
+		fields = append(fields, FieldAfterID)
+	}
+	if m.model != nil {
+		fields = append(fields, FieldModel)
+	}
+	return fields
+}
+
+// Field returns the value of a field with the given name. The second boolean
+// return value indicates that this field was not set, or was not defined in the
+// schema.
+func (m *Mutation) Field(name string) (ent.Value, bool) {
+	switch name {
+	case FieldBeforeID:
+		return m.BeforeID()
+	case FieldAfterID:
+		return m.AfterID()
+	case FieldModel:
+		return m.Model()
+	}
+	return nil, false
+}
+
+// OldField returns the old value of the field from the database. An error is
+// returned if the mutation operation is not UpdateOne, or the query to the
+// database failed.
+func (m *Mutation) OldField(ctx context.Context, name string) (ent.Value, error) {
+	return nil, fmt.Errorf("unknown Car field %s", name)
+}
+
+// SetField sets the value of a field with the given name. It returns an error if
+// the field is not defined in the schema, or if the type mismatched the field
+// type.
+func (m *Mutation) SetField(name string, value ent.Value) error {
+	switch name {
+	case FieldBeforeID:
+		v, ok := value.(float64)
+		if !ok {
+			return fmt.Errorf("unexpected type %T for field %s", value, name)
+		}
+		m.SetBeforeID(v)
+		return nil
+	case FieldAfterID:
+		v, ok := value.(float64)
+		if !ok {
+			return fmt.Errorf("unexpected type %T for field %s", value, name)
+		}
+		m.SetAfterID(v)
+		return nil
+	case FieldModel:
+		v, ok := value.(string)
+		if !ok {
+			return fmt.Errorf("unexpected type %T for field %s", value, name)
+		}
+		m.SetModel(v)
+		return nil
+	}
+	return fmt.Errorf("unknown Car field %s", name)
+}
+
+// AddedFields returns all numeric fields that were incremented/decremented during
+// this mutation.
+func (m *Mutation) AddedFields() []string {
+	var fields []string
+	if m.addbefore_id != nil {
+		fields = append(fields, FieldBeforeID)
+	}
+	if m.addafter_id != nil {
+		fields = append(fields, FieldAfterID)
+	}
+	return fields
+}
+
+// AddedField returns the numeric value that was incremented/decremented on a field
+// with the given name. The second boolean return value indicates that this field
+// was not set, or was not defined in the schema.
+func (m *Mutation) AddedField(name string) (ent.Value, bool) {
+	switch name {
+	case FieldBeforeID:
+		return m.AddedBeforeID()
+	case FieldAfterID:
+		return m.AddedAfterID()
+	}
+	return nil, false
+}
+
+// AddField adds the value to the field with the given name. It returns an error if
+// the field is not defined in the schema, or if the type mismatched the field
+// type.
+func (m *Mutation) AddField(name string, value ent.Value) error {
+	switch name {
+	case FieldBeforeID:
+		v, ok := value.(float64)
+		if !ok {
+			return fmt.Errorf("unexpected type %T for field %s", value, name)
+		}
+		m.AddBeforeID(v)
+		return nil
+	case FieldAfterID:
+		v, ok := value.(float64)
+		if !ok {
+			return fmt.Errorf("unexpected type %T for field %s", value, name)
+		}
+		m.AddAfterID(v)
+		return nil
+	}
+	return fmt.Errorf("unknown Car numeric field %s", name)
+}
+
+// ClearedFields returns all nullable fields that were cleared during this
+// mutation.
+func (m *Mutation) ClearedFields() []string {
+	var fields []string
+	if m.FieldCleared(FieldBeforeID) {
+		fields = append(fields, FieldBeforeID)
+	}
+	if m.FieldCleared(FieldAfterID) {
+		fields = append(fields, FieldAfterID)
+	}
+	return fields
+}
+
+// FieldCleared returns a boolean indicating if a field with the given name was
+// cleared in this mutation.
+func (m *Mutation) FieldCleared(name string) bool {
+	_, ok := m.clearedFields[name]
+	return ok
+}
+
+// ClearField clears the value of the field with the given name. It returns an
+// error if the field is not defined in the schema.
+func (m *Mutation) ClearField(name string) error {
+	switch name {
+	case FieldBeforeID:
+		m.ClearBeforeID()
+		return nil
+	case FieldAfterID:
+		m.ClearAfterID()
+		return nil
+	}
+	return fmt.Errorf("unknown Car nullable field %s", name)
+}
+
+// ResetField resets all changes in the mutation for the field with the given name.
+// It returns an error if the field is not defined in the schema.
+func (m *Mutation) ResetField(name string) error {
+	switch name {
+	case FieldBeforeID:
+		m.ResetBeforeID()
+		return nil
+	case FieldAfterID:
+		m.ResetAfterID()
+		return nil
+	case FieldModel:
+		m.ResetModel()
+		return nil
+	}
+	return fmt.Errorf("unknown Car field %s", name)
+}
+
+// AddedEdges returns all edge names that were set/added in this mutation.
+func (m *Mutation) AddedEdges() []string {
+	edges := make([]string, 0, 1)
+	if m.owner != nil {
+		edges = append(edges, EdgeOwner)
+	}
+	return edges
+}
+
+// AddedIDs returns all IDs (to other nodes) that were added for the given edge
+// name in this mutation.
+func (m *Mutation) AddedIDs(name string) []ent.Value {
+	switch name {
+	case EdgeOwner:
+		if id := m.owner; id != nil {
+			return []ent.Value{*id}
+		}
+	}
+	return nil
+}
+
+// RemovedEdges returns all edge names that were removed in this mutation.
+func (m *Mutation) RemovedEdges() []string {
+	edges := make([]string, 0, 1)
+	return edges
+}
+
+// RemovedIDs returns all IDs (to other nodes) that were removed for the edge with
+// the given name in this mutation.
+func (m *Mutation) RemovedIDs(name string) []ent.Value {
+	return nil
+}
+
+// ClearedEdges returns all edge names that were cleared in this mutation.
+func (m *Mutation) ClearedEdges() []string {
+	edges := make([]string, 0, 1)
+	if m.clearedowner {
+		edges = append(edges, EdgeOwner)
+	}
+	return edges
+}
+
+// EdgeCleared returns a boolean which indicates if the edge with the given name
+// was cleared in this mutation.
+func (m *Mutation) EdgeCleared(name string) bool {
+	switch name {
+	case EdgeOwner:
+		return m.clearedowner
+	}
+	return false
+}
+
+// ClearEdge clears the value of the edge with the given name. It returns an error
+// if that edge is not defined in the schema.
+func (m *Mutation) ClearEdge(name string) error {
+	switch name {
+	case EdgeOwner:
+		m.ClearOwner()
+		return nil
+	}
+	return fmt.Errorf("unknown Car unique edge %s", name)
+}
+
+// ResetEdge resets all changes to the edge with the given name in this mutation.
+// It returns an error if the edge is not defined in the schema.
+func (m *Mutation) ResetEdge(name string) error {
+	switch name {
+	case EdgeOwner:
+		m.ResetOwner()
+		return nil
+	}
+	return fmt.Errorf("unknown Car edge %s", name)
+}

entc/integration/customid/ent/car/where.go

@@ -0,0 +1,276 @@
+// 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 car
+
+import (
+	"entgo.io/ent/dialect/sql"
+	"entgo.io/ent/dialect/sql/sqlgraph"
+	"entgo.io/ent/entc/integration/customid/ent/predicate"
+)
+
+// ID filters vertices based on their ID field.
+func ID(id int) predicate.Car {
+	return predicate.Car(sql.FieldEQ(FieldID, id))
+}
+
+// IDEQ applies the EQ predicate on the ID field.
+func IDEQ(id int) predicate.Car {
+	return predicate.Car(sql.FieldEQ(FieldID, id))
+}
+
+// IDNEQ applies the NEQ predicate on the ID field.
+func IDNEQ(id int) predicate.Car {
+	return predicate.Car(sql.FieldNEQ(FieldID, id))
+}
+
+// IDIn applies the In predicate on the ID field.
+func IDIn(ids ...int) predicate.Car {
+	return predicate.Car(sql.FieldIn(FieldID, ids...))
+}
+
+// IDNotIn applies the NotIn predicate on the ID field.
+func IDNotIn(ids ...int) predicate.Car {
+	return predicate.Car(sql.FieldNotIn(FieldID, ids...))
+}
+
+// IDGT applies the GT predicate on the ID field.
+func IDGT(id int) predicate.Car {
+	return predicate.Car(sql.FieldGT(FieldID, id))
+}
+
+// IDGTE applies the GTE predicate on the ID field.
+func IDGTE(id int) predicate.Car {
+	return predicate.Car(sql.FieldGTE(FieldID, id))
+}
+
+// IDLT applies the LT predicate on the ID field.
+func IDLT(id int) predicate.Car {
+	return predicate.Car(sql.FieldLT(FieldID, id))
+}
+
+// IDLTE applies the LTE predicate on the ID field.
+func IDLTE(id int) predicate.Car {
+	return predicate.Car(sql.FieldLTE(FieldID, id))
+}
+
+// BeforeID applies equality check predicate on the "before_id" field. It's identical to BeforeIDEQ.
+func BeforeID(v float64) predicate.Car {
+	return predicate.Car(sql.FieldEQ(FieldBeforeID, v))
+}
+
+// AfterID applies equality check predicate on the "after_id" field. It's identical to AfterIDEQ.
+func AfterID(v float64) predicate.Car {
+	return predicate.Car(sql.FieldEQ(FieldAfterID, v))
+}
+
+// Model applies equality check predicate on the "model" field. It's identical to ModelEQ.
+func Model(v string) predicate.Car {
+	return predicate.Car(sql.FieldEQ(FieldModel, v))
+}
+
+// BeforeIDEQ applies the EQ predicate on the "before_id" field.
+func BeforeIDEQ(v float64) predicate.Car {
+	return predicate.Car(sql.FieldEQ(FieldBeforeID, v))
+}
+
+// BeforeIDNEQ applies the NEQ predicate on the "before_id" field.
+func BeforeIDNEQ(v float64) predicate.Car {
+	return predicate.Car(sql.FieldNEQ(FieldBeforeID, v))
+}
+
+// BeforeIDIn applies the In predicate on the "before_id" field.
+func BeforeIDIn(vs ...float64) predicate.Car {
+	return predicate.Car(sql.FieldIn(FieldBeforeID, vs...))
+}
+
+// BeforeIDNotIn applies the NotIn predicate on the "before_id" field.
+func BeforeIDNotIn(vs ...float64) predicate.Car {
+	return predicate.Car(sql.FieldNotIn(FieldBeforeID, vs...))
+}
+
+// BeforeIDGT applies the GT predicate on the "before_id" field.
+func BeforeIDGT(v float64) predicate.Car {
+	return predicate.Car(sql.FieldGT(FieldBeforeID, v))
+}
+
+// BeforeIDGTE applies the GTE predicate on the "before_id" field.
+func BeforeIDGTE(v float64) predicate.Car {
+	return predicate.Car(sql.FieldGTE(FieldBeforeID, v))
+}
+
+// BeforeIDLT applies the LT predicate on the "before_id" field.
+func BeforeIDLT(v float64) predicate.Car {
+	return predicate.Car(sql.FieldLT(FieldBeforeID, v))
+}
+
+// BeforeIDLTE applies the LTE predicate on the "before_id" field.
+func BeforeIDLTE(v float64) predicate.Car {
+	return predicate.Car(sql.FieldLTE(FieldBeforeID, v))
+}
+
+// BeforeIDIsNil applies the IsNil predicate on the "before_id" field.
+func BeforeIDIsNil() predicate.Car {
+	return predicate.Car(sql.FieldIsNull(FieldBeforeID))
+}
+
+// BeforeIDNotNil applies the NotNil predicate on the "before_id" field.
+func BeforeIDNotNil() predicate.Car {
+	return predicate.Car(sql.FieldNotNull(FieldBeforeID))
+}
+
+// AfterIDEQ applies the EQ predicate on the "after_id" field.
+func AfterIDEQ(v float64) predicate.Car {
+	return predicate.Car(sql.FieldEQ(FieldAfterID, v))
+}
+
+// AfterIDNEQ applies the NEQ predicate on the "after_id" field.
+func AfterIDNEQ(v float64) predicate.Car {
+	return predicate.Car(sql.FieldNEQ(FieldAfterID, v))
+}
+
+// AfterIDIn applies the In predicate on the "after_id" field.
+func AfterIDIn(vs ...float64) predicate.Car {
+	return predicate.Car(sql.FieldIn(FieldAfterID, vs...))
+}
+
+// AfterIDNotIn applies the NotIn predicate on the "after_id" field.
+func AfterIDNotIn(vs ...float64) predicate.Car {
+	return predicate.Car(sql.FieldNotIn(FieldAfterID, vs...))
+}
+
+// AfterIDGT applies the GT predicate on the "after_id" field.
+func AfterIDGT(v float64) predicate.Car {
+	return predicate.Car(sql.FieldGT(FieldAfterID, v))
+}
+
+// AfterIDGTE applies the GTE predicate on the "after_id" field.
+func AfterIDGTE(v float64) predicate.Car {
+	return predicate.Car(sql.FieldGTE(FieldAfterID, v))
+}
+
+// AfterIDLT applies the LT predicate on the "after_id" field.
+func AfterIDLT(v float64) predicate.Car {
+	return predicate.Car(sql.FieldLT(FieldAfterID, v))
+}
+
+// AfterIDLTE applies the LTE predicate on the "after_id" field.
+func AfterIDLTE(v float64) predicate.Car {
+	return predicate.Car(sql.FieldLTE(FieldAfterID, v))
+}
+
+// AfterIDIsNil applies the IsNil predicate on the "after_id" field.
+func AfterIDIsNil() predicate.Car {
+	return predicate.Car(sql.FieldIsNull(FieldAfterID))
+}
+
+// AfterIDNotNil applies the NotNil predicate on the "after_id" field.
+func AfterIDNotNil() predicate.Car {
+	return predicate.Car(sql.FieldNotNull(FieldAfterID))
+}
+
+// ModelEQ applies the EQ predicate on the "model" field.
+func ModelEQ(v string) predicate.Car {
+	return predicate.Car(sql.FieldEQ(FieldModel, v))
+}
+
+// ModelNEQ applies the NEQ predicate on the "model" field.
+func ModelNEQ(v string) predicate.Car {
+	return predicate.Car(sql.FieldNEQ(FieldModel, v))
+}
+
+// ModelIn applies the In predicate on the "model" field.
+func ModelIn(vs ...string) predicate.Car {
+	return predicate.Car(sql.FieldIn(FieldModel, vs...))
+}
+
+// ModelNotIn applies the NotIn predicate on the "model" field.
+func ModelNotIn(vs ...string) predicate.Car {
+	return predicate.Car(sql.FieldNotIn(FieldModel, vs...))
+}
+
+// ModelGT applies the GT predicate on the "model" field.
+func ModelGT(v string) predicate.Car {
+	return predicate.Car(sql.FieldGT(FieldModel, v))
+}
+
+// ModelGTE applies the GTE predicate on the "model" field.
+func ModelGTE(v string) predicate.Car {
+	return predicate.Car(sql.FieldGTE(FieldModel, v))
+}
+
+// ModelLT applies the LT predicate on the "model" field.
+func ModelLT(v string) predicate.Car {
+	return predicate.Car(sql.FieldLT(FieldModel, v))
+}
+
+// ModelLTE applies the LTE predicate on the "model" field.
+func ModelLTE(v string) predicate.Car {
+	return predicate.Car(sql.FieldLTE(FieldModel, v))
+}
+
+// ModelContains applies the Contains predicate on the "model" field.
+func ModelContains(v string) predicate.Car {
+	return predicate.Car(sql.FieldContains(FieldModel, v))
+}
+
+// ModelHasPrefix applies the HasPrefix predicate on the "model" field.
+func ModelHasPrefix(v string) predicate.Car {
+	return predicate.Car(sql.FieldHasPrefix(FieldModel, v))
+}
+
+// ModelHasSuffix applies the HasSuffix predicate on the "model" field.
+func ModelHasSuffix(v string) predicate.Car {
+	return predicate.Car(sql.FieldHasSuffix(FieldModel, v))
+}
+
+// ModelEqualFold applies the EqualFold predicate on the "model" field.
+func ModelEqualFold(v string) predicate.Car {
+	return predicate.Car(sql.FieldEqualFold(FieldModel, v))
+}
+
+// ModelContainsFold applies the ContainsFold predicate on the "model" field.
+func ModelContainsFold(v string) predicate.Car {
+	return predicate.Car(sql.FieldContainsFold(FieldModel, v))
+}
+
+// HasOwner applies the HasEdge predicate on the "owner" edge.
+func HasOwner() predicate.Car {
+	return predicate.Car(func(s *sql.Selector) {
+		step := sqlgraph.NewStep(
+			sqlgraph.From(Table, FieldID),
+			sqlgraph.Edge(sqlgraph.M2O, true, OwnerTable, OwnerColumn),
+		)
+		sqlgraph.HasNeighbors(s, step)
+	})
+}
+
+// HasOwnerWith applies the HasEdge predicate on the "owner" edge with a given conditions (other predicates).
+func HasOwnerWith(preds ...predicate.Pet) predicate.Car {
+	return predicate.Car(func(s *sql.Selector) {
+		step := newOwnerStep()
+		sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
+			for _, p := range preds {
+				p(s)
+			}
+		})
+	})
+}
+
+// And groups predicates with the AND operator between them.
+func And(predicates ...predicate.Car) predicate.Car {
+	return predicate.Car(sql.AndPredicates(predicates...))
+}
+
+// Or groups predicates with the OR operator between them.
+func Or(predicates ...predicate.Car) predicate.Car {
+	return predicate.Car(sql.OrPredicates(predicates...))
+}
+
+// Not applies the not operator on the given predicate.
+func Not(p predicate.Car) predicate.Car {
+	return predicate.Car(sql.NotPredicates(p))
+}