snapshot of https://github.com/ent/ent.git (master, 2026-09-15; blobs > 131072B omitted)
This commit is contained in:
439
entc/integration/edgefield/ent/node/mutation.go
Normal file
439
entc/integration/edgefield/ent/node/mutation.go
Normal file
@@ -0,0 +1,439 @@
|
||||
// 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 node
|
||||
|
||||
import (
|
||||
"context"
|
||||
"fmt"
|
||||
|
||||
"entgo.io/ent"
|
||||
"entgo.io/ent/dialect/sql"
|
||||
"entgo.io/ent/entc/integration/edgefield/ent/predicate"
|
||||
)
|
||||
|
||||
// Mutation represents an operation that mutates the Node nodes in the graph.
|
||||
type Mutation struct {
|
||||
op ent.Op
|
||||
typ string
|
||||
value *int
|
||||
addvalue *int
|
||||
clearedFields map[string]struct{}
|
||||
prev *int
|
||||
clearedprev bool
|
||||
next *int
|
||||
clearednext bool
|
||||
predicates []predicate.Node
|
||||
}
|
||||
|
||||
// NewMutation creates a new Mutation for the Node entity.
|
||||
func NewMutation(op ent.Op) *Mutation {
|
||||
return &Mutation{
|
||||
op: op,
|
||||
typ: "Node",
|
||||
clearedFields: make(map[string]struct{}),
|
||||
}
|
||||
}
|
||||
|
||||
// Predicates returns the list of predicates set on the mutation.
|
||||
func (m *Mutation) Predicates() []predicate.Node {
|
||||
return m.predicates
|
||||
}
|
||||
|
||||
// SetValue sets the "value" field.
|
||||
func (m *Mutation) SetValue(i int) {
|
||||
m.value = &i
|
||||
m.addvalue = nil
|
||||
}
|
||||
|
||||
// Value returns the value of the "value" field in the mutation.
|
||||
func (m *Mutation) Value() (r int, exists bool) {
|
||||
v := m.value
|
||||
if v == nil {
|
||||
return
|
||||
}
|
||||
return *v, true
|
||||
}
|
||||
|
||||
// AddValue adds i to the "value" field.
|
||||
func (m *Mutation) AddValue(i int) {
|
||||
if m.addvalue != nil {
|
||||
*m.addvalue += i
|
||||
} else {
|
||||
m.addvalue = &i
|
||||
}
|
||||
}
|
||||
|
||||
// AddedValue returns the value that was added to the "value" field in this mutation.
|
||||
func (m *Mutation) AddedValue() (r int, exists bool) {
|
||||
v := m.addvalue
|
||||
if v == nil {
|
||||
return
|
||||
}
|
||||
return *v, true
|
||||
}
|
||||
|
||||
// ResetValue resets all changes to the "value" field.
|
||||
func (m *Mutation) ResetValue() {
|
||||
m.value = nil
|
||||
m.addvalue = nil
|
||||
}
|
||||
|
||||
// SetPrevID sets the "prev_id" field.
|
||||
func (m *Mutation) SetPrevID(i int) {
|
||||
m.prev = &i
|
||||
}
|
||||
|
||||
// PrevID returns the value of the "prev_id" field in the mutation.
|
||||
func (m *Mutation) PrevID() (r int, exists bool) {
|
||||
v := m.prev
|
||||
if v == nil {
|
||||
return
|
||||
}
|
||||
return *v, true
|
||||
}
|
||||
|
||||
// ClearPrevID clears the value of the "prev_id" field.
|
||||
func (m *Mutation) ClearPrevID() {
|
||||
m.prev = nil
|
||||
m.clearedFields[FieldPrevID] = struct{}{}
|
||||
}
|
||||
|
||||
// PrevIDCleared returns if the "prev_id" field was cleared in this mutation.
|
||||
func (m *Mutation) PrevIDCleared() bool {
|
||||
_, ok := m.clearedFields[FieldPrevID]
|
||||
return ok
|
||||
}
|
||||
|
||||
// ResetPrevID resets all changes to the "prev_id" field.
|
||||
func (m *Mutation) ResetPrevID() {
|
||||
m.prev = nil
|
||||
delete(m.clearedFields, FieldPrevID)
|
||||
}
|
||||
|
||||
// ClearPrev clears the "prev" edge to the Node entity.
|
||||
func (m *Mutation) ClearPrev() {
|
||||
m.clearedprev = true
|
||||
m.clearedFields[FieldPrevID] = struct{}{}
|
||||
}
|
||||
|
||||
// PrevCleared reports if the "prev" edge to the Node entity was cleared.
|
||||
func (m *Mutation) PrevCleared() bool {
|
||||
return m.PrevIDCleared() || m.clearedprev
|
||||
}
|
||||
|
||||
// PrevIDs returns the "prev" edge IDs in the mutation.
|
||||
// Note that IDs always returns len(IDs) <= 1 for unique edges, and you should use
|
||||
// PrevID instead. It exists only for internal usage by the builders.
|
||||
func (m *Mutation) PrevIDs() (ids []int) {
|
||||
if id := m.prev; id != nil {
|
||||
ids = append(ids, *id)
|
||||
}
|
||||
return
|
||||
}
|
||||
|
||||
// ResetPrev resets all changes to the "prev" edge.
|
||||
func (m *Mutation) ResetPrev() {
|
||||
m.prev = nil
|
||||
m.clearedprev = false
|
||||
}
|
||||
|
||||
// SetNextID sets the "next" edge to the Node entity by id.
|
||||
func (m *Mutation) SetNextID(id int) {
|
||||
m.next = &id
|
||||
}
|
||||
|
||||
// ClearNext clears the "next" edge to the Node entity.
|
||||
func (m *Mutation) ClearNext() {
|
||||
m.clearednext = true
|
||||
}
|
||||
|
||||
// NextCleared reports if the "next" edge to the Node entity was cleared.
|
||||
func (m *Mutation) NextCleared() bool {
|
||||
return m.clearednext
|
||||
}
|
||||
|
||||
// NextID returns the "next" edge ID in the mutation.
|
||||
func (m *Mutation) NextID() (id int, exists bool) {
|
||||
if m.next != nil {
|
||||
return *m.next, true
|
||||
}
|
||||
return
|
||||
}
|
||||
|
||||
// NextIDs returns the "next" edge IDs in the mutation.
|
||||
// Note that IDs always returns len(IDs) <= 1 for unique edges, and you should use
|
||||
// NextID instead. It exists only for internal usage by the builders.
|
||||
func (m *Mutation) NextIDs() (ids []int) {
|
||||
if id := m.next; id != nil {
|
||||
ids = append(ids, *id)
|
||||
}
|
||||
return
|
||||
}
|
||||
|
||||
// ResetNext resets all changes to the "next" edge.
|
||||
func (m *Mutation) ResetNext() {
|
||||
m.next = nil
|
||||
m.clearednext = false
|
||||
}
|
||||
|
||||
// Where appends a list predicates to the Mutation builder.
|
||||
func (m *Mutation) Where(ps ...predicate.Node) {
|
||||
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.Node, 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 (Node).
|
||||
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, 2)
|
||||
if m.value != nil {
|
||||
fields = append(fields, FieldValue)
|
||||
}
|
||||
if m.prev != nil {
|
||||
fields = append(fields, FieldPrevID)
|
||||
}
|
||||
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 FieldValue:
|
||||
return m.Value()
|
||||
case FieldPrevID:
|
||||
return m.PrevID()
|
||||
}
|
||||
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 Node 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 FieldValue:
|
||||
v, ok := value.(int)
|
||||
if !ok {
|
||||
return fmt.Errorf("unexpected type %T for field %s", value, name)
|
||||
}
|
||||
m.SetValue(v)
|
||||
return nil
|
||||
case FieldPrevID:
|
||||
v, ok := value.(int)
|
||||
if !ok {
|
||||
return fmt.Errorf("unexpected type %T for field %s", value, name)
|
||||
}
|
||||
m.SetPrevID(v)
|
||||
return nil
|
||||
}
|
||||
return fmt.Errorf("unknown Node 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.addvalue != nil {
|
||||
fields = append(fields, FieldValue)
|
||||
}
|
||||
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 FieldValue:
|
||||
return m.AddedValue()
|
||||
}
|
||||
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 FieldValue:
|
||||
v, ok := value.(int)
|
||||
if !ok {
|
||||
return fmt.Errorf("unexpected type %T for field %s", value, name)
|
||||
}
|
||||
m.AddValue(v)
|
||||
return nil
|
||||
}
|
||||
return fmt.Errorf("unknown Node 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(FieldPrevID) {
|
||||
fields = append(fields, FieldPrevID)
|
||||
}
|
||||
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 FieldPrevID:
|
||||
m.ClearPrevID()
|
||||
return nil
|
||||
}
|
||||
return fmt.Errorf("unknown Node 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 FieldValue:
|
||||
m.ResetValue()
|
||||
return nil
|
||||
case FieldPrevID:
|
||||
m.ResetPrevID()
|
||||
return nil
|
||||
}
|
||||
return fmt.Errorf("unknown Node field %s", name)
|
||||
}
|
||||
|
||||
// AddedEdges returns all edge names that were set/added in this mutation.
|
||||
func (m *Mutation) AddedEdges() []string {
|
||||
edges := make([]string, 0, 2)
|
||||
if m.prev != nil {
|
||||
edges = append(edges, EdgePrev)
|
||||
}
|
||||
if m.next != nil {
|
||||
edges = append(edges, EdgeNext)
|
||||
}
|
||||
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 EdgePrev:
|
||||
if id := m.prev; id != nil {
|
||||
return []ent.Value{*id}
|
||||
}
|
||||
case EdgeNext:
|
||||
if id := m.next; 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, 2)
|
||||
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, 2)
|
||||
if m.clearedprev {
|
||||
edges = append(edges, EdgePrev)
|
||||
}
|
||||
if m.clearednext {
|
||||
edges = append(edges, EdgeNext)
|
||||
}
|
||||
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 EdgePrev:
|
||||
return m.clearedprev
|
||||
case EdgeNext:
|
||||
return m.clearednext
|
||||
}
|
||||
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 EdgePrev:
|
||||
m.ClearPrev()
|
||||
return nil
|
||||
case EdgeNext:
|
||||
m.ClearNext()
|
||||
return nil
|
||||
}
|
||||
return fmt.Errorf("unknown Node 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 EdgePrev:
|
||||
m.ResetPrev()
|
||||
return nil
|
||||
case EdgeNext:
|
||||
m.ResetNext()
|
||||
return nil
|
||||
}
|
||||
return fmt.Errorf("unknown Node edge %s", name)
|
||||
}
|
||||
Reference in New Issue
Block a user