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

entc/integration/edgeschema/ent/relationship/mutation.go

@@ -0,0 +1,543 @@
+// 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 relationship
+
+import (
+	"context"
+	"errors"
+	"fmt"
+
+	"entgo.io/ent"
+	"entgo.io/ent/dialect/sql"
+	"entgo.io/ent/entc/integration/edgeschema/ent/predicate"
+)
+
+// Mutation represents an operation that mutates the Relationship nodes in the graph.
+type Mutation struct {
+	op              ent.Op
+	typ             string
+	weight          *int
+	addweight       *int
+	clearedFields   map[string]struct{}
+	user            *int
+	cleareduser     bool
+	relative        *int
+	clearedrelative bool
+	info            *int
+	clearedinfo     bool
+	predicates      []predicate.Relationship
+}
+
+// NewMutation creates a new Mutation for the Relationship entity.
+func NewMutation(op ent.Op) *Mutation {
+	return &Mutation{
+		op:            op,
+		typ:           "Relationship",
+		clearedFields: make(map[string]struct{}),
+	}
+}
+
+// Predicates returns the list of predicates set on the mutation.
+func (m *Mutation) Predicates() []predicate.Relationship {
+	return m.predicates
+}
+
+// SetWeight sets the "weight" field.
+func (m *Mutation) SetWeight(i int) {
+	m.weight = &i
+	m.addweight = nil
+}
+
+// Weight returns the value of the "weight" field in the mutation.
+func (m *Mutation) Weight() (r int, exists bool) {
+	v := m.weight
+	if v == nil {
+		return
+	}
+	return *v, true
+}
+
+// AddWeight adds i to the "weight" field.
+func (m *Mutation) AddWeight(i int) {
+	if m.addweight != nil {
+		*m.addweight += i
+	} else {
+		m.addweight = &i
+	}
+}
+
+// AddedWeight returns the value that was added to the "weight" field in this mutation.
+func (m *Mutation) AddedWeight() (r int, exists bool) {
+	v := m.addweight
+	if v == nil {
+		return
+	}
+	return *v, true
+}
+
+// ResetWeight resets all changes to the "weight" field.
+func (m *Mutation) ResetWeight() {
+	m.weight = nil
+	m.addweight = nil
+}
+
+// SetUserID sets the "user_id" field.
+func (m *Mutation) SetUserID(i int) {
+	m.user = &i
+}
+
+// UserID returns the value of the "user_id" field in the mutation.
+func (m *Mutation) UserID() (r int, exists bool) {
+	v := m.user
+	if v == nil {
+		return
+	}
+	return *v, true
+}
+
+// ResetUserID resets all changes to the "user_id" field.
+func (m *Mutation) ResetUserID() {
+	m.user = nil
+}
+
+// SetRelativeID sets the "relative_id" field.
+func (m *Mutation) SetRelativeID(i int) {
+	m.relative = &i
+}
+
+// RelativeID returns the value of the "relative_id" field in the mutation.
+func (m *Mutation) RelativeID() (r int, exists bool) {
+	v := m.relative
+	if v == nil {
+		return
+	}
+	return *v, true
+}
+
+// ResetRelativeID resets all changes to the "relative_id" field.
+func (m *Mutation) ResetRelativeID() {
+	m.relative = nil
+}
+
+// SetInfoID sets the "info_id" field.
+func (m *Mutation) SetInfoID(i int) {
+	m.info = &i
+}
+
+// InfoID returns the value of the "info_id" field in the mutation.
+func (m *Mutation) InfoID() (r int, exists bool) {
+	v := m.info
+	if v == nil {
+		return
+	}
+	return *v, true
+}
+
+// ClearInfoID clears the value of the "info_id" field.
+func (m *Mutation) ClearInfoID() {
+	m.info = nil
+	m.clearedFields[FieldInfoID] = struct{}{}
+}
+
+// InfoIDCleared returns if the "info_id" field was cleared in this mutation.
+func (m *Mutation) InfoIDCleared() bool {
+	_, ok := m.clearedFields[FieldInfoID]
+	return ok
+}
+
+// ResetInfoID resets all changes to the "info_id" field.
+func (m *Mutation) ResetInfoID() {
+	m.info = nil
+	delete(m.clearedFields, FieldInfoID)
+}
+
+// ClearUser clears the "user" edge to the User entity.
+func (m *Mutation) ClearUser() {
+	m.cleareduser = true
+	m.clearedFields[FieldUserID] = struct{}{}
+}
+
+// UserCleared reports if the "user" edge to the User entity was cleared.
+func (m *Mutation) UserCleared() bool {
+	return m.cleareduser
+}
+
+// UserIDs returns the "user" edge IDs in the mutation.
+// Note that IDs always returns len(IDs) <= 1 for unique edges, and you should use
+// UserID instead. It exists only for internal usage by the builders.
+func (m *Mutation) UserIDs() (ids []int) {
+	if id := m.user; id != nil {
+		ids = append(ids, *id)
+	}
+	return
+}
+
+// ResetUser resets all changes to the "user" edge.
+func (m *Mutation) ResetUser() {
+	m.user = nil
+	m.cleareduser = false
+}
+
+// ClearRelative clears the "relative" edge to the User entity.
+func (m *Mutation) ClearRelative() {
+	m.clearedrelative = true
+	m.clearedFields[FieldRelativeID] = struct{}{}
+}
+
+// RelativeCleared reports if the "relative" edge to the User entity was cleared.
+func (m *Mutation) RelativeCleared() bool {
+	return m.clearedrelative
+}
+
+// RelativeIDs returns the "relative" edge IDs in the mutation.
+// Note that IDs always returns len(IDs) <= 1 for unique edges, and you should use
+// RelativeID instead. It exists only for internal usage by the builders.
+func (m *Mutation) RelativeIDs() (ids []int) {
+	if id := m.relative; id != nil {
+		ids = append(ids, *id)
+	}
+	return
+}
+
+// ResetRelative resets all changes to the "relative" edge.
+func (m *Mutation) ResetRelative() {
+	m.relative = nil
+	m.clearedrelative = false
+}
+
+// ClearInfo clears the "info" edge to the RelationshipInfo entity.
+func (m *Mutation) ClearInfo() {
+	m.clearedinfo = true
+	m.clearedFields[FieldInfoID] = struct{}{}
+}
+
+// InfoCleared reports if the "info" edge to the RelationshipInfo entity was cleared.
+func (m *Mutation) InfoCleared() bool {
+	return m.InfoIDCleared() || m.clearedinfo
+}
+
+// InfoIDs returns the "info" edge IDs in the mutation.
+// Note that IDs always returns len(IDs) <= 1 for unique edges, and you should use
+// InfoID instead. It exists only for internal usage by the builders.
+func (m *Mutation) InfoIDs() (ids []int) {
+	if id := m.info; id != nil {
+		ids = append(ids, *id)
+	}
+	return
+}
+
+// ResetInfo resets all changes to the "info" edge.
+func (m *Mutation) ResetInfo() {
+	m.info = nil
+	m.clearedinfo = false
+}
+
+// Where appends a list predicates to the Mutation builder.
+func (m *Mutation) Where(ps ...predicate.Relationship) {
+	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.Relationship, 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 (Relationship).
+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, 4)
+	if m.weight != nil {
+		fields = append(fields, FieldWeight)
+	}
+	if m.user != nil {
+		fields = append(fields, FieldUserID)
+	}
+	if m.relative != nil {
+		fields = append(fields, FieldRelativeID)
+	}
+	if m.info != nil {
+		fields = append(fields, FieldInfoID)
+	}
+	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 FieldWeight:
+		return m.Weight()
+	case FieldUserID:
+		return m.UserID()
+	case FieldRelativeID:
+		return m.RelativeID()
+	case FieldInfoID:
+		return m.InfoID()
+	}
+	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, errors.New("edge schema Relationship does not support getting old values")
+}
+
+// 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 FieldWeight:
+		v, ok := value.(int)
+		if !ok {
+			return fmt.Errorf("unexpected type %T for field %s", value, name)
+		}
+		m.SetWeight(v)
+		return nil
+	case FieldUserID:
+		v, ok := value.(int)
+		if !ok {
+			return fmt.Errorf("unexpected type %T for field %s", value, name)
+		}
+		m.SetUserID(v)
+		return nil
+	case FieldRelativeID:
+		v, ok := value.(int)
+		if !ok {
+			return fmt.Errorf("unexpected type %T for field %s", value, name)
+		}
+		m.SetRelativeID(v)
+		return nil
+	case FieldInfoID:
+		v, ok := value.(int)
+		if !ok {
+			return fmt.Errorf("unexpected type %T for field %s", value, name)
+		}
+		m.SetInfoID(v)
+		return nil
+	}
+	return fmt.Errorf("unknown Relationship 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.addweight != nil {
+		fields = append(fields, FieldWeight)
+	}
+	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 FieldWeight:
+		return m.AddedWeight()
+	}
+	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 FieldWeight:
+		v, ok := value.(int)
+		if !ok {
+			return fmt.Errorf("unexpected type %T for field %s", value, name)
+		}
+		m.AddWeight(v)
+		return nil
+	}
+	return fmt.Errorf("unknown Relationship 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(FieldInfoID) {
+		fields = append(fields, FieldInfoID)
+	}
+	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 FieldInfoID:
+		m.ClearInfoID()
+		return nil
+	}
+	return fmt.Errorf("unknown Relationship 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 FieldWeight:
+		m.ResetWeight()
+		return nil
+	case FieldUserID:
+		m.ResetUserID()
+		return nil
+	case FieldRelativeID:
+		m.ResetRelativeID()
+		return nil
+	case FieldInfoID:
+		m.ResetInfoID()
+		return nil
+	}
+	return fmt.Errorf("unknown Relationship field %s", name)
+}
+
+// AddedEdges returns all edge names that were set/added in this mutation.
+func (m *Mutation) AddedEdges() []string {
+	edges := make([]string, 0, 3)
+	if m.user != nil {
+		edges = append(edges, EdgeUser)
+	}
+	if m.relative != nil {
+		edges = append(edges, EdgeRelative)
+	}
+	if m.info != nil {
+		edges = append(edges, EdgeInfo)
+	}
+	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 EdgeUser:
+		if id := m.user; id != nil {
+			return []ent.Value{*id}
+		}
+	case EdgeRelative:
+		if id := m.relative; id != nil {
+			return []ent.Value{*id}
+		}
+	case EdgeInfo:
+		if id := m.info; id != nil {
+			return []ent.Value{*id}
+		}
+	}
+	return nil
+}
+
+// RemovedEdges returns all edge names that were removed in this mutation.
+func (m *Mutation) RemovedEdges() []string {
+	edges := make([]string, 0, 3)
+	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 {
+	return nil
+}
+
+// ClearedEdges returns all edge names that were cleared in this mutation.
+func (m *Mutation) ClearedEdges() []string {
+	edges := make([]string, 0, 3)
+	if m.cleareduser {
+		edges = append(edges, EdgeUser)
+	}
+	if m.clearedrelative {
+		edges = append(edges, EdgeRelative)
+	}
+	if m.clearedinfo {
+		edges = append(edges, EdgeInfo)
+	}
+	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 EdgeUser:
+		return m.cleareduser
+	case EdgeRelative:
+		return m.clearedrelative
+	case EdgeInfo:
+		return m.clearedinfo
+	}
+	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 EdgeUser:
+		m.ClearUser()
+		return nil
+	case EdgeRelative:
+		m.ClearRelative()
+		return nil
+	case EdgeInfo:
+		m.ClearInfo()
+		return nil
+	}
+	return fmt.Errorf("unknown Relationship 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 EdgeUser:
+		m.ResetUser()
+		return nil
+	case EdgeRelative:
+		m.ResetRelative()
+		return nil
+	case EdgeInfo:
+		m.ResetInfo()
+		return nil
+	}
+	return fmt.Errorf("unknown Relationship edge %s", name)
+}

