mirror of
https://github.com/ent/ent.git
synced 2026-05-24 09:31:56 +03:00
Summary: Pull Request resolved: https://github.com/facebookincubator/ent/pull/130 Reviewed By: alexsn Differential Revision: D18164397 fbshipit-source-id: 2858d69d3ff85c06b51382c01c3d4369ee2c3bdb
481 lines
12 KiB
Go
481 lines
12 KiB
Go
// Copyright (c) Facebook, Inc. and its affiliates. 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 (@generated) by entc, DO NOT EDIT.
|
|
|
|
package ent
|
|
|
|
import (
|
|
"context"
|
|
"errors"
|
|
"fmt"
|
|
|
|
"github.com/facebookincubator/ent/dialect/sql"
|
|
"github.com/facebookincubator/ent/examples/o2orecur/ent/node"
|
|
"github.com/facebookincubator/ent/examples/o2orecur/ent/predicate"
|
|
)
|
|
|
|
// NodeUpdate is the builder for updating Node entities.
|
|
type NodeUpdate struct {
|
|
config
|
|
value *int
|
|
addvalue *int
|
|
prev map[int]struct{}
|
|
next map[int]struct{}
|
|
clearedPrev bool
|
|
clearedNext bool
|
|
predicates []predicate.Node
|
|
}
|
|
|
|
// Where adds a new predicate for the builder.
|
|
func (nu *NodeUpdate) Where(ps ...predicate.Node) *NodeUpdate {
|
|
nu.predicates = append(nu.predicates, ps...)
|
|
return nu
|
|
}
|
|
|
|
// SetValue sets the value field.
|
|
func (nu *NodeUpdate) SetValue(i int) *NodeUpdate {
|
|
nu.value = &i
|
|
nu.addvalue = nil
|
|
return nu
|
|
}
|
|
|
|
// AddValue adds i to value.
|
|
func (nu *NodeUpdate) AddValue(i int) *NodeUpdate {
|
|
if nu.addvalue == nil {
|
|
nu.addvalue = &i
|
|
} else {
|
|
*nu.addvalue += i
|
|
}
|
|
return nu
|
|
}
|
|
|
|
// SetPrevID sets the prev edge to Node by id.
|
|
func (nu *NodeUpdate) SetPrevID(id int) *NodeUpdate {
|
|
if nu.prev == nil {
|
|
nu.prev = make(map[int]struct{})
|
|
}
|
|
nu.prev[id] = struct{}{}
|
|
return nu
|
|
}
|
|
|
|
// SetNillablePrevID sets the prev edge to Node by id if the given value is not nil.
|
|
func (nu *NodeUpdate) SetNillablePrevID(id *int) *NodeUpdate {
|
|
if id != nil {
|
|
nu = nu.SetPrevID(*id)
|
|
}
|
|
return nu
|
|
}
|
|
|
|
// SetPrev sets the prev edge to Node.
|
|
func (nu *NodeUpdate) SetPrev(n *Node) *NodeUpdate {
|
|
return nu.SetPrevID(n.ID)
|
|
}
|
|
|
|
// SetNextID sets the next edge to Node by id.
|
|
func (nu *NodeUpdate) SetNextID(id int) *NodeUpdate {
|
|
if nu.next == nil {
|
|
nu.next = make(map[int]struct{})
|
|
}
|
|
nu.next[id] = struct{}{}
|
|
return nu
|
|
}
|
|
|
|
// SetNillableNextID sets the next edge to Node by id if the given value is not nil.
|
|
func (nu *NodeUpdate) SetNillableNextID(id *int) *NodeUpdate {
|
|
if id != nil {
|
|
nu = nu.SetNextID(*id)
|
|
}
|
|
return nu
|
|
}
|
|
|
|
// SetNext sets the next edge to Node.
|
|
func (nu *NodeUpdate) SetNext(n *Node) *NodeUpdate {
|
|
return nu.SetNextID(n.ID)
|
|
}
|
|
|
|
// ClearPrev clears the prev edge to Node.
|
|
func (nu *NodeUpdate) ClearPrev() *NodeUpdate {
|
|
nu.clearedPrev = true
|
|
return nu
|
|
}
|
|
|
|
// ClearNext clears the next edge to Node.
|
|
func (nu *NodeUpdate) ClearNext() *NodeUpdate {
|
|
nu.clearedNext = true
|
|
return nu
|
|
}
|
|
|
|
// Save executes the query and returns the number of rows/vertices matched by this operation.
|
|
func (nu *NodeUpdate) Save(ctx context.Context) (int, error) {
|
|
if len(nu.prev) > 1 {
|
|
return 0, errors.New("ent: multiple assignments on a unique edge \"prev\"")
|
|
}
|
|
if len(nu.next) > 1 {
|
|
return 0, errors.New("ent: multiple assignments on a unique edge \"next\"")
|
|
}
|
|
return nu.sqlSave(ctx)
|
|
}
|
|
|
|
// SaveX is like Save, but panics if an error occurs.
|
|
func (nu *NodeUpdate) SaveX(ctx context.Context) int {
|
|
affected, err := nu.Save(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return affected
|
|
}
|
|
|
|
// Exec executes the query.
|
|
func (nu *NodeUpdate) Exec(ctx context.Context) error {
|
|
_, err := nu.Save(ctx)
|
|
return err
|
|
}
|
|
|
|
// ExecX is like Exec, but panics if an error occurs.
|
|
func (nu *NodeUpdate) ExecX(ctx context.Context) {
|
|
if err := nu.Exec(ctx); err != nil {
|
|
panic(err)
|
|
}
|
|
}
|
|
|
|
func (nu *NodeUpdate) sqlSave(ctx context.Context) (n int, err error) {
|
|
var (
|
|
builder = sql.Dialect(nu.driver.Dialect())
|
|
selector = builder.Select(node.FieldID).From(builder.Table(node.Table))
|
|
)
|
|
for _, p := range nu.predicates {
|
|
p(selector)
|
|
}
|
|
rows := &sql.Rows{}
|
|
query, args := selector.Query()
|
|
if err = nu.driver.Query(ctx, query, args, rows); err != nil {
|
|
return 0, err
|
|
}
|
|
defer rows.Close()
|
|
var ids []int
|
|
for rows.Next() {
|
|
var id int
|
|
if err := rows.Scan(&id); err != nil {
|
|
return 0, fmt.Errorf("ent: failed reading id: %v", err)
|
|
}
|
|
ids = append(ids, id)
|
|
}
|
|
if len(ids) == 0 {
|
|
return 0, nil
|
|
}
|
|
|
|
tx, err := nu.driver.Tx(ctx)
|
|
if err != nil {
|
|
return 0, err
|
|
}
|
|
var (
|
|
res sql.Result
|
|
updater = builder.Update(node.Table).Where(sql.InInts(node.FieldID, ids...))
|
|
)
|
|
if value := nu.value; value != nil {
|
|
updater.Set(node.FieldValue, *value)
|
|
}
|
|
if value := nu.addvalue; value != nil {
|
|
updater.Add(node.FieldValue, *value)
|
|
}
|
|
if !updater.Empty() {
|
|
query, args := updater.Query()
|
|
if err := tx.Exec(ctx, query, args, &res); err != nil {
|
|
return 0, rollback(tx, err)
|
|
}
|
|
}
|
|
if nu.clearedPrev {
|
|
query, args := builder.Update(node.PrevTable).
|
|
SetNull(node.PrevColumn).
|
|
Where(sql.InInts(node.FieldID, ids...)).
|
|
Query()
|
|
if err := tx.Exec(ctx, query, args, &res); err != nil {
|
|
return 0, rollback(tx, err)
|
|
}
|
|
}
|
|
if len(nu.prev) > 0 {
|
|
for _, id := range ids {
|
|
eid := keys(nu.prev)[0]
|
|
query, args := builder.Update(node.PrevTable).
|
|
Set(node.PrevColumn, eid).
|
|
Where(sql.EQ(node.FieldID, id).And().IsNull(node.PrevColumn)).
|
|
Query()
|
|
if err := tx.Exec(ctx, query, args, &res); err != nil {
|
|
return 0, rollback(tx, err)
|
|
}
|
|
affected, err := res.RowsAffected()
|
|
if err != nil {
|
|
return 0, rollback(tx, err)
|
|
}
|
|
if int(affected) < len(nu.prev) {
|
|
return 0, rollback(tx, &ErrConstraintFailed{msg: fmt.Sprintf("one of \"prev\" %v already connected to a different \"Node\"", keys(nu.prev))})
|
|
}
|
|
}
|
|
}
|
|
if nu.clearedNext {
|
|
query, args := builder.Update(node.NextTable).
|
|
SetNull(node.NextColumn).
|
|
Where(sql.InInts(node.FieldID, ids...)).
|
|
Query()
|
|
if err := tx.Exec(ctx, query, args, &res); err != nil {
|
|
return 0, rollback(tx, err)
|
|
}
|
|
}
|
|
if len(nu.next) > 0 {
|
|
for _, id := range ids {
|
|
eid := keys(nu.next)[0]
|
|
query, args := builder.Update(node.NextTable).
|
|
Set(node.NextColumn, id).
|
|
Where(sql.EQ(node.FieldID, eid).And().IsNull(node.NextColumn)).
|
|
Query()
|
|
if err := tx.Exec(ctx, query, args, &res); err != nil {
|
|
return 0, rollback(tx, err)
|
|
}
|
|
affected, err := res.RowsAffected()
|
|
if err != nil {
|
|
return 0, rollback(tx, err)
|
|
}
|
|
if int(affected) < len(nu.next) {
|
|
return 0, rollback(tx, &ErrConstraintFailed{msg: fmt.Sprintf("one of \"next\" %v already connected to a different \"Node\"", keys(nu.next))})
|
|
}
|
|
}
|
|
}
|
|
if err = tx.Commit(); err != nil {
|
|
return 0, err
|
|
}
|
|
return len(ids), nil
|
|
}
|
|
|
|
// NodeUpdateOne is the builder for updating a single Node entity.
|
|
type NodeUpdateOne struct {
|
|
config
|
|
id int
|
|
value *int
|
|
addvalue *int
|
|
prev map[int]struct{}
|
|
next map[int]struct{}
|
|
clearedPrev bool
|
|
clearedNext bool
|
|
}
|
|
|
|
// SetValue sets the value field.
|
|
func (nuo *NodeUpdateOne) SetValue(i int) *NodeUpdateOne {
|
|
nuo.value = &i
|
|
nuo.addvalue = nil
|
|
return nuo
|
|
}
|
|
|
|
// AddValue adds i to value.
|
|
func (nuo *NodeUpdateOne) AddValue(i int) *NodeUpdateOne {
|
|
if nuo.addvalue == nil {
|
|
nuo.addvalue = &i
|
|
} else {
|
|
*nuo.addvalue += i
|
|
}
|
|
return nuo
|
|
}
|
|
|
|
// SetPrevID sets the prev edge to Node by id.
|
|
func (nuo *NodeUpdateOne) SetPrevID(id int) *NodeUpdateOne {
|
|
if nuo.prev == nil {
|
|
nuo.prev = make(map[int]struct{})
|
|
}
|
|
nuo.prev[id] = struct{}{}
|
|
return nuo
|
|
}
|
|
|
|
// SetNillablePrevID sets the prev edge to Node by id if the given value is not nil.
|
|
func (nuo *NodeUpdateOne) SetNillablePrevID(id *int) *NodeUpdateOne {
|
|
if id != nil {
|
|
nuo = nuo.SetPrevID(*id)
|
|
}
|
|
return nuo
|
|
}
|
|
|
|
// SetPrev sets the prev edge to Node.
|
|
func (nuo *NodeUpdateOne) SetPrev(n *Node) *NodeUpdateOne {
|
|
return nuo.SetPrevID(n.ID)
|
|
}
|
|
|
|
// SetNextID sets the next edge to Node by id.
|
|
func (nuo *NodeUpdateOne) SetNextID(id int) *NodeUpdateOne {
|
|
if nuo.next == nil {
|
|
nuo.next = make(map[int]struct{})
|
|
}
|
|
nuo.next[id] = struct{}{}
|
|
return nuo
|
|
}
|
|
|
|
// SetNillableNextID sets the next edge to Node by id if the given value is not nil.
|
|
func (nuo *NodeUpdateOne) SetNillableNextID(id *int) *NodeUpdateOne {
|
|
if id != nil {
|
|
nuo = nuo.SetNextID(*id)
|
|
}
|
|
return nuo
|
|
}
|
|
|
|
// SetNext sets the next edge to Node.
|
|
func (nuo *NodeUpdateOne) SetNext(n *Node) *NodeUpdateOne {
|
|
return nuo.SetNextID(n.ID)
|
|
}
|
|
|
|
// ClearPrev clears the prev edge to Node.
|
|
func (nuo *NodeUpdateOne) ClearPrev() *NodeUpdateOne {
|
|
nuo.clearedPrev = true
|
|
return nuo
|
|
}
|
|
|
|
// ClearNext clears the next edge to Node.
|
|
func (nuo *NodeUpdateOne) ClearNext() *NodeUpdateOne {
|
|
nuo.clearedNext = true
|
|
return nuo
|
|
}
|
|
|
|
// Save executes the query and returns the updated entity.
|
|
func (nuo *NodeUpdateOne) Save(ctx context.Context) (*Node, error) {
|
|
if len(nuo.prev) > 1 {
|
|
return nil, errors.New("ent: multiple assignments on a unique edge \"prev\"")
|
|
}
|
|
if len(nuo.next) > 1 {
|
|
return nil, errors.New("ent: multiple assignments on a unique edge \"next\"")
|
|
}
|
|
return nuo.sqlSave(ctx)
|
|
}
|
|
|
|
// SaveX is like Save, but panics if an error occurs.
|
|
func (nuo *NodeUpdateOne) SaveX(ctx context.Context) *Node {
|
|
n, err := nuo.Save(ctx)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return n
|
|
}
|
|
|
|
// Exec executes the query on the entity.
|
|
func (nuo *NodeUpdateOne) Exec(ctx context.Context) error {
|
|
_, err := nuo.Save(ctx)
|
|
return err
|
|
}
|
|
|
|
// ExecX is like Exec, but panics if an error occurs.
|
|
func (nuo *NodeUpdateOne) ExecX(ctx context.Context) {
|
|
if err := nuo.Exec(ctx); err != nil {
|
|
panic(err)
|
|
}
|
|
}
|
|
|
|
func (nuo *NodeUpdateOne) sqlSave(ctx context.Context) (n *Node, err error) {
|
|
var (
|
|
builder = sql.Dialect(nuo.driver.Dialect())
|
|
selector = builder.Select(node.Columns...).From(builder.Table(node.Table))
|
|
)
|
|
node.ID(nuo.id)(selector)
|
|
rows := &sql.Rows{}
|
|
query, args := selector.Query()
|
|
if err = nuo.driver.Query(ctx, query, args, rows); err != nil {
|
|
return nil, err
|
|
}
|
|
defer rows.Close()
|
|
var ids []int
|
|
for rows.Next() {
|
|
var id int
|
|
n = &Node{config: nuo.config}
|
|
if err := n.FromRows(rows); err != nil {
|
|
return nil, fmt.Errorf("ent: failed scanning row into Node: %v", err)
|
|
}
|
|
id = n.ID
|
|
ids = append(ids, id)
|
|
}
|
|
switch n := len(ids); {
|
|
case n == 0:
|
|
return nil, &ErrNotFound{fmt.Sprintf("Node with id: %v", nuo.id)}
|
|
case n > 1:
|
|
return nil, fmt.Errorf("ent: more than one Node with the same id: %v", nuo.id)
|
|
}
|
|
|
|
tx, err := nuo.driver.Tx(ctx)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
var (
|
|
res sql.Result
|
|
updater = builder.Update(node.Table).Where(sql.InInts(node.FieldID, ids...))
|
|
)
|
|
if value := nuo.value; value != nil {
|
|
updater.Set(node.FieldValue, *value)
|
|
n.Value = *value
|
|
}
|
|
if value := nuo.addvalue; value != nil {
|
|
updater.Add(node.FieldValue, *value)
|
|
n.Value += *value
|
|
}
|
|
if !updater.Empty() {
|
|
query, args := updater.Query()
|
|
if err := tx.Exec(ctx, query, args, &res); err != nil {
|
|
return nil, rollback(tx, err)
|
|
}
|
|
}
|
|
if nuo.clearedPrev {
|
|
query, args := builder.Update(node.PrevTable).
|
|
SetNull(node.PrevColumn).
|
|
Where(sql.InInts(node.FieldID, ids...)).
|
|
Query()
|
|
if err := tx.Exec(ctx, query, args, &res); err != nil {
|
|
return nil, rollback(tx, err)
|
|
}
|
|
}
|
|
if len(nuo.prev) > 0 {
|
|
for _, id := range ids {
|
|
eid := keys(nuo.prev)[0]
|
|
query, args := builder.Update(node.PrevTable).
|
|
Set(node.PrevColumn, eid).
|
|
Where(sql.EQ(node.FieldID, id).And().IsNull(node.PrevColumn)).
|
|
Query()
|
|
if err := tx.Exec(ctx, query, args, &res); err != nil {
|
|
return nil, rollback(tx, err)
|
|
}
|
|
affected, err := res.RowsAffected()
|
|
if err != nil {
|
|
return nil, rollback(tx, err)
|
|
}
|
|
if int(affected) < len(nuo.prev) {
|
|
return nil, rollback(tx, &ErrConstraintFailed{msg: fmt.Sprintf("one of \"prev\" %v already connected to a different \"Node\"", keys(nuo.prev))})
|
|
}
|
|
}
|
|
}
|
|
if nuo.clearedNext {
|
|
query, args := builder.Update(node.NextTable).
|
|
SetNull(node.NextColumn).
|
|
Where(sql.InInts(node.FieldID, ids...)).
|
|
Query()
|
|
if err := tx.Exec(ctx, query, args, &res); err != nil {
|
|
return nil, rollback(tx, err)
|
|
}
|
|
}
|
|
if len(nuo.next) > 0 {
|
|
for _, id := range ids {
|
|
eid := keys(nuo.next)[0]
|
|
query, args := builder.Update(node.NextTable).
|
|
Set(node.NextColumn, id).
|
|
Where(sql.EQ(node.FieldID, eid).And().IsNull(node.NextColumn)).
|
|
Query()
|
|
if err := tx.Exec(ctx, query, args, &res); err != nil {
|
|
return nil, rollback(tx, err)
|
|
}
|
|
affected, err := res.RowsAffected()
|
|
if err != nil {
|
|
return nil, rollback(tx, err)
|
|
}
|
|
if int(affected) < len(nuo.next) {
|
|
return nil, rollback(tx, &ErrConstraintFailed{msg: fmt.Sprintf("one of \"next\" %v already connected to a different \"Node\"", keys(nuo.next))})
|
|
}
|
|
}
|
|
}
|
|
if err = tx.Commit(); err != nil {
|
|
return nil, err
|
|
}
|
|
return n, nil
|
|
}
|