snapshot of https://github.com/ent/ent.git (master, 2026-09-15; blobs > 131072B omitted)
Some checks failed
Atlas CI Public / lint (push) Failing after 13s
Atlas CI Public / sync (push) Has been skipped

This commit is contained in:
upstream-mirror
2026-09-15 22:12:36 +05:00
commit 4b3ad0b611
2680 changed files with 719472 additions and 0 deletions

View File

@@ -0,0 +1,58 @@
// 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 card
import (
"time"
"entgo.io/ent/dialect/gremlin/graph/dsl"
)
const (
// Label holds the string label denoting the card type in the database.
Label = "card"
// FieldID holds the string denoting the id field in the database.
FieldID = "id"
// FieldCreateTime holds the string denoting the create_time field in the database.
FieldCreateTime = "create_time"
// FieldUpdateTime holds the string denoting the update_time field in the database.
FieldUpdateTime = "update_time"
// FieldBalance holds the string denoting the balance field in the database.
FieldBalance = "balance"
// FieldNumber holds the string denoting the number field in the database.
FieldNumber = "number"
// FieldName holds the string denoting the name field in the database.
FieldName = "name"
// EdgeOwner holds the string denoting the owner edge name in mutations.
EdgeOwner = "owner"
// EdgeSpec holds the string denoting the spec edge name in mutations.
EdgeSpec = "spec"
// OwnerInverseLabel holds the string label denoting the owner inverse edge type in the database.
OwnerInverseLabel = "user_card"
// SpecInverseLabel holds the string label denoting the spec inverse edge type in the database.
SpecInverseLabel = "spec_card"
)
var (
// DefaultCreateTime holds the default value on creation for the "create_time" field.
DefaultCreateTime func() time.Time
// DefaultUpdateTime holds the default value on creation for the "update_time" field.
DefaultUpdateTime func() time.Time
// UpdateDefaultUpdateTime holds the default value on update for the "update_time" field.
UpdateDefaultUpdateTime func() time.Time
// DefaultBalance holds the default value on creation for the "balance" field.
DefaultBalance float64
// NumberValidator is a validator for the "number" field. It is called by the builders before save.
NumberValidator func(string) error
// NameValidator is a validator for the "name" field. It is called by the builders before save.
NameValidator func(string) error
)
// OrderOption defines the ordering options for the Card queries.
type OrderOption func(*dsl.Traversal)
// comment from another template.

View File