entc/integration/edgeschema/ent/relationship/relationship.go

@@ -0,0 +1,154 @@
+// 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 relationship
+
+import (
+	"entgo.io/ent"
+	"entgo.io/ent/dialect/sql"
+	"entgo.io/ent/dialect/sql/sqlgraph"
+)
+
+const (
+	// Label holds the string label denoting the relationship type in the database.
+	Label = "relationship"
+	// FieldWeight holds the string denoting the weight field in the database.
+	FieldWeight = "weight"
+	// FieldUserID holds the string denoting the user_id field in the database.
+	FieldUserID = "user_id"
+	// FieldRelativeID holds the string denoting the relative_id field in the database.
+	FieldRelativeID = "relative_id"
+	// FieldInfoID holds the string denoting the info_id field in the database.
+	FieldInfoID = "info_id"
+	// EdgeUser holds the string denoting the user edge name in mutations.
+	EdgeUser = "user"
+	// EdgeRelative holds the string denoting the relative edge name in mutations.
+	EdgeRelative = "relative"
+	// EdgeInfo holds the string denoting the info edge name in mutations.
+	EdgeInfo = "info"
+	// UserFieldID holds the string denoting the ID field of the User.
+	UserFieldID = "id"
+	// RelationshipInfoFieldID holds the string denoting the ID field of the RelationshipInfo.
+	RelationshipInfoFieldID = "id"
+	// Table holds the table name of the relationship in the database.
+	Table = "relationships"
+	// UserTable is the table that holds the user relation/edge.
+	UserTable = "relationships"
+	// UserInverseTable is the table name for the User entity.
+	// It exists in this package in order to avoid circular dependency with the "user" package.
+	UserInverseTable = "users"
+	// UserColumn is the table column denoting the user relation/edge.
+	UserColumn = "user_id"
+	// RelativeTable is the table that holds the relative relation/edge.
+	RelativeTable = "relationships"
+	// RelativeInverseTable is the table name for the User entity.
+	// It exists in this package in order to avoid circular dependency with the "user" package.
+	RelativeInverseTable = "users"
+	// RelativeColumn is the table column denoting the relative relation/edge.
+	RelativeColumn = "relative_id"
+	// InfoTable is the table that holds the info relation/edge.
+	InfoTable = "relationships"
+	// InfoInverseTable is the table name for the RelationshipInfo entity.
+	// It exists in this package in order to avoid circular dependency with the "relationshipinfo" package.
+	InfoInverseTable = "relationship_infos"
+	// InfoColumn is the table column denoting the info relation/edge.
+	InfoColumn = "info_id"
+)
+
+// Columns holds all SQL columns for relationship fields.
+var Columns = []string{
+	FieldWeight,
+	FieldUserID,
+	FieldRelativeID,
+	FieldInfoID,
+}
+
+// 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
+}
+
+// Note that the variables below are initialized by the runtime
+// package on the initialization of the application. Therefore,
+// it should be imported in the main as follows:
+//
+//	import _ "entgo.io/ent/entc/integration/edgeschema/ent/runtime"
+var (
+	Hooks  [1]ent.Hook
+	Policy ent.Policy
+	// DefaultWeight holds the default value on creation for the "weight" field.
+	DefaultWeight int
+)
+
+// OrderOption defines the ordering options for the Relationship queries.
+type OrderOption func(*sql.Selector)
+
+// ByWeight orders the results by the weight field.
+func ByWeight(opts ...sql.OrderTermOption) OrderOption {
+	return sql.OrderByField(FieldWeight, opts...).ToFunc()
+}
+
+// ByUserID orders the results by the user_id field.
+func ByUserID(opts ...sql.OrderTermOption) OrderOption {
+	return sql.OrderByField(FieldUserID, opts...).ToFunc()
+}
+
+// ByRelativeID orders the results by the relative_id field.
+func ByRelativeID(opts ...sql.OrderTermOption) OrderOption {
+	return sql.OrderByField(FieldRelativeID, opts...).ToFunc()
+}
+
+// ByInfoID orders the results by the info_id field.
+func ByInfoID(opts ...sql.OrderTermOption) OrderOption {
+	return sql.OrderByField(FieldInfoID, opts...).ToFunc()
+}
+
+// ByUserField orders the results by user field.
+func ByUserField(field string, opts ...sql.OrderTermOption) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborTerms(s, newUserStep(), sql.OrderByField(field, opts...))
+	}
+}
+
+// ByRelativeField orders the results by relative field.
+func ByRelativeField(field string, opts ...sql.OrderTermOption) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborTerms(s, newRelativeStep(), sql.OrderByField(field, opts...))
+	}
+}
+
+// ByInfoField orders the results by info field.
+func ByInfoField(field string, opts ...sql.OrderTermOption) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborTerms(s, newInfoStep(), sql.OrderByField(field, opts...))
+	}
+}
+func newUserStep() *sqlgraph.Step {
+	return sqlgraph.NewStep(
+		sqlgraph.From(Table, UserColumn),
+		sqlgraph.To(UserInverseTable, UserFieldID),
+		sqlgraph.Edge(sqlgraph.M2O, false, UserTable, UserColumn),
+	)
+}
+func newRelativeStep() *sqlgraph.Step {
+	return sqlgraph.NewStep(
+		sqlgraph.From(Table, RelativeColumn),
+		sqlgraph.To(RelativeInverseTable, UserFieldID),
+		sqlgraph.Edge(sqlgraph.M2O, false, RelativeTable, RelativeColumn),
+	)
+}
+func newInfoStep() *sqlgraph.Step {
+	return sqlgraph.NewStep(
+		sqlgraph.From(Table, InfoColumn),
+		sqlgraph.To(InfoInverseTable, RelationshipInfoFieldID),
+		sqlgraph.Edge(sqlgraph.M2O, false, InfoTable, InfoColumn),
+	)
+}

