snapshot of https://github.com/ent/ent.git (master, 2026-09-15; blobs > 131072B omitted)
This commit is contained in:
97
entc/integration/ent/groupinfo/groupinfo.go
Normal file
97
entc/integration/ent/groupinfo/groupinfo.go
Normal file
@@ -0,0 +1,97 @@
|
||||
// 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 groupinfo
|
||||
|
||||
import (
|
||||
"entgo.io/ent/dialect/sql"
|
||||
"entgo.io/ent/dialect/sql/sqlgraph"
|
||||
)
|
||||
|
||||
const (
|
||||
// Label holds the string label denoting the groupinfo type in the database.
|
||||
Label = "group_info"
|
||||
// FieldID holds the string denoting the id field in the database.
|
||||
FieldID = "id"
|
||||
// FieldDesc holds the string denoting the desc field in the database.
|
||||
FieldDesc = "desc"
|
||||
// FieldMaxUsers holds the string denoting the max_users field in the database.
|
||||
FieldMaxUsers = "max_users"
|
||||
// EdgeGroups holds the string denoting the groups edge name in mutations.
|
||||
EdgeGroups = "groups"
|
||||
// Table holds the table name of the groupinfo in the database.
|
||||
Table = "group_infos"
|
||||
// GroupsTable is the table that holds the groups relation/edge.
|
||||
GroupsTable = "groups"
|
||||
// GroupsInverseTable is the table name for the Group entity.
|
||||
// It exists in this package in order to avoid circular dependency with the "group" package.
|
||||
GroupsInverseTable = "groups"
|
||||
// GroupsColumn is the table column denoting the groups relation/edge.
|
||||
GroupsColumn = "group_info"
|
||||
)
|
||||
|
||||
// Columns holds all SQL columns for groupinfo fields.
|
||||
var Columns = []string{
|
||||
FieldID,
|
||||
FieldDesc,
|
||||
FieldMaxUsers,
|
||||
}
|
||||
|
||||
// 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
|
||||
}
|
||||
}
|
||||
return false
|
||||
}
|
||||
|
||||
var (
|
||||
// DefaultMaxUsers holds the default value on creation for the "max_users" field.
|
||||
DefaultMaxUsers int
|
||||
)
|
||||
|
||||
// OrderOption defines the ordering options for the GroupInfo 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()
|
||||
}
|
||||
|
||||
// ByDesc orders the results by the desc field.
|
||||
func ByDesc(opts ...sql.OrderTermOption) OrderOption {
|
||||
return sql.OrderByField(FieldDesc, opts...).ToFunc()
|
||||
}
|
||||
|
||||
// ByMaxUsers orders the results by the max_users field.
|
||||
func ByMaxUsers(opts ...sql.OrderTermOption) OrderOption {
|
||||
return sql.OrderByField(FieldMaxUsers, opts...).ToFunc()
|
||||
}
|
||||
|
||||
// ByGroupsCount orders the results by groups count.
|
||||
func ByGroupsCount(opts ...sql.OrderTermOption) OrderOption {
|
||||
return func(s *sql.Selector) {
|
||||
sqlgraph.OrderByNeighborsCount(s, newGroupsStep(), opts...)
|
||||
}
|
||||
}
|
||||
|
||||
// ByGroups orders the results by groups terms.
|
||||
func ByGroups(term sql.OrderTerm, terms ...sql.OrderTerm) OrderOption {
|
||||
return func(s *sql.Selector) {
|
||||
sqlgraph.OrderByNeighborTerms(s, newGroupsStep(), append([]sql.OrderTerm{term}, terms...)...)
|
||||
}
|
||||
}
|
||||
func newGroupsStep() *sqlgraph.Step {
|
||||
return sqlgraph.NewStep(
|
||||
sqlgraph.From(Table, FieldID),
|
||||
sqlgraph.To(GroupsInverseTable, FieldID),
|
||||
sqlgraph.Edge(sqlgraph.O2M, true, GroupsTable, GroupsColumn),
|
||||
)
|
||||
}
|
||||
|
||||
// comment from another template.
|
||||
397
entc/integration/ent/groupinfo/mutation.go
Normal file
397
entc/integration/ent/groupinfo/mutation.go
Normal file
@@ -0,0 +1,397 @@
|
||||
// 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 groupinfo
|
||||
|
||||
import (
|
||||
"context"
|
||||
"fmt"
|
||||
|
||||
"entgo.io/ent"
|
||||
"entgo.io/ent/dialect/sql"
|
||||
"entgo.io/ent/entc/integration/ent/predicate"
|
||||
)
|
||||
|
||||
// Mutation represents an operation that mutates the GroupInfo nodes in the graph.
|
||||
type Mutation struct {
|
||||
op ent.Op
|
||||
typ string
|
||||
desc *string
|
||||
max_users *int
|
||||
addmax_users *int
|
||||
clearedFields map[string]struct{}
|
||||
groups map[int]struct{}
|
||||
removedgroups map[int]struct{}
|
||||
clearedgroups bool
|
||||
predicates []predicate.GroupInfo
|
||||
}
|
||||
|
||||
// NewMutation creates a new Mutation for the GroupInfo entity.
|
||||
func NewMutation(op ent.Op) *Mutation {
|
||||
return &Mutation{
|
||||
op: op,
|
||||
typ: "GroupInfo",
|
||||
clearedFields: make(map[string]struct{}),
|
||||
}
|
||||
}
|
||||
|
||||
// Predicates returns the list of predicates set on the mutation.
|
||||
func (m *Mutation) Predicates() []predicate.GroupInfo {
|
||||
return m.predicates
|
||||
}
|
||||
|
||||
// SetDesc sets the "desc" field.
|
||||
func (m *Mutation) SetDesc(s string) {
|
||||
m.desc = &s
|
||||
}
|
||||
|
||||
// Desc returns the value of the "desc" field in the mutation.
|
||||
func (m *Mutation) Desc() (r string, exists bool) {
|
||||
v := m.desc
|
||||
if v == nil {
|
||||
return
|
||||
}
|
||||
return *v, true
|
||||
}
|
||||
|
||||
// ResetDesc resets all changes to the "desc" field.
|
||||
func (m *Mutation) ResetDesc() {
|
||||
m.desc = nil
|
||||
}
|
||||
|
||||
// SetMaxUsers sets the "max_users" field.
|
||||
func (m *Mutation) SetMaxUsers(i int) {
|
||||
m.max_users = &i
|
||||
m.addmax_users = nil
|
||||
}
|
||||
|
||||
// MaxUsers returns the value of the "max_users" field in the mutation.
|
||||
func (m *Mutation) MaxUsers() (r int, exists bool) {
|
||||
v := m.max_users
|
||||
if v == nil {
|
||||
return
|
||||
}
|
||||
return *v, true
|
||||
}
|
||||
|
||||
// AddMaxUsers adds i to the "max_users" field.
|
||||
func (m *Mutation) AddMaxUsers(i int) {
|
||||
if m.addmax_users != nil {
|
||||
*m.addmax_users += i
|
||||
} else {
|
||||
m.addmax_users = &i
|
||||
}
|
||||
}
|
||||
|
||||
// AddedMaxUsers returns the value that was added to the "max_users" field in this mutation.
|
||||
func (m *Mutation) AddedMaxUsers() (r int, exists bool) {
|
||||
v := m.addmax_users
|
||||
if v == nil {
|
||||
return
|
||||
}
|
||||
return *v, true
|
||||
}
|
||||
|
||||
// ResetMaxUsers resets all changes to the "max_users" field.
|
||||
func (m *Mutation) ResetMaxUsers() {
|
||||
m.max_users = nil
|
||||
m.addmax_users = nil
|
||||
}
|
||||
|
||||
// AddGroupIDs adds the "groups" edge to the Group entity by ids.
|
||||
func (m *Mutation) AddGroupIDs(ids ...int) {
|
||||
if m.groups == nil {
|
||||
m.groups = make(map[int]struct{})
|
||||
}
|
||||
for i := range ids {
|
||||
m.groups[ids[i]] = struct{}{}
|
||||
}
|
||||
}
|
||||
|
||||
// ClearGroups clears the "groups" edge to the Group entity.
|
||||
func (m *Mutation) ClearGroups() {
|
||||
m.clearedgroups = true
|
||||
}
|
||||
|
||||
// GroupsCleared reports if the "groups" edge to the Group entity was cleared.
|
||||
func (m *Mutation) GroupsCleared() bool {
|
||||
return m.clearedgroups
|
||||
}
|
||||
|
||||
// RemoveGroupIDs removes the "groups" edge to the Group entity by IDs.
|
||||
func (m *Mutation) RemoveGroupIDs(ids ...int) {
|
||||
if m.removedgroups == nil {
|
||||
m.removedgroups = make(map[int]struct{})
|
||||
}
|
||||
for i := range ids {
|
||||
delete(m.groups, ids[i])
|
||||
m.removedgroups[ids[i]] = struct{}{}
|
||||
}
|
||||
}
|
||||
|
||||
// RemovedGroups returns the removed IDs of the "groups" edge to the Group entity.
|
||||
func (m *Mutation) RemovedGroupsIDs() (ids []int) {
|
||||
for id := range m.removedgroups {
|
||||
ids = append(ids, id)
|
||||
}
|
||||
return
|
||||
}
|
||||
|
||||
// GroupsIDs returns the "groups" edge IDs in the mutation.
|
||||
func (m *Mutation) GroupsIDs() (ids []int) {
|
||||
for id := range m.groups {
|
||||
ids = append(ids, id)
|
||||
}
|
||||
return
|
||||
}
|
||||
|
||||
// ResetGroups resets all changes to the "groups" edge.
|
||||
func (m *Mutation) ResetGroups() {
|
||||
m.groups = nil
|
||||
m.clearedgroups = false
|
||||
m.removedgroups = nil
|
||||
}
|
||||
|
||||
// Where appends a list predicates to the Mutation builder.
|
||||
func (m *Mutation) Where(ps ...predicate.GroupInfo) {
|
||||
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.GroupInfo, 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 (GroupInfo).
|
||||
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.desc != nil {
|
||||
fields = append(fields, FieldDesc)
|
||||
}
|
||||
if m.max_users != nil {
|
||||
fields = append(fields, FieldMaxUsers)
|
||||
}
|
||||
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 FieldDesc:
|
||||
return m.Desc()
|
||||
case FieldMaxUsers:
|
||||
return m.MaxUsers()
|
||||
}
|
||||
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 GroupInfo 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 FieldDesc:
|
||||
v, ok := value.(string)
|
||||
if !ok {
|
||||
return fmt.Errorf("unexpected type %T for field %s", value, name)
|
||||
}
|
||||
m.SetDesc(v)
|
||||
return nil
|
||||
case FieldMaxUsers:
|
||||
v, ok := value.(int)
|
||||
if !ok {
|
||||
return fmt.Errorf("unexpected type %T for field %s", value, name)
|
||||
}
|
||||
m.SetMaxUsers(v)
|
||||
return nil
|
||||
}
|
||||
return fmt.Errorf("unknown GroupInfo 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.addmax_users != nil {
|
||||
fields = append(fields, FieldMaxUsers)
|
||||
}
|
||||
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 FieldMaxUsers:
|
||||
return m.AddedMaxUsers()
|
||||
}
|
||||
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 FieldMaxUsers:
|
||||
v, ok := value.(int)
|
||||
if !ok {
|
||||
return fmt.Errorf("unexpected type %T for field %s", value, name)
|
||||
}
|
||||
m.AddMaxUsers(v)
|
||||
return nil
|
||||
}
|
||||
return fmt.Errorf("unknown GroupInfo numeric field %s", name)
|
||||
}
|
||||
|
||||
// ClearedFields returns all nullable fields that were cleared during this
|
||||
// mutation.
|
||||
func (m *Mutation) ClearedFields() []string {
|
||||
return nil
|
||||
}
|
||||
|
||||
// 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 {
|
||||
return fmt.Errorf("unknown GroupInfo 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 FieldDesc:
|
||||
m.ResetDesc()
|
||||
return nil
|
||||
case FieldMaxUsers:
|
||||
m.ResetMaxUsers()
|
||||
return nil
|
||||
}
|
||||
return fmt.Errorf("unknown GroupInfo 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.groups != nil {
|
||||
edges = append(edges, EdgeGroups)
|
||||
}
|
||||
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 EdgeGroups:
|
||||
ids := make([]ent.Value, 0, len(m.groups))
|
||||
for id := range m.groups {
|
||||
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, 1)
|
||||
if m.removedgroups != nil {
|
||||
edges = append(edges, EdgeGroups)
|
||||
}
|
||||
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 EdgeGroups:
|
||||
ids := make([]ent.Value, 0, len(m.removedgroups))
|
||||
for id := range m.removedgroups {
|
||||
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, 1)
|
||||
if m.clearedgroups {
|
||||
edges = append(edges, EdgeGroups)
|
||||
}
|
||||
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 EdgeGroups:
|
||||
return m.clearedgroups
|
||||
}
|
||||
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 {
|
||||
}
|
||||
return fmt.Errorf("unknown GroupInfo 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 EdgeGroups:
|
||||
m.ResetGroups()
|
||||
return nil
|
||||
}
|
||||
return fmt.Errorf("unknown GroupInfo edge %s", name)
|
||||
}
|
||||
211
entc/integration/ent/groupinfo/where.go
Normal file
211
entc/integration/ent/groupinfo/where.go
Normal file
@@ -0,0 +1,211 @@
|
||||
// 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 groupinfo
|
||||
|
||||
import (
|
||||
"entgo.io/ent/dialect/sql"
|
||||
"entgo.io/ent/dialect/sql/sqlgraph"
|
||||
"entgo.io/ent/entc/integration/ent/predicate"
|
||||
)
|
||||
|
||||
// ID filters vertices based on their ID field.
|
||||
func ID(id int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldEQ(FieldID, id))
|
||||
}
|
||||
|
||||
// IDEQ applies the EQ predicate on the ID field.
|
||||
func IDEQ(id int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldEQ(FieldID, id))
|
||||
}
|
||||
|
||||
// IDNEQ applies the NEQ predicate on the ID field.
|
||||
func IDNEQ(id int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldNEQ(FieldID, id))
|
||||
}
|
||||
|
||||
// IDIn applies the In predicate on the ID field.
|
||||
func IDIn(ids ...int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldIn(FieldID, ids...))
|
||||
}
|
||||
|
||||
// IDNotIn applies the NotIn predicate on the ID field.
|
||||
func IDNotIn(ids ...int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldNotIn(FieldID, ids...))
|
||||
}
|
||||
|
||||
// IDGT applies the GT predicate on the ID field.
|
||||
func IDGT(id int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldGT(FieldID, id))
|
||||
}
|
||||
|
||||
// IDGTE applies the GTE predicate on the ID field.
|
||||
func IDGTE(id int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldGTE(FieldID, id))
|
||||
}
|
||||
|
||||
// IDLT applies the LT predicate on the ID field.
|
||||
func IDLT(id int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldLT(FieldID, id))
|
||||
}
|
||||
|
||||
// IDLTE applies the LTE predicate on the ID field.
|
||||
func IDLTE(id int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldLTE(FieldID, id))
|
||||
}
|
||||
|
||||
// Desc applies equality check predicate on the "desc" field. It's identical to DescEQ.
|
||||
func Desc(v string) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldEQ(FieldDesc, v))
|
||||
}
|
||||
|
||||
// MaxUsers applies equality check predicate on the "max_users" field. It's identical to MaxUsersEQ.
|
||||
func MaxUsers(v int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldEQ(FieldMaxUsers, v))
|
||||
}
|
||||
|
||||
// DescEQ applies the EQ predicate on the "desc" field.
|
||||
func DescEQ(v string) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldEQ(FieldDesc, v))
|
||||
}
|
||||
|
||||
// DescNEQ applies the NEQ predicate on the "desc" field.
|
||||
func DescNEQ(v string) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldNEQ(FieldDesc, v))
|
||||
}
|
||||
|
||||
// DescIn applies the In predicate on the "desc" field.
|
||||
func DescIn(vs ...string) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldIn(FieldDesc, vs...))
|
||||
}
|
||||
|
||||
// DescNotIn applies the NotIn predicate on the "desc" field.
|
||||
func DescNotIn(vs ...string) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldNotIn(FieldDesc, vs...))
|
||||
}
|
||||
|
||||
// DescGT applies the GT predicate on the "desc" field.
|
||||
func DescGT(v string) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldGT(FieldDesc, v))
|
||||
}
|
||||
|
||||
// DescGTE applies the GTE predicate on the "desc" field.
|
||||
func DescGTE(v string) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldGTE(FieldDesc, v))
|
||||
}
|
||||
|
||||
// DescLT applies the LT predicate on the "desc" field.
|
||||
func DescLT(v string) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldLT(FieldDesc, v))
|
||||
}
|
||||
|
||||
// DescLTE applies the LTE predicate on the "desc" field.
|
||||
func DescLTE(v string) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldLTE(FieldDesc, v))
|
||||
}
|
||||
|
||||
// DescContains applies the Contains predicate on the "desc" field.
|
||||
func DescContains(v string) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldContains(FieldDesc, v))
|
||||
}
|
||||
|
||||
// DescHasPrefix applies the HasPrefix predicate on the "desc" field.
|
||||
func DescHasPrefix(v string) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldHasPrefix(FieldDesc, v))
|
||||
}
|
||||
|
||||
// DescHasSuffix applies the HasSuffix predicate on the "desc" field.
|
||||
func DescHasSuffix(v string) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldHasSuffix(FieldDesc, v))
|
||||
}
|
||||
|
||||
// DescEqualFold applies the EqualFold predicate on the "desc" field.
|
||||
func DescEqualFold(v string) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldEqualFold(FieldDesc, v))
|
||||
}
|
||||
|
||||
// DescContainsFold applies the ContainsFold predicate on the "desc" field.
|
||||
func DescContainsFold(v string) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldContainsFold(FieldDesc, v))
|
||||
}
|
||||
|
||||
// MaxUsersEQ applies the EQ predicate on the "max_users" field.
|
||||
func MaxUsersEQ(v int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldEQ(FieldMaxUsers, v))
|
||||
}
|
||||
|
||||
// MaxUsersNEQ applies the NEQ predicate on the "max_users" field.
|
||||
func MaxUsersNEQ(v int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldNEQ(FieldMaxUsers, v))
|
||||
}
|
||||
|
||||
// MaxUsersIn applies the In predicate on the "max_users" field.
|
||||
func MaxUsersIn(vs ...int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldIn(FieldMaxUsers, vs...))
|
||||
}
|
||||
|
||||
// MaxUsersNotIn applies the NotIn predicate on the "max_users" field.
|
||||
func MaxUsersNotIn(vs ...int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldNotIn(FieldMaxUsers, vs...))
|
||||
}
|
||||
|
||||
// MaxUsersGT applies the GT predicate on the "max_users" field.
|
||||
func MaxUsersGT(v int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldGT(FieldMaxUsers, v))
|
||||
}
|
||||
|
||||
// MaxUsersGTE applies the GTE predicate on the "max_users" field.
|
||||
func MaxUsersGTE(v int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldGTE(FieldMaxUsers, v))
|
||||
}
|
||||
|
||||
// MaxUsersLT applies the LT predicate on the "max_users" field.
|
||||
func MaxUsersLT(v int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldLT(FieldMaxUsers, v))
|
||||
}
|
||||
|
||||
// MaxUsersLTE applies the LTE predicate on the "max_users" field.
|
||||
func MaxUsersLTE(v int) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.FieldLTE(FieldMaxUsers, v))
|
||||
}
|
||||
|
||||
// HasGroups applies the HasEdge predicate on the "groups" edge.
|
||||
func HasGroups() predicate.GroupInfo {
|
||||
return predicate.GroupInfo(func(s *sql.Selector) {
|
||||
step := sqlgraph.NewStep(
|
||||
sqlgraph.From(Table, FieldID),
|
||||
sqlgraph.Edge(sqlgraph.O2M, true, GroupsTable, GroupsColumn),
|
||||
)
|
||||
sqlgraph.HasNeighbors(s, step)
|
||||
})
|
||||
}
|
||||
|
||||
// HasGroupsWith applies the HasEdge predicate on the "groups" edge with a given conditions (other predicates).
|
||||
func HasGroupsWith(preds ...predicate.Group) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(func(s *sql.Selector) {
|
||||
step := newGroupsStep()
|
||||
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.GroupInfo) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.AndPredicates(predicates...))
|
||||
}
|
||||
|
||||
// Or groups predicates with the OR operator between them.
|
||||
func Or(predicates ...predicate.GroupInfo) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.OrPredicates(predicates...))
|
||||
}
|
||||
|
||||
// Not applies the not operator on the given predicate.
|
||||
func Not(p predicate.GroupInfo) predicate.GroupInfo {
|
||||
return predicate.GroupInfo(sql.NotPredicates(p))
|
||||
}
|
||||
Reference in New Issue
Block a user