@@ -0,0 +1,584 @@
// 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 card
import (
"context"
"fmt"
"time"
"entgo.io/ent"
"entgo.io/ent/dialect/gremlin/graph/dsl"
"entgo.io/ent/entc/integration/gremlin/ent/predicate"
)
// Mutation represents an operation that mutates the Card nodes in the graph.
type Mutation struct {
op ent.Op
typ string
create_time *time.Time
update_time *time.Time
balance *float64
addbalance *float64
number *string
name *string
clearedFields map[string]struct{}
owner *string
clearedowner bool
spec map[string]struct{}
removedspec map[string]struct{}
clearedspec bool
predicates []predicate.Card
}
// NewMutation creates a new Mutation for the Card entity.
func NewMutation(op ent.Op) *Mutation {
return &Mutation{
op: op,
typ: "Card",
clearedFields: make(map[string]struct{}),
}
}
// Predicates returns the list of predicates set on the mutation.
func (m *Mutation) Predicates() []predicate.Card {
return m.predicates
}
// SetCreateTime sets the "create_time" field.
func (m *Mutation) SetCreateTime(t time.Time) {
m.create_time = &t
}
// CreateTime returns the value of the "create_time" field in the mutation.
func (m *Mutation) CreateTime() (r time.Time, exists bool) {
v := m.create_time
if v == nil {
return
}
return *v, true
}
// ResetCreateTime resets all changes to the "create_time" field.
func (m *Mutation) ResetCreateTime() {
m.create_time = nil
}
// SetUpdateTime sets the "update_time" field.
func (m *Mutation) SetUpdateTime(t time.Time) {
m.update_time = &t
}
// UpdateTime returns the value of the "update_time" field in the mutation.
func (m *Mutation) UpdateTime() (r time.Time, exists bool) {
v := m.update_time
if v == nil {
return
}
return *v, true
}
// ResetUpdateTime resets all changes to the "update_time" field.
func (m *Mutation) ResetUpdateTime() {
m.update_time = nil
}
// SetBalance sets the "balance" field.
func (m *Mutation) SetBalance(f float64) {
m.balance = &f
m.addbalance = nil
}
// Balance returns the value of the "balance" field in the mutation.
func (m *Mutation) Balance() (r float64, exists bool) {
v := m.balance
if v == nil {
return
}
return *v, true
}
// AddBalance adds f to the "balance" field.
func (m *Mutation) AddBalance(f float64) {
if m.addbalance != nil {
*m.addbalance += f
} else {
m.addbalance = &f
}
}
// AddedBalance returns the value that was added to the "balance" field in this mutation.
func (m *Mutation) AddedBalance() (r float64, exists bool) {
v := m.addbalance
if v == nil {
return
}
return *v, true
}
// ResetBalance resets all changes to the "balance" field.
func (m *Mutation) ResetBalance() {
m.balance = nil
m.addbalance = nil
}
// SetNumber sets the "number" field.
func (m *Mutation) SetNumber(s string) {
m.number = &s
}
// Number returns the value of the "number" field in the mutation.
func (m *Mutation) Number() (r string, exists bool) {
v := m.number
if v == nil {
return
}
return *v, true
}
// ResetNumber resets all changes to the "number" field.
func (m *Mutation) ResetNumber() {
m.number = nil
}
// SetName sets the "name" field.
func (m *Mutation) SetName(s string) {
m.name = &s
}
// Name returns the value of the "name" field in the mutation.
func (m *Mutation) Name() (r string, exists bool) {
v := m.name
if v == nil {
return
}
return *v, true
}
// ClearName clears the value of the "name" field.
func (m *Mutation) ClearName() {
m.name = nil
m.clearedFields[FieldName] = struct{}{}
}
// NameCleared returns if the "name" field was cleared in this mutation.
func (m *Mutation) NameCleared() bool {
_, ok := m.clearedFields[FieldName]
return ok
}
// ResetName resets all changes to the "name" field.
func (m *Mutation) ResetName() {
m.name = nil
delete(m.clearedFields, FieldName)
}
// SetOwnerID sets the "owner" edge to the User entity by id.
func (m *Mutation) SetOwnerID(id string) {
m.owner = &id
}
// ClearOwner clears the "owner" edge to the User entity.
func (m *Mutation) ClearOwner() {
m.clearedowner = true
}
// OwnerCleared reports if the "owner" edge to the User 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
}
// AddSpecIDs adds the "spec" edge to the Spec entity by ids.
func (m *Mutation) AddSpecIDs(ids ...string) {
if m.spec == nil {
m.spec = make(map[string]struct{})
}
for i := range ids {
m.spec[ids[i]] = struct{}{}
}
}
// ClearSpec clears the "spec" edge to the Spec entity.
func (m *Mutation) ClearSpec() {
m.clearedspec = true
}
// SpecCleared reports if the "spec" edge to the Spec entity was cleared.
func (m *Mutation) SpecCleared() bool {
return m.clearedspec
}
// RemoveSpecIDs removes the "spec" edge to the Spec entity by IDs.
func (m *Mutation) RemoveSpecIDs(ids ...string) {
if m.removedspec == nil {
m.removedspec = make(map[string]struct{})
}
for i := range ids {
delete(m.spec, ids[i])
m.removedspec[ids[i]] = struct{}{}
}
}
// RemovedSpec returns the removed IDs of the "spec" edge to the Spec entity.
func (m *Mutation) RemovedSpecIDs() (ids []string) {
for id := range m.removedspec {
ids = append(ids, id)
}
return
}
// SpecIDs returns the "spec" edge IDs in the mutation.
func (m *Mutation) SpecIDs() (ids []string) {
for id := range m.spec {
ids = append(ids, id)
}
return
}
// ResetSpec resets all changes to the "spec" edge.
func (m *Mutation) ResetSpec() {
m.spec = nil
m.clearedspec = false
m.removedspec = nil
}
// Where appends a list predicates to the Mutation builder.
func (m *Mutation) Where(ps ...predicate.Card) {
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(*dsl.Traversal)) {
p := make([]predicate.Card, 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 (Card).
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, 5)
if m.create_time != nil {
fields = append(fields, FieldCreateTime)
}
if m.update_time != nil {
fields = append(fields, FieldUpdateTime)
}
if m.balance != nil {
fields = append(fields, FieldBalance)
}
if m.number != nil {
fields = append(fields, FieldNumber)
}
if m.name != nil {
fields = append(fields, FieldName)
}
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 FieldCreateTime:
return m.CreateTime()
case FieldUpdateTime:
return m.UpdateTime()
case FieldBalance:
return m.Balance()
case FieldNumber:
return m.Number()
case FieldName:
return m.Name()
}
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 Card 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 FieldCreateTime:
v, ok := value.(time.Time)
if !ok {
return fmt.Errorf("unexpected type %T for field %s", value, name)
}
m.SetCreateTime(v)
return nil
case FieldUpdateTime:
v, ok := value.(time.Time)
if !ok {
return fmt.Errorf("unexpected type %T for field %s", value, name)
}
m.SetUpdateTime(v)
return nil
case FieldBalance:
v, ok := value.(float64)
if !ok {
return fmt.Errorf("unexpected type %T for field %s", value, name)
}
m.SetBalance(v)
return nil
case FieldNumber:
v, ok := value.(string)
if !ok {
return fmt.Errorf("unexpected type %T for field %s", value, name)
}
m.SetNumber(v)
return nil
case FieldName:
v, ok := value.(string)
if !ok {
return fmt.Errorf("unexpected type %T for field %s", value, name)
}
m.SetName(v)
return nil
}
return fmt.Errorf("unknown Card 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.addbalance != nil {
fields = append(fields, FieldBalance)
}
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 FieldBalance:
return m.AddedBalance()
}
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 FieldBalance:
v, ok := value.(float64)
if !ok {
return fmt.Errorf("unexpected type %T for field %s", value, name)
}
m.AddBalance(v)
return nil
}
return fmt.Errorf("unknown Card 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(FieldName) {
fields = append(fields, FieldName)
}
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 FieldName:
m.ClearName()
return nil
}
return fmt.Errorf("unknown Card 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 FieldCreateTime:
m.ResetCreateTime()
return nil
case FieldUpdateTime:
m.ResetUpdateTime()
return nil
case FieldBalance:
m.ResetBalance()
return nil
case FieldNumber:
m.ResetNumber()
return nil
case FieldName:
m.ResetName()
return nil
}
return fmt.Errorf("unknown Card 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.owner != nil {
edges = append(edges, EdgeOwner)
}
if m.spec != nil {
edges = append(edges, EdgeSpec)
}
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}
}
case EdgeSpec:
ids := make([]ent.Value, 0, len(m.spec))
for id := range m.spec {
ids = append(ids, id)
}
return ids
}
return nil
}
// RemovedEdges returns all edge names that were removed in this mutation.
func (m *Mutation) RemovedEdges() []string {
edges := make([]string, 0, 2)
if m.removedspec != nil {
edges = append(edges, EdgeSpec)
}
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 {
switch name {
case EdgeSpec:
ids := make([]ent.Value, 0, len(m.removedspec))
for id := range m.removedspec {
ids = append(ids, id)
}
return ids
}
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.clearedowner {
edges = append(edges, EdgeOwner)
}
if m.clearedspec {
edges = append(edges, EdgeSpec)
}
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
case EdgeSpec:
return m.clearedspec
}
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 Card 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
case EdgeSpec:
m.ResetSpec()
return nil
}
return fmt.Errorf("unknown Card edge %s", name)
}

