snapshot of https://github.com/ent/ent.git (master, 2026-09-15; blobs > 131072B omitted)

entc/integration/gremlin/ent/groupinfo/groupinfo.go

@@ -0,0 +1,36 @@
+// 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/gremlin/graph/dsl"
+)
+
+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"
+	// GroupsInverseLabel holds the string label denoting the groups inverse edge type in the database.
+	GroupsInverseLabel = "group_info"
+)
+
+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(*dsl.Traversal)
+
+// comment from another template.

entc/integration/gremlin/ent/groupinfo/mutation.go

@@ -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/gremlin/graph/dsl"
+	"entgo.io/ent/entc/integration/gremlin/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[string]struct{}
+	removedgroups map[string]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 ...string) {
+	if m.groups == nil {
+		m.groups = make(map[string]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 ...string) {
+	if m.removedgroups == nil {
+		m.removedgroups = make(map[string]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 []string) {
+	for id := range m.removedgroups {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// GroupsIDs returns the "groups" edge IDs in the mutation.
+func (m *Mutation) GroupsIDs() (ids []string) {
+	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(*dsl.Traversal)) {
+	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)
+}

entc/integration/gremlin/ent/groupinfo/where.go

@@ -0,0 +1,285 @@
+// 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/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.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.HasID(id)
+	})
+}
+
+// IDEQ applies the EQ predicate on the ID field.
+func IDEQ(id string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.HasID(p.EQ(id))
+	})
+}
+
+// IDNEQ applies the NEQ predicate on the ID field.
+func IDNEQ(id string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.HasID(p.NEQ(id))
+	})
+}
+
+// IDIn applies the In predicate on the ID field.
+func IDIn(ids ...string) predicate.GroupInfo {
+	return predicate.GroupInfo(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.GroupInfo {
+	return predicate.GroupInfo(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.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.HasID(p.GT(id))
+	})
+}
+
+// IDGTE applies the GTE predicate on the ID field.
+func IDGTE(id string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.HasID(p.GTE(id))
+	})
+}
+
+// IDLT applies the LT predicate on the ID field.
+func IDLT(id string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.HasID(p.LT(id))
+	})
+}
+
+// IDLTE applies the LTE predicate on the ID field.
+func IDLTE(id string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.HasID(p.LTE(id))
+	})
+}
+
+// Desc applies equality check predicate on the "desc" field. It's identical to DescEQ.
+func Desc(v string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldDesc, p.EQ(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(func(t *dsl.Traversal) {
+		t.Has(Label, FieldMaxUsers, p.EQ(v))
+	})
+}
+
+// DescEQ applies the EQ predicate on the "desc" field.
+func DescEQ(v string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldDesc, p.EQ(v))
+	})
+}
+
+// DescNEQ applies the NEQ predicate on the "desc" field.
+func DescNEQ(v string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldDesc, p.NEQ(v))
+	})
+}
+
+// DescIn applies the In predicate on the "desc" field.
+func DescIn(vs ...string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldDesc, p.Within(vs...))
+	})
+}
+
+// DescNotIn applies the NotIn predicate on the "desc" field.
+func DescNotIn(vs ...string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldDesc, p.Without(vs...))
+	})
+}
+
+// DescGT applies the GT predicate on the "desc" field.
+func DescGT(v string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldDesc, p.GT(v))
+	})
+}
+
+// DescGTE applies the GTE predicate on the "desc" field.
+func DescGTE(v string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldDesc, p.GTE(v))
+	})
+}
+
+// DescLT applies the LT predicate on the "desc" field.
+func DescLT(v string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldDesc, p.LT(v))
+	})
+}
+
+// DescLTE applies the LTE predicate on the "desc" field.
+func DescLTE(v string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldDesc, p.LTE(v))
+	})
+}
+
+// DescContains applies the Contains predicate on the "desc" field.
+func DescContains(v string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldDesc, p.Containing(v))
+	})
+}
+
+// DescHasPrefix applies the HasPrefix predicate on the "desc" field.
+func DescHasPrefix(v string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldDesc, p.StartingWith(v))
+	})
+}
+
+// DescHasSuffix applies the HasSuffix predicate on the "desc" field.
+func DescHasSuffix(v string) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldDesc, p.EndingWith(v))
+	})
+}
+
+// MaxUsersEQ applies the EQ predicate on the "max_users" field.
+func MaxUsersEQ(v int) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldMaxUsers, p.EQ(v))
+	})
+}
+
+// MaxUsersNEQ applies the NEQ predicate on the "max_users" field.
+func MaxUsersNEQ(v int) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldMaxUsers, p.NEQ(v))
+	})
+}
+
+// MaxUsersIn applies the In predicate on the "max_users" field.
+func MaxUsersIn(vs ...int) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldMaxUsers, p.Within(vs...))
+	})
+}
+
+// MaxUsersNotIn applies the NotIn predicate on the "max_users" field.
+func MaxUsersNotIn(vs ...int) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldMaxUsers, p.Without(vs...))
+	})
+}
+
+// MaxUsersGT applies the GT predicate on the "max_users" field.
+func MaxUsersGT(v int) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldMaxUsers, p.GT(v))
+	})
+}
+
+// MaxUsersGTE applies the GTE predicate on the "max_users" field.
+func MaxUsersGTE(v int) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldMaxUsers, p.GTE(v))
+	})
+}
+
+// MaxUsersLT applies the LT predicate on the "max_users" field.
+func MaxUsersLT(v int) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldMaxUsers, p.LT(v))
+	})
+}
+
+// MaxUsersLTE applies the LTE predicate on the "max_users" field.
+func MaxUsersLTE(v int) predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.Has(Label, FieldMaxUsers, p.LTE(v))
+	})
+}
+
+// HasGroups applies the HasEdge predicate on the "groups" edge.
+func HasGroups() predicate.GroupInfo {
+	return predicate.GroupInfo(func(t *dsl.Traversal) {
+		t.InE(GroupsInverseLabel).InV()
+	})
+}
+
+// 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(t *dsl.Traversal) {
+		tr := __.OutV()
+		for _, p := range preds {
+			p(tr)
+		}
+		t.InE(GroupsInverseLabel).Where(tr).InV()
+	})
+}
+
+// And groups predicates with the AND operator between them.
+func And(predicates ...predicate.GroupInfo) predicate.GroupInfo {
+	return predicate.GroupInfo(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.GroupInfo) predicate.GroupInfo {
+	return predicate.GroupInfo(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.GroupInfo) predicate.GroupInfo {
+	return predicate.GroupInfo(func(tr *dsl.Traversal) {
+		t := __.New()
+		p(t)
+		tr.Where(__.Not(t))
+	})
+}