-
Notifications
You must be signed in to change notification settings - Fork 894
/
mutation.go
488 lines (433 loc) · 12 KB
/
mutation.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
// 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 entc, DO NOT EDIT.
package ent
import (
"context"
"fmt"
"sync"
"github.com/facebook/ent/examples/o2orecur/ent/node"
"github.com/facebook/ent/examples/o2orecur/ent/predicate"
"github.com/facebook/ent"
)
const (
// Operation types.
OpCreate = ent.OpCreate
OpDelete = ent.OpDelete
OpDeleteOne = ent.OpDeleteOne
OpUpdate = ent.OpUpdate
OpUpdateOne = ent.OpUpdateOne
// Node types.
TypeNode = "Node"
)
// NodeMutation represents an operation that mutate the Nodes
// nodes in the graph.
type NodeMutation struct {
config
op Op
typ string
id *int
value *int
addvalue *int
clearedFields map[string]struct{}
prev *int
clearedprev bool
next *int
clearednext bool
done bool
oldValue func(context.Context) (*Node, error)
predicates []predicate.Node
}
var _ ent.Mutation = (*NodeMutation)(nil)
// nodeOption allows to manage the mutation configuration using functional options.
type nodeOption func(*NodeMutation)
// newNodeMutation creates new mutation for Node.
func newNodeMutation(c config, op Op, opts ...nodeOption) *NodeMutation {
m := &NodeMutation{
config: c,
op: op,
typ: TypeNode,
clearedFields: make(map[string]struct{}),
}
for _, opt := range opts {
opt(m)
}
return m
}
// withNodeID sets the id field of the mutation.
func withNodeID(id int) nodeOption {
return func(m *NodeMutation) {
var (
err error
once sync.Once
value *Node
)
m.oldValue = func(ctx context.Context) (*Node, error) {
once.Do(func() {
if m.done {
err = fmt.Errorf("querying old values post mutation is not allowed")
} else {
value, err = m.Client().Node.Get(ctx, id)
}
})
return value, err
}
m.id = &id
}
}
// withNode sets the old Node of the mutation.
func withNode(node *Node) nodeOption {
return func(m *NodeMutation) {
m.oldValue = func(context.Context) (*Node, error) {
return node, nil
}
m.id = &node.ID
}
}
// Client returns a new `ent.Client` from the mutation. If the mutation was
// executed in a transaction (ent.Tx), a transactional client is returned.
func (m NodeMutation) Client() *Client {
client := &Client{config: m.config}
client.init()
return client
}
// Tx returns an `ent.Tx` for mutations that were executed in transactions;
// it returns an error otherwise.
func (m NodeMutation) Tx() (*Tx, error) {
if _, ok := m.driver.(*txDriver); !ok {
return nil, fmt.Errorf("ent: mutation is not running in a transaction")
}
tx := &Tx{config: m.config}
tx.init()
return tx, nil
}
// ID returns the id value in the mutation. Note that, the id
// is available only if it was provided to the builder.
func (m *NodeMutation) ID() (id int, exists bool) {
if m.id == nil {
return
}
return *m.id, true
}
// SetValue sets the value field.
func (m *NodeMutation) SetValue(i int) {
m.value = &i
m.addvalue = nil
}
// Value returns the value value in the mutation.
func (m *NodeMutation) Value() (r int, exists bool) {
v := m.value
if v == nil {
return
}
return *v, true
}
// OldValue returns the old value value of the Node.
// If the Node object wasn't provided to the builder, the object is fetched
// from the database.
// An error is returned if the mutation operation is not UpdateOne, or database query fails.
func (m *NodeMutation) OldValue(ctx context.Context) (v int, err error) {
if !m.op.Is(OpUpdateOne) {
return v, fmt.Errorf("OldValue is allowed only on UpdateOne operations")
}
if m.id == nil || m.oldValue == nil {
return v, fmt.Errorf("OldValue requires an ID field in the mutation")
}
oldValue, err := m.oldValue(ctx)
if err != nil {
return v, fmt.Errorf("querying old value for OldValue: %w", err)
}
return oldValue.Value, nil
}
// AddValue adds i to value.
func (m *NodeMutation) 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 *NodeMutation) AddedValue() (r int, exists bool) {
v := m.addvalue
if v == nil {
return
}
return *v, true
}
// ResetValue reset all changes of the "value" field.
func (m *NodeMutation) ResetValue() {
m.value = nil
m.addvalue = nil
}
// SetPrevID sets the prev edge to Node by id.
func (m *NodeMutation) SetPrevID(id int) {
m.prev = &id
}
// ClearPrev clears the prev edge to Node.
func (m *NodeMutation) ClearPrev() {
m.clearedprev = true
}
// PrevCleared returns if the edge prev was cleared.
func (m *NodeMutation) PrevCleared() bool {
return m.clearedprev
}
// PrevID returns the prev id in the mutation.
func (m *NodeMutation) PrevID() (id int, exists bool) {
if m.prev != nil {
return *m.prev, true
}
return
}
// PrevIDs returns the prev 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 *NodeMutation) PrevIDs() (ids []int) {
if id := m.prev; id != nil {
ids = append(ids, *id)
}
return
}
// ResetPrev reset all changes of the "prev" edge.
func (m *NodeMutation) ResetPrev() {
m.prev = nil
m.clearedprev = false
}
// SetNextID sets the next edge to Node by id.
func (m *NodeMutation) SetNextID(id int) {
m.next = &id
}
// ClearNext clears the next edge to Node.
func (m *NodeMutation) ClearNext() {
m.clearednext = true
}
// NextCleared returns if the edge next was cleared.
func (m *NodeMutation) NextCleared() bool {
return m.clearednext
}
// NextID returns the next id in the mutation.
func (m *NodeMutation) NextID() (id int, exists bool) {
if m.next != nil {
return *m.next, true
}
return
}
// NextIDs returns the next 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 *NodeMutation) NextIDs() (ids []int) {
if id := m.next; id != nil {
ids = append(ids, *id)
}
return
}
// ResetNext reset all changes of the "next" edge.
func (m *NodeMutation) ResetNext() {
m.next = nil
m.clearednext = false
}
// Op returns the operation name.
func (m *NodeMutation) Op() Op {
return m.op
}
// Type returns the node type of this mutation (Node).
func (m *NodeMutation) 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 in/decremented, call AddedFields().
func (m *NodeMutation) Fields() []string {
fields := make([]string, 0, 1)
if m.value != nil {
fields = append(fields, node.FieldValue)
}
return fields
}
// Field returns the value of a field with the given name.
// The second boolean value indicates that this field was
// not set, or was not define in the schema.
func (m *NodeMutation) Field(name string) (ent.Value, bool) {
switch name {
case node.FieldValue:
return m.Value()
}
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 was failed.
func (m *NodeMutation) OldField(ctx context.Context, name string) (ent.Value, error) {
switch name {
case node.FieldValue:
return m.OldValue(ctx)
}
return nil, fmt.Errorf("unknown Node field %s", name)
}
// SetField sets the value for the given name. It returns an
// error if the field is not defined in the schema, or if the
// type mismatch the field type.
func (m *NodeMutation) SetField(name string, value ent.Value) error {
switch name {
case node.FieldValue:
v, ok := value.(int)
if !ok {
return fmt.Errorf("unexpected type %T for field %s", value, name)
}
m.SetValue(v)
return nil
}
return fmt.Errorf("unknown Node field %s", name)
}
// AddedFields returns all numeric fields that were incremented
// or decremented during this mutation.
func (m *NodeMutation) AddedFields() []string {
var fields []string
if m.addvalue != nil {
fields = append(fields, node.FieldValue)
}
return fields
}
// AddedField returns the numeric value that was in/decremented
// from a field with the given name. The second value indicates
// that this field was not set, or was not define in the schema.
func (m *NodeMutation) AddedField(name string) (ent.Value, bool) {
switch name {
case node.FieldValue:
return m.AddedValue()
}
return nil, false
}
// AddField adds the value for the given name. It returns an
// error if the field is not defined in the schema, or if the
// type mismatch the field type.
func (m *NodeMutation) AddField(name string, value ent.Value) error {
switch name {
case node.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 *NodeMutation) ClearedFields() []string {
return nil
}
// FieldCleared returns a boolean indicates if this field was
// cleared in this mutation.
func (m *NodeMutation) FieldCleared(name string) bool {
_, ok := m.clearedFields[name]
return ok
}
// ClearField clears the value for the given name. It returns an
// error if the field is not defined in the schema.
func (m *NodeMutation) ClearField(name string) error {
return fmt.Errorf("unknown Node nullable field %s", name)
}
// ResetField resets all changes in the mutation regarding the
// given field name. It returns an error if the field is not
// defined in the schema.
func (m *NodeMutation) ResetField(name string) error {
switch name {
case node.FieldValue:
m.ResetValue()
return nil
}
return fmt.Errorf("unknown Node field %s", name)
}
// AddedEdges returns all edge names that were set/added in this
// mutation.
func (m *NodeMutation) AddedEdges() []string {
edges := make([]string, 0, 2)
if m.prev != nil {
edges = append(edges, node.EdgePrev)
}
if m.next != nil {
edges = append(edges, node.EdgeNext)
}
return edges
}
// AddedIDs returns all ids (to other nodes) that were added for
// the given edge name.
func (m *NodeMutation) AddedIDs(name string) []ent.Value {
switch name {
case node.EdgePrev:
if id := m.prev; id != nil {
return []ent.Value{*id}
}
case node.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 *NodeMutation) RemovedEdges() []string {
edges := make([]string, 0, 2)
return edges
}
// RemovedIDs returns all ids (to other nodes) that were removed for
// the given edge name.
func (m *NodeMutation) RemovedIDs(name string) []ent.Value {
switch name {
}
return nil
}
// ClearedEdges returns all edge names that were cleared in this
// mutation.
func (m *NodeMutation) ClearedEdges() []string {
edges := make([]string, 0, 2)
if m.clearedprev {
edges = append(edges, node.EdgePrev)
}
if m.clearednext {
edges = append(edges, node.EdgeNext)
}
return edges
}
// EdgeCleared returns a boolean indicates if this edge was
// cleared in this mutation.
func (m *NodeMutation) EdgeCleared(name string) bool {
switch name {
case node.EdgePrev:
return m.clearedprev
case node.EdgeNext:
return m.clearednext
}
return false
}
// ClearEdge clears the value for the given name. It returns an
// error if the edge name is not defined in the schema.
func (m *NodeMutation) ClearEdge(name string) error {
switch name {
case node.EdgePrev:
m.ClearPrev()
return nil
case node.EdgeNext:
m.ClearNext()
return nil
}
return fmt.Errorf("unknown Node unique edge %s", name)
}
// ResetEdge resets all changes in the mutation regarding the
// given edge name. It returns an error if the edge is not
// defined in the schema.
func (m *NodeMutation) ResetEdge(name string) error {
switch name {
case node.EdgePrev:
m.ResetPrev()
return nil
case node.EdgeNext:
m.ResetNext()
return nil
}
return fmt.Errorf("unknown Node edge %s", name)
}