View File

@@ -0,0 +1,529 @@
// 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 card
import (
"time"
"entgo.io/ent/dialect/gremlin/graph/dsl"
"entgo.io/ent/dialect/gremlin/graph/dsl/__"
"entgo.io/ent/dialect/gremlin/graph/dsl/p"
"entgo.io/ent/entc/integration/gremlin/ent/predicate"
)
// ID filters vertices based on their ID field.
func ID(id string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.HasID(id)
})
}
// IDEQ applies the EQ predicate on the ID field.
func IDEQ(id string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.HasID(p.EQ(id))
})
}
// IDNEQ applies the NEQ predicate on the ID field.
func IDNEQ(id string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.HasID(p.NEQ(id))
})
}
// IDIn applies the In predicate on the ID field.
func IDIn(ids ...string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
v := make([]any, len(ids))
for i := range v {
v[i] = ids[i]
}
t.HasID(p.Within(v...))
})
}
// IDNotIn applies the NotIn predicate on the ID field.
func IDNotIn(ids ...string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
v := make([]any, len(ids))
for i := range v {
v[i] = ids[i]
}
t.HasID(p.Without(v...))
})
}
// IDGT applies the GT predicate on the ID field.
func IDGT(id string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.HasID(p.GT(id))
})
}
// IDGTE applies the GTE predicate on the ID field.
func IDGTE(id string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.HasID(p.GTE(id))
})
}
// IDLT applies the LT predicate on the ID field.
func IDLT(id string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.HasID(p.LT(id))
})
}
// IDLTE applies the LTE predicate on the ID field.
func IDLTE(id string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.HasID(p.LTE(id))
})
}
// CreateTime applies equality check predicate on the "create_time" field. It's identical to CreateTimeEQ.
func CreateTime(v time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldCreateTime, p.EQ(v))
})
}
// UpdateTime applies equality check predicate on the "update_time" field. It's identical to UpdateTimeEQ.
func UpdateTime(v time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldUpdateTime, p.EQ(v))
})
}
// Balance applies equality check predicate on the "balance" field. It's identical to BalanceEQ.
func Balance(v float64) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldBalance, p.EQ(v))
})
}
// Number applies equality check predicate on the "number" field. It's identical to NumberEQ.
func Number(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldNumber, p.EQ(v))
})
}
// Name applies equality check predicate on the "name" field. It's identical to NameEQ.
func Name(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.EQ(v))
})
}
// CreateTimeEQ applies the EQ predicate on the "create_time" field.
func CreateTimeEQ(v time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldCreateTime, p.EQ(v))
})
}
// CreateTimeNEQ applies the NEQ predicate on the "create_time" field.
func CreateTimeNEQ(v time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldCreateTime, p.NEQ(v))
})
}
// CreateTimeIn applies the In predicate on the "create_time" field.
func CreateTimeIn(vs ...time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldCreateTime, p.Within(vs...))
})
}
// CreateTimeNotIn applies the NotIn predicate on the "create_time" field.
func CreateTimeNotIn(vs ...time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldCreateTime, p.Without(vs...))
})
}
// CreateTimeGT applies the GT predicate on the "create_time" field.
func CreateTimeGT(v time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldCreateTime, p.GT(v))
})
}
// CreateTimeGTE applies the GTE predicate on the "create_time" field.
func CreateTimeGTE(v time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldCreateTime, p.GTE(v))
})
}
// CreateTimeLT applies the LT predicate on the "create_time" field.
func CreateTimeLT(v time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldCreateTime, p.LT(v))
})
}
// CreateTimeLTE applies the LTE predicate on the "create_time" field.
func CreateTimeLTE(v time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldCreateTime, p.LTE(v))
})
}
// UpdateTimeEQ applies the EQ predicate on the "update_time" field.
func UpdateTimeEQ(v time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldUpdateTime, p.EQ(v))
})
}
// UpdateTimeNEQ applies the NEQ predicate on the "update_time" field.
func UpdateTimeNEQ(v time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldUpdateTime, p.NEQ(v))
})
}
// UpdateTimeIn applies the In predicate on the "update_time" field.
func UpdateTimeIn(vs ...time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldUpdateTime, p.Within(vs...))
})
}
// UpdateTimeNotIn applies the NotIn predicate on the "update_time" field.
func UpdateTimeNotIn(vs ...time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldUpdateTime, p.Without(vs...))
})
}
// UpdateTimeGT applies the GT predicate on the "update_time" field.
func UpdateTimeGT(v time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldUpdateTime, p.GT(v))
})
}
// UpdateTimeGTE applies the GTE predicate on the "update_time" field.
func UpdateTimeGTE(v time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldUpdateTime, p.GTE(v))
})
}
// UpdateTimeLT applies the LT predicate on the "update_time" field.
func UpdateTimeLT(v time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldUpdateTime, p.LT(v))
})
}
// UpdateTimeLTE applies the LTE predicate on the "update_time" field.
func UpdateTimeLTE(v time.Time) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldUpdateTime, p.LTE(v))
})
}
// BalanceEQ applies the EQ predicate on the "balance" field.
func BalanceEQ(v float64) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldBalance, p.EQ(v))
})
}
// BalanceNEQ applies the NEQ predicate on the "balance" field.
func BalanceNEQ(v float64) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldBalance, p.NEQ(v))
})
}
// BalanceIn applies the In predicate on the "balance" field.
func BalanceIn(vs ...float64) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldBalance, p.Within(vs...))
})
}
// BalanceNotIn applies the NotIn predicate on the "balance" field.
func BalanceNotIn(vs ...float64) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldBalance, p.Without(vs...))
})
}
// BalanceGT applies the GT predicate on the "balance" field.
func BalanceGT(v float64) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldBalance, p.GT(v))
})
}
// BalanceGTE applies the GTE predicate on the "balance" field.
func BalanceGTE(v float64) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldBalance, p.GTE(v))
})
}
// BalanceLT applies the LT predicate on the "balance" field.
func BalanceLT(v float64) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldBalance, p.LT(v))
})
}
// BalanceLTE applies the LTE predicate on the "balance" field.
func BalanceLTE(v float64) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldBalance, p.LTE(v))
})
}
// NumberEQ applies the EQ predicate on the "number" field.
func NumberEQ(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldNumber, p.EQ(v))
})
}
// NumberNEQ applies the NEQ predicate on the "number" field.
func NumberNEQ(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldNumber, p.NEQ(v))
})
}
// NumberIn applies the In predicate on the "number" field.
func NumberIn(vs ...string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldNumber, p.Within(vs...))
})
}
// NumberNotIn applies the NotIn predicate on the "number" field.
func NumberNotIn(vs ...string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldNumber, p.Without(vs...))
})
}
// NumberGT applies the GT predicate on the "number" field.
func NumberGT(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldNumber, p.GT(v))
})
}
// NumberGTE applies the GTE predicate on the "number" field.
func NumberGTE(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldNumber, p.GTE(v))
})
}
// NumberLT applies the LT predicate on the "number" field.
func NumberLT(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldNumber, p.LT(v))
})
}
// NumberLTE applies the LTE predicate on the "number" field.
func NumberLTE(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldNumber, p.LTE(v))
})
}
// NumberContains applies the Contains predicate on the "number" field.
func NumberContains(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldNumber, p.Containing(v))
})
}
// NumberHasPrefix applies the HasPrefix predicate on the "number" field.
func NumberHasPrefix(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldNumber, p.StartingWith(v))
})
}
// NumberHasSuffix applies the HasSuffix predicate on the "number" field.
func NumberHasSuffix(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldNumber, p.EndingWith(v))
})
}
// NameEQ applies the EQ predicate on the "name" field.
func NameEQ(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.EQ(v))
})
}
// NameNEQ applies the NEQ predicate on the "name" field.
func NameNEQ(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.NEQ(v))
})
}
// NameIn applies the In predicate on the "name" field.
func NameIn(vs ...string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.Within(vs...))
})
}
// NameNotIn applies the NotIn predicate on the "name" field.
func NameNotIn(vs ...string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.Without(vs...))
})
}
// NameGT applies the GT predicate on the "name" field.
func NameGT(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.GT(v))
})
}
// NameGTE applies the GTE predicate on the "name" field.
func NameGTE(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.GTE(v))
})
}
// NameLT applies the LT predicate on the "name" field.
func NameLT(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.LT(v))
})
}
// NameLTE applies the LTE predicate on the "name" field.
func NameLTE(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.LTE(v))
})
}
// NameContains applies the Contains predicate on the "name" field.
func NameContains(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.Containing(v))
})
}
// NameHasPrefix applies the HasPrefix predicate on the "name" field.
func NameHasPrefix(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.StartingWith(v))
})
}
// NameHasSuffix applies the HasSuffix predicate on the "name" field.
func NameHasSuffix(v string) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.EndingWith(v))
})
}
// NameIsNil applies the IsNil predicate on the "name" field.
func NameIsNil() predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.HasLabel(Label).HasNot(FieldName)
})
}
// NameNotNil applies the NotNil predicate on the "name" field.
func NameNotNil() predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.HasLabel(Label).Has(FieldName)
})
}
// HasOwner applies the HasEdge predicate on the "owner" edge.
func HasOwner() predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.InE(OwnerInverseLabel).InV()
})
}
// HasOwnerWith applies the HasEdge predicate on the "owner" edge with a given conditions (other predicates).
func HasOwnerWith(preds ...predicate.User) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
tr := __.OutV()
for _, p := range preds {
p(tr)
}
t.InE(OwnerInverseLabel).Where(tr).InV()
})
}
// HasSpec applies the HasEdge predicate on the "spec" edge.
func HasSpec() predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
t.InE(SpecInverseLabel).InV()
})
}
// HasSpecWith applies the HasEdge predicate on the "spec" edge with a given conditions (other predicates).
func HasSpecWith(preds ...predicate.Spec) predicate.Card {
return predicate.Card(func(t *dsl.Traversal) {
tr := __.OutV()
for _, p := range preds {
p(tr)
}
t.InE(SpecInverseLabel).Where(tr).InV()
})
}
// And groups predicates with the AND operator between them.
func And(predicates ...predicate.Card) predicate.Card {
return predicate.Card(func(tr *dsl.Traversal) {
trs := make([]any, 0, len(predicates))
for _, p := range predicates {
t := __.New()
p(t)
trs = append(trs, t)
}
tr.Where(__.And(trs...))
})
}
// Or groups predicates with the OR operator between them.
func Or(predicates ...predicate.Card) predicate.Card {
return predicate.Card(func(tr *dsl.Traversal) {
trs := make([]any, 0, len(predicates))
for _, p := range predicates {
t := __.New()
p(t)
trs = append(trs, t)
}
tr.Where(__.Or(trs...))
})
}
// Not applies the not operator on the given predicate.
func Not(p predicate.Card) predicate.Card {
return predicate.Card(func(tr *dsl.Traversal) {
t := __.New()
p(t)
tr.Where(__.Not(t))
})
}