entc/integration/edgeschema/ent/relationship/where.go

@@ -0,0 +1,227 @@
+// 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 relationship
+
+import (
+	"entgo.io/ent/dialect/sql"
+	"entgo.io/ent/dialect/sql/sqlgraph"
+	"entgo.io/ent/entc/integration/edgeschema/ent/predicate"
+)
+
+// Weight applies equality check predicate on the "weight" field. It's identical to WeightEQ.
+func Weight(v int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldEQ(FieldWeight, v))
+}
+
+// UserID applies equality check predicate on the "user_id" field. It's identical to UserIDEQ.
+func UserID(v int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldEQ(FieldUserID, v))
+}
+
+// RelativeID applies equality check predicate on the "relative_id" field. It's identical to RelativeIDEQ.
+func RelativeID(v int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldEQ(FieldRelativeID, v))
+}
+
+// InfoID applies equality check predicate on the "info_id" field. It's identical to InfoIDEQ.
+func InfoID(v int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldEQ(FieldInfoID, v))
+}
+
+// WeightEQ applies the EQ predicate on the "weight" field.
+func WeightEQ(v int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldEQ(FieldWeight, v))
+}
+
+// WeightNEQ applies the NEQ predicate on the "weight" field.
+func WeightNEQ(v int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldNEQ(FieldWeight, v))
+}
+
+// WeightIn applies the In predicate on the "weight" field.
+func WeightIn(vs ...int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldIn(FieldWeight, vs...))
+}
+
+// WeightNotIn applies the NotIn predicate on the "weight" field.
+func WeightNotIn(vs ...int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldNotIn(FieldWeight, vs...))
+}
+
+// WeightGT applies the GT predicate on the "weight" field.
+func WeightGT(v int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldGT(FieldWeight, v))
+}
+
+// WeightGTE applies the GTE predicate on the "weight" field.
+func WeightGTE(v int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldGTE(FieldWeight, v))
+}
+
+// WeightLT applies the LT predicate on the "weight" field.
+func WeightLT(v int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldLT(FieldWeight, v))
+}
+
+// WeightLTE applies the LTE predicate on the "weight" field.
+func WeightLTE(v int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldLTE(FieldWeight, v))
+}
+
+// UserIDEQ applies the EQ predicate on the "user_id" field.
+func UserIDEQ(v int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldEQ(FieldUserID, v))
+}
+
+// UserIDNEQ applies the NEQ predicate on the "user_id" field.
+func UserIDNEQ(v int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldNEQ(FieldUserID, v))
+}
+
+// UserIDIn applies the In predicate on the "user_id" field.
+func UserIDIn(vs ...int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldIn(FieldUserID, vs...))
+}
+
+// UserIDNotIn applies the NotIn predicate on the "user_id" field.
+func UserIDNotIn(vs ...int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldNotIn(FieldUserID, vs...))
+}
+
+// RelativeIDEQ applies the EQ predicate on the "relative_id" field.
+func RelativeIDEQ(v int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldEQ(FieldRelativeID, v))
+}
+
+// RelativeIDNEQ applies the NEQ predicate on the "relative_id" field.
+func RelativeIDNEQ(v int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldNEQ(FieldRelativeID, v))
+}
+
+// RelativeIDIn applies the In predicate on the "relative_id" field.
+func RelativeIDIn(vs ...int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldIn(FieldRelativeID, vs...))
+}
+
+// RelativeIDNotIn applies the NotIn predicate on the "relative_id" field.
+func RelativeIDNotIn(vs ...int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldNotIn(FieldRelativeID, vs...))
+}
+
+// InfoIDEQ applies the EQ predicate on the "info_id" field.
+func InfoIDEQ(v int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldEQ(FieldInfoID, v))
+}
+
+// InfoIDNEQ applies the NEQ predicate on the "info_id" field.
+func InfoIDNEQ(v int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldNEQ(FieldInfoID, v))
+}
+
+// InfoIDIn applies the In predicate on the "info_id" field.
+func InfoIDIn(vs ...int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldIn(FieldInfoID, vs...))
+}
+
+// InfoIDNotIn applies the NotIn predicate on the "info_id" field.
+func InfoIDNotIn(vs ...int) predicate.Relationship {
+	return predicate.Relationship(sql.FieldNotIn(FieldInfoID, vs...))
+}
+
+// InfoIDIsNil applies the IsNil predicate on the "info_id" field.
+func InfoIDIsNil() predicate.Relationship {
+	return predicate.Relationship(sql.FieldIsNull(FieldInfoID))
+}
+
+// InfoIDNotNil applies the NotNil predicate on the "info_id" field.
+func InfoIDNotNil() predicate.Relationship {
+	return predicate.Relationship(sql.FieldNotNull(FieldInfoID))
+}
+
+// HasUser applies the HasEdge predicate on the "user" edge.
+func HasUser() predicate.Relationship {
+	return predicate.Relationship(func(s *sql.Selector) {
+		step := sqlgraph.NewStep(
+			sqlgraph.From(Table, UserColumn),
+			sqlgraph.Edge(sqlgraph.M2O, false, UserTable, UserColumn),
+		)
+		sqlgraph.HasNeighbors(s, step)
+	})
+}
+
+// HasUserWith applies the HasEdge predicate on the "user" edge with a given conditions (other predicates).
+func HasUserWith(preds ...predicate.User) predicate.Relationship {
+	return predicate.Relationship(func(s *sql.Selector) {
+		step := newUserStep()
+		sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
+			for _, p := range preds {
+				p(s)
+			}
+		})
+	})
+}
+
+// HasRelative applies the HasEdge predicate on the "relative" edge.
+func HasRelative() predicate.Relationship {
+	return predicate.Relationship(func(s *sql.Selector) {
+		step := sqlgraph.NewStep(
+			sqlgraph.From(Table, RelativeColumn),
+			sqlgraph.Edge(sqlgraph.M2O, false, RelativeTable, RelativeColumn),
+		)
+		sqlgraph.HasNeighbors(s, step)
+	})
+}
+
+// HasRelativeWith applies the HasEdge predicate on the "relative" edge with a given conditions (other predicates).
+func HasRelativeWith(preds ...predicate.User) predicate.Relationship {
+	return predicate.Relationship(func(s *sql.Selector) {
+		step := newRelativeStep()
+		sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
+			for _, p := range preds {
+				p(s)
+			}
+		})
+	})
+}
+
+// HasInfo applies the HasEdge predicate on the "info" edge.
+func HasInfo() predicate.Relationship {
+	return predicate.Relationship(func(s *sql.Selector) {
+		step := sqlgraph.NewStep(
+			sqlgraph.From(Table, InfoColumn),
+			sqlgraph.Edge(sqlgraph.M2O, false, InfoTable, InfoColumn),
+		)
+		sqlgraph.HasNeighbors(s, step)
+	})
+}
+
+// HasInfoWith applies the HasEdge predicate on the "info" edge with a given conditions (other predicates).
+func HasInfoWith(preds ...predicate.RelationshipInfo) predicate.Relationship {
+	return predicate.Relationship(func(s *sql.Selector) {
+		step := newInfoStep()
+		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.Relationship) predicate.Relationship {
+	return predicate.Relationship(sql.AndPredicates(predicates...))
+}
+
+// Or groups predicates with the OR operator between them.
+func Or(predicates ...predicate.Relationship) predicate.Relationship {
+	return predicate.Relationship(sql.OrPredicates(predicates...))
+}
+
+// Not applies the not operator on the given predicate.
+func Not(p predicate.Relationship) predicate.Relationship {
+	return predicate.Relationship(sql.NotPredicates(p))
+}