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

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

@@ -0,0 +1,990 @@
+// 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 user
+
+import (
+	"context"
+	"fmt"
+
+	"entgo.io/ent"
+	"entgo.io/ent/dialect/sql"
+	"entgo.io/ent/entc/integration/edgeschema/ent/predicate"
+)
+
+// Mutation represents an operation that mutates the User nodes in the graph.
+type Mutation struct {
+	op                   ent.Op
+	typ                  string
+	name                 *string
+	clearedFields        map[string]struct{}
+	groups               map[int]struct{}
+	removedgroups        map[int]struct{}
+	clearedgroups        bool
+	friends              map[int]struct{}
+	removedfriends       map[int]struct{}
+	clearedfriends       bool
+	relatives            map[int]struct{}
+	removedrelatives     map[int]struct{}
+	clearedrelatives     bool
+	liked_tweets         map[int]struct{}
+	removedliked_tweets  map[int]struct{}
+	clearedliked_tweets  bool
+	tweets               map[int]struct{}
+	removedtweets        map[int]struct{}
+	clearedtweets        bool
+	roles                map[int]struct{}
+	removedroles         map[int]struct{}
+	clearedroles         bool
+	joined_groups        map[int]struct{}
+	removedjoined_groups map[int]struct{}
+	clearedjoined_groups bool
+	friendships          map[int]struct{}
+	removedfriendships   map[int]struct{}
+	clearedfriendships   bool
+	user_tweets          map[int]struct{}
+	removeduser_tweets   map[int]struct{}
+	cleareduser_tweets   bool
+	predicates           []predicate.User
+}
+
+// NewMutation creates a new Mutation for the User entity.
+func NewMutation(op ent.Op) *Mutation {
+	return &Mutation{
+		op:            op,
+		typ:           "User",
+		clearedFields: make(map[string]struct{}),
+	}
+}
+
+// Predicates returns the list of predicates set on the mutation.
+func (m *Mutation) Predicates() []predicate.User {
+	return m.predicates
+}
+
+// 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
+}
+
+// ResetName resets all changes to the "name" field.
+func (m *Mutation) ResetName() {
+	m.name = 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
+}
+
+// AddFriendIDs adds the "friends" edge to the User entity by ids.
+func (m *Mutation) AddFriendIDs(ids ...int) {
+	if m.friends == nil {
+		m.friends = make(map[int]struct{})
+	}
+	for i := range ids {
+		m.friends[ids[i]] = struct{}{}
+	}
+}
+
+// ClearFriends clears the "friends" edge to the User entity.
+func (m *Mutation) ClearFriends() {
+	m.clearedfriends = true
+}
+
+// FriendsCleared reports if the "friends" edge to the User entity was cleared.
+func (m *Mutation) FriendsCleared() bool {
+	return m.clearedfriends
+}
+
+// RemoveFriendIDs removes the "friends" edge to the User entity by IDs.
+func (m *Mutation) RemoveFriendIDs(ids ...int) {
+	if m.removedfriends == nil {
+		m.removedfriends = make(map[int]struct{})
+	}
+	for i := range ids {
+		delete(m.friends, ids[i])
+		m.removedfriends[ids[i]] = struct{}{}
+	}
+}
+
+// RemovedFriends returns the removed IDs of the "friends" edge to the User entity.
+func (m *Mutation) RemovedFriendsIDs() (ids []int) {
+	for id := range m.removedfriends {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// FriendsIDs returns the "friends" edge IDs in the mutation.
+func (m *Mutation) FriendsIDs() (ids []int) {
+	for id := range m.friends {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// ResetFriends resets all changes to the "friends" edge.
+func (m *Mutation) ResetFriends() {
+	m.friends = nil
+	m.clearedfriends = false
+	m.removedfriends = nil
+}
+
+// AddRelativeIDs adds the "relatives" edge to the User entity by ids.
+func (m *Mutation) AddRelativeIDs(ids ...int) {
+	if m.relatives == nil {
+		m.relatives = make(map[int]struct{})
+	}
+	for i := range ids {
+		m.relatives[ids[i]] = struct{}{}
+	}
+}
+
+// ClearRelatives clears the "relatives" edge to the User entity.
+func (m *Mutation) ClearRelatives() {
+	m.clearedrelatives = true
+}
+
+// RelativesCleared reports if the "relatives" edge to the User entity was cleared.
+func (m *Mutation) RelativesCleared() bool {
+	return m.clearedrelatives
+}
+
+// RemoveRelativeIDs removes the "relatives" edge to the User entity by IDs.
+func (m *Mutation) RemoveRelativeIDs(ids ...int) {
+	if m.removedrelatives == nil {
+		m.removedrelatives = make(map[int]struct{})
+	}
+	for i := range ids {
+		delete(m.relatives, ids[i])
+		m.removedrelatives[ids[i]] = struct{}{}
+	}
+}
+
+// RemovedRelatives returns the removed IDs of the "relatives" edge to the User entity.
+func (m *Mutation) RemovedRelativesIDs() (ids []int) {
+	for id := range m.removedrelatives {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// RelativesIDs returns the "relatives" edge IDs in the mutation.
+func (m *Mutation) RelativesIDs() (ids []int) {
+	for id := range m.relatives {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// ResetRelatives resets all changes to the "relatives" edge.
+func (m *Mutation) ResetRelatives() {
+	m.relatives = nil
+	m.clearedrelatives = false
+	m.removedrelatives = nil
+}
+
+// AddLikedTweetIDs adds the "liked_tweets" edge to the Tweet entity by ids.
+func (m *Mutation) AddLikedTweetIDs(ids ...int) {
+	if m.liked_tweets == nil {
+		m.liked_tweets = make(map[int]struct{})
+	}
+	for i := range ids {
+		m.liked_tweets[ids[i]] = struct{}{}
+	}
+}
+
+// ClearLikedTweets clears the "liked_tweets" edge to the Tweet entity.
+func (m *Mutation) ClearLikedTweets() {
+	m.clearedliked_tweets = true
+}
+
+// LikedTweetsCleared reports if the "liked_tweets" edge to the Tweet entity was cleared.
+func (m *Mutation) LikedTweetsCleared() bool {
+	return m.clearedliked_tweets
+}
+
+// RemoveLikedTweetIDs removes the "liked_tweets" edge to the Tweet entity by IDs.
+func (m *Mutation) RemoveLikedTweetIDs(ids ...int) {
+	if m.removedliked_tweets == nil {
+		m.removedliked_tweets = make(map[int]struct{})
+	}
+	for i := range ids {
+		delete(m.liked_tweets, ids[i])
+		m.removedliked_tweets[ids[i]] = struct{}{}
+	}
+}
+
+// RemovedLikedTweets returns the removed IDs of the "liked_tweets" edge to the Tweet entity.
+func (m *Mutation) RemovedLikedTweetsIDs() (ids []int) {
+	for id := range m.removedliked_tweets {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// LikedTweetsIDs returns the "liked_tweets" edge IDs in the mutation.
+func (m *Mutation) LikedTweetsIDs() (ids []int) {
+	for id := range m.liked_tweets {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// ResetLikedTweets resets all changes to the "liked_tweets" edge.
+func (m *Mutation) ResetLikedTweets() {
+	m.liked_tweets = nil
+	m.clearedliked_tweets = false
+	m.removedliked_tweets = nil
+}
+
+// AddTweetIDs adds the "tweets" edge to the Tweet entity by ids.
+func (m *Mutation) AddTweetIDs(ids ...int) {
+	if m.tweets == nil {
+		m.tweets = make(map[int]struct{})
+	}
+	for i := range ids {
+		m.tweets[ids[i]] = struct{}{}
+	}
+}
+
+// ClearTweets clears the "tweets" edge to the Tweet entity.
+func (m *Mutation) ClearTweets() {
+	m.clearedtweets = true
+}
+
+// TweetsCleared reports if the "tweets" edge to the Tweet entity was cleared.
+func (m *Mutation) TweetsCleared() bool {
+	return m.clearedtweets
+}
+
+// RemoveTweetIDs removes the "tweets" edge to the Tweet entity by IDs.
+func (m *Mutation) RemoveTweetIDs(ids ...int) {
+	if m.removedtweets == nil {
+		m.removedtweets = make(map[int]struct{})
+	}
+	for i := range ids {
+		delete(m.tweets, ids[i])
+		m.removedtweets[ids[i]] = struct{}{}
+	}
+}
+
+// RemovedTweets returns the removed IDs of the "tweets" edge to the Tweet entity.
+func (m *Mutation) RemovedTweetsIDs() (ids []int) {
+	for id := range m.removedtweets {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// TweetsIDs returns the "tweets" edge IDs in the mutation.
+func (m *Mutation) TweetsIDs() (ids []int) {
+	for id := range m.tweets {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// ResetTweets resets all changes to the "tweets" edge.
+func (m *Mutation) ResetTweets() {
+	m.tweets = nil
+	m.clearedtweets = false
+	m.removedtweets = nil
+}
+
+// AddRoleIDs adds the "roles" edge to the Role entity by ids.
+func (m *Mutation) AddRoleIDs(ids ...int) {
+	if m.roles == nil {
+		m.roles = make(map[int]struct{})
+	}
+	for i := range ids {
+		m.roles[ids[i]] = struct{}{}
+	}
+}
+
+// ClearRoles clears the "roles" edge to the Role entity.
+func (m *Mutation) ClearRoles() {
+	m.clearedroles = true
+}
+
+// RolesCleared reports if the "roles" edge to the Role entity was cleared.
+func (m *Mutation) RolesCleared() bool {
+	return m.clearedroles
+}
+
+// RemoveRoleIDs removes the "roles" edge to the Role entity by IDs.
+func (m *Mutation) RemoveRoleIDs(ids ...int) {
+	if m.removedroles == nil {
+		m.removedroles = make(map[int]struct{})
+	}
+	for i := range ids {
+		delete(m.roles, ids[i])
+		m.removedroles[ids[i]] = struct{}{}
+	}
+}
+
+// RemovedRoles returns the removed IDs of the "roles" edge to the Role entity.
+func (m *Mutation) RemovedRolesIDs() (ids []int) {
+	for id := range m.removedroles {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// RolesIDs returns the "roles" edge IDs in the mutation.
+func (m *Mutation) RolesIDs() (ids []int) {
+	for id := range m.roles {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// ResetRoles resets all changes to the "roles" edge.
+func (m *Mutation) ResetRoles() {
+	m.roles = nil
+	m.clearedroles = false
+	m.removedroles = nil
+}
+
+// AddJoinedGroupIDs adds the "joined_groups" edge to the UserGroup entity by ids.
+func (m *Mutation) AddJoinedGroupIDs(ids ...int) {
+	if m.joined_groups == nil {
+		m.joined_groups = make(map[int]struct{})
+	}
+	for i := range ids {
+		m.joined_groups[ids[i]] = struct{}{}
+	}
+}
+
+// ClearJoinedGroups clears the "joined_groups" edge to the UserGroup entity.
+func (m *Mutation) ClearJoinedGroups() {
+	m.clearedjoined_groups = true
+}
+
+// JoinedGroupsCleared reports if the "joined_groups" edge to the UserGroup entity was cleared.
+func (m *Mutation) JoinedGroupsCleared() bool {
+	return m.clearedjoined_groups
+}
+
+// RemoveJoinedGroupIDs removes the "joined_groups" edge to the UserGroup entity by IDs.
+func (m *Mutation) RemoveJoinedGroupIDs(ids ...int) {
+	if m.removedjoined_groups == nil {
+		m.removedjoined_groups = make(map[int]struct{})
+	}
+	for i := range ids {
+		delete(m.joined_groups, ids[i])
+		m.removedjoined_groups[ids[i]] = struct{}{}
+	}
+}
+
+// RemovedJoinedGroups returns the removed IDs of the "joined_groups" edge to the UserGroup entity.
+func (m *Mutation) RemovedJoinedGroupsIDs() (ids []int) {
+	for id := range m.removedjoined_groups {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// JoinedGroupsIDs returns the "joined_groups" edge IDs in the mutation.
+func (m *Mutation) JoinedGroupsIDs() (ids []int) {
+	for id := range m.joined_groups {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// ResetJoinedGroups resets all changes to the "joined_groups" edge.
+func (m *Mutation) ResetJoinedGroups() {
+	m.joined_groups = nil
+	m.clearedjoined_groups = false
+	m.removedjoined_groups = nil
+}
+
+// AddFriendshipIDs adds the "friendships" edge to the Friendship entity by ids.
+func (m *Mutation) AddFriendshipIDs(ids ...int) {
+	if m.friendships == nil {
+		m.friendships = make(map[int]struct{})
+	}
+	for i := range ids {
+		m.friendships[ids[i]] = struct{}{}
+	}
+}
+
+// ClearFriendships clears the "friendships" edge to the Friendship entity.
+func (m *Mutation) ClearFriendships() {
+	m.clearedfriendships = true
+}
+
+// FriendshipsCleared reports if the "friendships" edge to the Friendship entity was cleared.
+func (m *Mutation) FriendshipsCleared() bool {
+	return m.clearedfriendships
+}
+
+// RemoveFriendshipIDs removes the "friendships" edge to the Friendship entity by IDs.
+func (m *Mutation) RemoveFriendshipIDs(ids ...int) {
+	if m.removedfriendships == nil {
+		m.removedfriendships = make(map[int]struct{})
+	}
+	for i := range ids {
+		delete(m.friendships, ids[i])
+		m.removedfriendships[ids[i]] = struct{}{}
+	}
+}
+
+// RemovedFriendships returns the removed IDs of the "friendships" edge to the Friendship entity.
+func (m *Mutation) RemovedFriendshipsIDs() (ids []int) {
+	for id := range m.removedfriendships {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// FriendshipsIDs returns the "friendships" edge IDs in the mutation.
+func (m *Mutation) FriendshipsIDs() (ids []int) {
+	for id := range m.friendships {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// ResetFriendships resets all changes to the "friendships" edge.
+func (m *Mutation) ResetFriendships() {
+	m.friendships = nil
+	m.clearedfriendships = false
+	m.removedfriendships = nil
+}
+
+// AddUserTweetIDs adds the "user_tweets" edge to the UserTweet entity by ids.
+func (m *Mutation) AddUserTweetIDs(ids ...int) {
+	if m.user_tweets == nil {
+		m.user_tweets = make(map[int]struct{})
+	}
+	for i := range ids {
+		m.user_tweets[ids[i]] = struct{}{}
+	}
+}
+
+// ClearUserTweets clears the "user_tweets" edge to the UserTweet entity.
+func (m *Mutation) ClearUserTweets() {
+	m.cleareduser_tweets = true
+}
+
+// UserTweetsCleared reports if the "user_tweets" edge to the UserTweet entity was cleared.
+func (m *Mutation) UserTweetsCleared() bool {
+	return m.cleareduser_tweets
+}
+
+// RemoveUserTweetIDs removes the "user_tweets" edge to the UserTweet entity by IDs.
+func (m *Mutation) RemoveUserTweetIDs(ids ...int) {
+	if m.removeduser_tweets == nil {
+		m.removeduser_tweets = make(map[int]struct{})
+	}
+	for i := range ids {
+		delete(m.user_tweets, ids[i])
+		m.removeduser_tweets[ids[i]] = struct{}{}
+	}
+}
+
+// RemovedUserTweets returns the removed IDs of the "user_tweets" edge to the UserTweet entity.
+func (m *Mutation) RemovedUserTweetsIDs() (ids []int) {
+	for id := range m.removeduser_tweets {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// UserTweetsIDs returns the "user_tweets" edge IDs in the mutation.
+func (m *Mutation) UserTweetsIDs() (ids []int) {
+	for id := range m.user_tweets {
+		ids = append(ids, id)
+	}
+	return
+}
+
+// ResetUserTweets resets all changes to the "user_tweets" edge.
+func (m *Mutation) ResetUserTweets() {
+	m.user_tweets = nil
+	m.cleareduser_tweets = false
+	m.removeduser_tweets = nil
+}
+
+// Where appends a list predicates to the Mutation builder.
+func (m *Mutation) Where(ps ...predicate.User) {
+	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.User, 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 (User).
+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, 1)
+	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 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 User 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 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 User field %s", name)
+}
+
+// AddedFields returns all numeric fields that were incremented/decremented during
+// this mutation.
+func (m *Mutation) AddedFields() []string {
+	return nil
+}
+
+// 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) {
+	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 {
+	}
+	return fmt.Errorf("unknown User 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 User 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 FieldName:
+		m.ResetName()
+		return nil
+	}
+	return fmt.Errorf("unknown User field %s", name)
+}
+
+// AddedEdges returns all edge names that were set/added in this mutation.
+func (m *Mutation) AddedEdges() []string {
+	edges := make([]string, 0, 9)
+	if m.groups != nil {
+		edges = append(edges, EdgeGroups)
+	}
+	if m.friends != nil {
+		edges = append(edges, EdgeFriends)
+	}
+	if m.relatives != nil {
+		edges = append(edges, EdgeRelatives)
+	}
+	if m.liked_tweets != nil {
+		edges = append(edges, EdgeLikedTweets)
+	}
+	if m.tweets != nil {
+		edges = append(edges, EdgeTweets)
+	}
+	if m.roles != nil {
+		edges = append(edges, EdgeRoles)
+	}
+	if m.joined_groups != nil {
+		edges = append(edges, EdgeJoinedGroups)
+	}
+	if m.friendships != nil {
+		edges = append(edges, EdgeFriendships)
+	}
+	if m.user_tweets != nil {
+		edges = append(edges, EdgeUserTweets)
+	}
+	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
+	case EdgeFriends:
+		ids := make([]ent.Value, 0, len(m.friends))
+		for id := range m.friends {
+			ids = append(ids, id)
+		}
+		return ids
+	case EdgeRelatives:
+		ids := make([]ent.Value, 0, len(m.relatives))
+		for id := range m.relatives {
+			ids = append(ids, id)
+		}
+		return ids
+	case EdgeLikedTweets:
+		ids := make([]ent.Value, 0, len(m.liked_tweets))
+		for id := range m.liked_tweets {
+			ids = append(ids, id)
+		}
+		return ids
+	case EdgeTweets:
+		ids := make([]ent.Value, 0, len(m.tweets))
+		for id := range m.tweets {
+			ids = append(ids, id)
+		}
+		return ids
+	case EdgeRoles:
+		ids := make([]ent.Value, 0, len(m.roles))
+		for id := range m.roles {
+			ids = append(ids, id)
+		}
+		return ids
+	case EdgeJoinedGroups:
+		ids := make([]ent.Value, 0, len(m.joined_groups))
+		for id := range m.joined_groups {
+			ids = append(ids, id)
+		}
+		return ids
+	case EdgeFriendships:
+		ids := make([]ent.Value, 0, len(m.friendships))
+		for id := range m.friendships {
+			ids = append(ids, id)
+		}
+		return ids
+	case EdgeUserTweets:
+		ids := make([]ent.Value, 0, len(m.user_tweets))
+		for id := range m.user_tweets {
+			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, 9)
+	if m.removedgroups != nil {
+		edges = append(edges, EdgeGroups)
+	}
+	if m.removedfriends != nil {
+		edges = append(edges, EdgeFriends)
+	}
+	if m.removedrelatives != nil {
+		edges = append(edges, EdgeRelatives)
+	}
+	if m.removedliked_tweets != nil {
+		edges = append(edges, EdgeLikedTweets)
+	}
+	if m.removedtweets != nil {
+		edges = append(edges, EdgeTweets)
+	}
+	if m.removedroles != nil {
+		edges = append(edges, EdgeRoles)
+	}
+	if m.removedjoined_groups != nil {
+		edges = append(edges, EdgeJoinedGroups)
+	}
+	if m.removedfriendships != nil {
+		edges = append(edges, EdgeFriendships)
+	}
+	if m.removeduser_tweets != nil {
+		edges = append(edges, EdgeUserTweets)
+	}
+	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
+	case EdgeFriends:
+		ids := make([]ent.Value, 0, len(m.removedfriends))
+		for id := range m.removedfriends {
+			ids = append(ids, id)
+		}
+		return ids
+	case EdgeRelatives:
+		ids := make([]ent.Value, 0, len(m.removedrelatives))
+		for id := range m.removedrelatives {
+			ids = append(ids, id)
+		}
+		return ids
+	case EdgeLikedTweets:
+		ids := make([]ent.Value, 0, len(m.removedliked_tweets))
+		for id := range m.removedliked_tweets {
+			ids = append(ids, id)
+		}
+		return ids
+	case EdgeTweets:
+		ids := make([]ent.Value, 0, len(m.removedtweets))
+		for id := range m.removedtweets {
+			ids = append(ids, id)
+		}
+		return ids
+	case EdgeRoles:
+		ids := make([]ent.Value, 0, len(m.removedroles))
+		for id := range m.removedroles {
+			ids = append(ids, id)
+		}
+		return ids
+	case EdgeJoinedGroups:
+		ids := make([]ent.Value, 0, len(m.removedjoined_groups))
+		for id := range m.removedjoined_groups {
+			ids = append(ids, id)
+		}
+		return ids
+	case EdgeFriendships:
+		ids := make([]ent.Value, 0, len(m.removedfriendships))
+		for id := range m.removedfriendships {
+			ids = append(ids, id)
+		}
+		return ids
+	case EdgeUserTweets:
+		ids := make([]ent.Value, 0, len(m.removeduser_tweets))
+		for id := range m.removeduser_tweets {
+			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, 9)
+	if m.clearedgroups {
+		edges = append(edges, EdgeGroups)
+	}
+	if m.clearedfriends {
+		edges = append(edges, EdgeFriends)
+	}
+	if m.clearedrelatives {
+		edges = append(edges, EdgeRelatives)
+	}
+	if m.clearedliked_tweets {
+		edges = append(edges, EdgeLikedTweets)
+	}
+	if m.clearedtweets {
+		edges = append(edges, EdgeTweets)
+	}
+	if m.clearedroles {
+		edges = append(edges, EdgeRoles)
+	}
+	if m.clearedjoined_groups {
+		edges = append(edges, EdgeJoinedGroups)
+	}
+	if m.clearedfriendships {
+		edges = append(edges, EdgeFriendships)
+	}
+	if m.cleareduser_tweets {
+		edges = append(edges, EdgeUserTweets)
+	}
+	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
+	case EdgeFriends:
+		return m.clearedfriends
+	case EdgeRelatives:
+		return m.clearedrelatives
+	case EdgeLikedTweets:
+		return m.clearedliked_tweets
+	case EdgeTweets:
+		return m.clearedtweets
+	case EdgeRoles:
+		return m.clearedroles
+	case EdgeJoinedGroups:
+		return m.clearedjoined_groups
+	case EdgeFriendships:
+		return m.clearedfriendships
+	case EdgeUserTweets:
+		return m.cleareduser_tweets
+	}
+	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 User 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
+	case EdgeFriends:
+		m.ResetFriends()
+		return nil
+	case EdgeRelatives:
+		m.ResetRelatives()
+		return nil
+	case EdgeLikedTweets:
+		m.ResetLikedTweets()
+		return nil
+	case EdgeTweets:
+		m.ResetTweets()
+		return nil
+	case EdgeRoles:
+		m.ResetRoles()
+		return nil
+	case EdgeJoinedGroups:
+		m.ResetJoinedGroups()
+		return nil
+	case EdgeFriendships:
+		m.ResetFriendships()
+		return nil
+	case EdgeUserTweets:
+		m.ResetUserTweets()
+		return nil
+	}
+	return fmt.Errorf("unknown User edge %s", name)
+}

entc/integration/edgeschema/ent/user/user.go

@@ -0,0 +1,428 @@
+// 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 user
+
+import (
+	"entgo.io/ent"
+	"entgo.io/ent/dialect/sql"
+	"entgo.io/ent/dialect/sql/sqlgraph"
+)
+
+const (
+	// Label holds the string label denoting the user type in the database.
+	Label = "user"
+	// FieldID holds the string denoting the id field in the database.
+	FieldID = "id"
+	// FieldName holds the string denoting the name field in the database.
+	FieldName = "name"
+	// EdgeGroups holds the string denoting the groups edge name in mutations.
+	EdgeGroups = "groups"
+	// EdgeFriends holds the string denoting the friends edge name in mutations.
+	EdgeFriends = "friends"
+	// EdgeRelatives holds the string denoting the relatives edge name in mutations.
+	EdgeRelatives = "relatives"
+	// EdgeLikedTweets holds the string denoting the liked_tweets edge name in mutations.
+	EdgeLikedTweets = "liked_tweets"
+	// EdgeTweets holds the string denoting the tweets edge name in mutations.
+	EdgeTweets = "tweets"
+	// EdgeRoles holds the string denoting the roles edge name in mutations.
+	EdgeRoles = "roles"
+	// EdgeJoinedGroups holds the string denoting the joined_groups edge name in mutations.
+	EdgeJoinedGroups = "joined_groups"
+	// EdgeFriendships holds the string denoting the friendships edge name in mutations.
+	EdgeFriendships = "friendships"
+	// EdgeRelationship holds the string denoting the relationship edge name in mutations.
+	EdgeRelationship = "relationship"
+	// EdgeLikes holds the string denoting the likes edge name in mutations.
+	EdgeLikes = "likes"
+	// EdgeUserTweets holds the string denoting the user_tweets edge name in mutations.
+	EdgeUserTweets = "user_tweets"
+	// EdgeRolesUsers holds the string denoting the roles_users edge name in mutations.
+	EdgeRolesUsers = "roles_users"
+	// Table holds the table name of the user in the database.
+	Table = "users"
+	// GroupsTable is the table that holds the groups relation/edge. The primary key declared below.
+	GroupsTable = "user_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"
+	// FriendsTable is the table that holds the friends relation/edge. The primary key declared below.
+	FriendsTable = "friendships"
+	// RelativesTable is the table that holds the relatives relation/edge. The primary key declared below.
+	RelativesTable = "relationships"
+	// LikedTweetsTable is the table that holds the liked_tweets relation/edge. The primary key declared below.
+	LikedTweetsTable = "tweet_likes"
+	// LikedTweetsInverseTable is the table name for the Tweet entity.
+	// It exists in this package in order to avoid circular dependency with the "tweet" package.
+	LikedTweetsInverseTable = "tweets"
+	// TweetsTable is the table that holds the tweets relation/edge. The primary key declared below.
+	TweetsTable = "user_tweets"
+	// TweetsInverseTable is the table name for the Tweet entity.
+	// It exists in this package in order to avoid circular dependency with the "tweet" package.
+	TweetsInverseTable = "tweets"
+	// RolesTable is the table that holds the roles relation/edge. The primary key declared below.
+	RolesTable = "role_users"
+	// RolesInverseTable is the table name for the Role entity.
+	// It exists in this package in order to avoid circular dependency with the "role" package.
+	RolesInverseTable = "roles"
+	// JoinedGroupsTable is the table that holds the joined_groups relation/edge.
+	JoinedGroupsTable = "user_groups"
+	// JoinedGroupsInverseTable is the table name for the UserGroup entity.
+	// It exists in this package in order to avoid circular dependency with the "usergroup" package.
+	JoinedGroupsInverseTable = "user_groups"
+	// JoinedGroupsColumn is the table column denoting the joined_groups relation/edge.
+	JoinedGroupsColumn = "user_id"
+	// FriendshipsTable is the table that holds the friendships relation/edge.
+	FriendshipsTable = "friendships"
+	// FriendshipsInverseTable is the table name for the Friendship entity.
+	// It exists in this package in order to avoid circular dependency with the "friendship" package.
+	FriendshipsInverseTable = "friendships"
+	// FriendshipsColumn is the table column denoting the friendships relation/edge.
+	FriendshipsColumn = "user_id"
+	// RelationshipTable is the table that holds the relationship relation/edge.
+	RelationshipTable = "relationships"
+	// RelationshipInverseTable is the table name for the Relationship entity.
+	// It exists in this package in order to avoid circular dependency with the "relationship" package.
+	RelationshipInverseTable = "relationships"
+	// RelationshipColumn is the table column denoting the relationship relation/edge.
+	RelationshipColumn = "user_id"
+	// LikesTable is the table that holds the likes relation/edge.
+	LikesTable = "tweet_likes"
+	// LikesInverseTable is the table name for the TweetLike entity.
+	// It exists in this package in order to avoid circular dependency with the "tweetlike" package.
+	LikesInverseTable = "tweet_likes"
+	// LikesColumn is the table column denoting the likes relation/edge.
+	LikesColumn = "user_id"
+	// UserTweetsTable is the table that holds the user_tweets relation/edge.
+	UserTweetsTable = "user_tweets"
+	// UserTweetsInverseTable is the table name for the UserTweet entity.
+	// It exists in this package in order to avoid circular dependency with the "usertweet" package.
+	UserTweetsInverseTable = "user_tweets"
+	// UserTweetsColumn is the table column denoting the user_tweets relation/edge.
+	UserTweetsColumn = "user_id"
+	// RolesUsersTable is the table that holds the roles_users relation/edge.
+	RolesUsersTable = "role_users"
+	// RolesUsersInverseTable is the table name for the RoleUser entity.
+	// It exists in this package in order to avoid circular dependency with the "roleuser" package.
+	RolesUsersInverseTable = "role_users"
+	// RolesUsersColumn is the table column denoting the roles_users relation/edge.
+	RolesUsersColumn = "user_id"
+)
+
+// Columns holds all SQL columns for user fields.
+var Columns = []string{
+	FieldID,
+	FieldName,
+}
+
+var (
+	// GroupsPrimaryKey and GroupsColumn2 are the table columns denoting the
+	// primary key for the groups relation (M2M).
+	GroupsPrimaryKey = []string{"user_id", "group_id"}
+	// FriendsPrimaryKey and FriendsColumn2 are the table columns denoting the
+	// primary key for the friends relation (M2M).
+	FriendsPrimaryKey = []string{"user_id", "friend_id"}
+	// RelativesPrimaryKey and RelativesColumn2 are the table columns denoting the
+	// primary key for the relatives relation (M2M).
+	RelativesPrimaryKey = []string{"user_id", "relative_id"}
+	// LikedTweetsPrimaryKey and LikedTweetsColumn2 are the table columns denoting the
+	// primary key for the liked_tweets relation (M2M).
+	LikedTweetsPrimaryKey = []string{"user_id", "tweet_id"}
+	// TweetsPrimaryKey and TweetsColumn2 are the table columns denoting the
+	// primary key for the tweets relation (M2M).
+	TweetsPrimaryKey = []string{"user_id", "tweet_id"}
+	// RolesPrimaryKey and RolesColumn2 are the table columns denoting the
+	// primary key for the roles relation (M2M).
+	RolesPrimaryKey = []string{"user_id", "role_id"}
+)
+
+// 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
+	// DefaultName holds the default value on creation for the "name" field.
+	DefaultName string
+)
+
+// OrderOption defines the ordering options for the User 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()
+}
+
+// ByName orders the results by the name field.
+func ByName(opts ...sql.OrderTermOption) OrderOption {
+	return sql.OrderByField(FieldName, 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...)...)
+	}
+}
+
+// ByFriendsCount orders the results by friends count.
+func ByFriendsCount(opts ...sql.OrderTermOption) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborsCount(s, newFriendsStep(), opts...)
+	}
+}
+
+// ByFriends orders the results by friends terms.
+func ByFriends(term sql.OrderTerm, terms ...sql.OrderTerm) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborTerms(s, newFriendsStep(), append([]sql.OrderTerm{term}, terms...)...)
+	}
+}
+
+// ByRelativesCount orders the results by relatives count.
+func ByRelativesCount(opts ...sql.OrderTermOption) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborsCount(s, newRelativesStep(), opts...)
+	}
+}
+
+// ByRelatives orders the results by relatives terms.
+func ByRelatives(term sql.OrderTerm, terms ...sql.OrderTerm) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborTerms(s, newRelativesStep(), append([]sql.OrderTerm{term}, terms...)...)
+	}
+}
+
+// ByLikedTweetsCount orders the results by liked_tweets count.
+func ByLikedTweetsCount(opts ...sql.OrderTermOption) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborsCount(s, newLikedTweetsStep(), opts...)
+	}
+}
+
+// ByLikedTweets orders the results by liked_tweets terms.
+func ByLikedTweets(term sql.OrderTerm, terms ...sql.OrderTerm) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborTerms(s, newLikedTweetsStep(), append([]sql.OrderTerm{term}, terms...)...)
+	}
+}
+
+// ByTweetsCount orders the results by tweets count.
+func ByTweetsCount(opts ...sql.OrderTermOption) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborsCount(s, newTweetsStep(), opts...)
+	}
+}
+
+// ByTweets orders the results by tweets terms.
+func ByTweets(term sql.OrderTerm, terms ...sql.OrderTerm) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborTerms(s, newTweetsStep(), append([]sql.OrderTerm{term}, terms...)...)
+	}
+}
+
+// ByRolesCount orders the results by roles count.
+func ByRolesCount(opts ...sql.OrderTermOption) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborsCount(s, newRolesStep(), opts...)
+	}
+}
+
+// ByRoles orders the results by roles terms.
+func ByRoles(term sql.OrderTerm, terms ...sql.OrderTerm) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborTerms(s, newRolesStep(), append([]sql.OrderTerm{term}, terms...)...)
+	}
+}
+
+// ByJoinedGroupsCount orders the results by joined_groups count.
+func ByJoinedGroupsCount(opts ...sql.OrderTermOption) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborsCount(s, newJoinedGroupsStep(), opts...)
+	}
+}
+
+// ByJoinedGroups orders the results by joined_groups terms.
+func ByJoinedGroups(term sql.OrderTerm, terms ...sql.OrderTerm) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborTerms(s, newJoinedGroupsStep(), append([]sql.OrderTerm{term}, terms...)...)
+	}
+}
+
+// ByFriendshipsCount orders the results by friendships count.
+func ByFriendshipsCount(opts ...sql.OrderTermOption) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborsCount(s, newFriendshipsStep(), opts...)
+	}
+}
+
+// ByFriendships orders the results by friendships terms.
+func ByFriendships(term sql.OrderTerm, terms ...sql.OrderTerm) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborTerms(s, newFriendshipsStep(), append([]sql.OrderTerm{term}, terms...)...)
+	}
+}
+
+// ByRelationshipCount orders the results by relationship count.
+func ByRelationshipCount(opts ...sql.OrderTermOption) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborsCount(s, newRelationshipStep(), opts...)
+	}
+}
+
+// ByRelationship orders the results by relationship terms.
+func ByRelationship(term sql.OrderTerm, terms ...sql.OrderTerm) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborTerms(s, newRelationshipStep(), append([]sql.OrderTerm{term}, terms...)...)
+	}
+}
+
+// ByLikesCount orders the results by likes count.
+func ByLikesCount(opts ...sql.OrderTermOption) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborsCount(s, newLikesStep(), opts...)
+	}
+}
+
+// ByLikes orders the results by likes terms.
+func ByLikes(term sql.OrderTerm, terms ...sql.OrderTerm) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborTerms(s, newLikesStep(), append([]sql.OrderTerm{term}, terms...)...)
+	}
+}
+
+// ByUserTweetsCount orders the results by user_tweets count.
+func ByUserTweetsCount(opts ...sql.OrderTermOption) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborsCount(s, newUserTweetsStep(), opts...)
+	}
+}
+
+// ByUserTweets orders the results by user_tweets terms.
+func ByUserTweets(term sql.OrderTerm, terms ...sql.OrderTerm) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborTerms(s, newUserTweetsStep(), append([]sql.OrderTerm{term}, terms...)...)
+	}
+}
+
+// ByRolesUsersCount orders the results by roles_users count.
+func ByRolesUsersCount(opts ...sql.OrderTermOption) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborsCount(s, newRolesUsersStep(), opts...)
+	}
+}
+
+// ByRolesUsers orders the results by roles_users terms.
+func ByRolesUsers(term sql.OrderTerm, terms ...sql.OrderTerm) OrderOption {
+	return func(s *sql.Selector) {
+		sqlgraph.OrderByNeighborTerms(s, newRolesUsersStep(), append([]sql.OrderTerm{term}, terms...)...)
+	}
+}
+func newGroupsStep() *sqlgraph.Step {
+	return sqlgraph.NewStep(
+		sqlgraph.From(Table, FieldID),
+		sqlgraph.To(GroupsInverseTable, FieldID),
+		sqlgraph.Edge(sqlgraph.M2M, false, GroupsTable, GroupsPrimaryKey...),
+	)
+}
+func newFriendsStep() *sqlgraph.Step {
+	return sqlgraph.NewStep(
+		sqlgraph.From(Table, FieldID),
+		sqlgraph.To(Table, FieldID),
+		sqlgraph.Edge(sqlgraph.M2M, false, FriendsTable, FriendsPrimaryKey...),
+	)
+}
+func newRelativesStep() *sqlgraph.Step {
+	return sqlgraph.NewStep(
+		sqlgraph.From(Table, FieldID),
+		sqlgraph.To(Table, FieldID),
+		sqlgraph.Edge(sqlgraph.M2M, false, RelativesTable, RelativesPrimaryKey...),
+	)
+}
+func newLikedTweetsStep() *sqlgraph.Step {
+	return sqlgraph.NewStep(
+		sqlgraph.From(Table, FieldID),
+		sqlgraph.To(LikedTweetsInverseTable, FieldID),
+		sqlgraph.Edge(sqlgraph.M2M, false, LikedTweetsTable, LikedTweetsPrimaryKey...),
+	)
+}
+func newTweetsStep() *sqlgraph.Step {
+	return sqlgraph.NewStep(
+		sqlgraph.From(Table, FieldID),
+		sqlgraph.To(TweetsInverseTable, FieldID),
+		sqlgraph.Edge(sqlgraph.M2M, false, TweetsTable, TweetsPrimaryKey...),
+	)
+}
+func newRolesStep() *sqlgraph.Step {
+	return sqlgraph.NewStep(
+		sqlgraph.From(Table, FieldID),
+		sqlgraph.To(RolesInverseTable, FieldID),
+		sqlgraph.Edge(sqlgraph.M2M, false, RolesTable, RolesPrimaryKey...),
+	)
+}
+func newJoinedGroupsStep() *sqlgraph.Step {
+	return sqlgraph.NewStep(
+		sqlgraph.From(Table, FieldID),
+		sqlgraph.To(JoinedGroupsInverseTable, FieldID),
+		sqlgraph.Edge(sqlgraph.O2M, true, JoinedGroupsTable, JoinedGroupsColumn),
+	)
+}
+func newFriendshipsStep() *sqlgraph.Step {
+	return sqlgraph.NewStep(
+		sqlgraph.From(Table, FieldID),
+		sqlgraph.To(FriendshipsInverseTable, FieldID),
+		sqlgraph.Edge(sqlgraph.O2M, true, FriendshipsTable, FriendshipsColumn),
+	)
+}
+func newRelationshipStep() *sqlgraph.Step {
+	return sqlgraph.NewStep(
+		sqlgraph.From(Table, FieldID),
+		sqlgraph.To(RelationshipInverseTable, RelationshipColumn),
+		sqlgraph.Edge(sqlgraph.O2M, true, RelationshipTable, RelationshipColumn),
+	)
+}
+func newLikesStep() *sqlgraph.Step {
+	return sqlgraph.NewStep(
+		sqlgraph.From(Table, FieldID),
+		sqlgraph.To(LikesInverseTable, LikesColumn),
+		sqlgraph.Edge(sqlgraph.O2M, true, LikesTable, LikesColumn),
+	)
+}
+func newUserTweetsStep() *sqlgraph.Step {
+	return sqlgraph.NewStep(
+		sqlgraph.From(Table, FieldID),
+		sqlgraph.To(UserTweetsInverseTable, FieldID),
+		sqlgraph.Edge(sqlgraph.O2M, true, UserTweetsTable, UserTweetsColumn),
+	)
+}
+func newRolesUsersStep() *sqlgraph.Step {
+	return sqlgraph.NewStep(
+		sqlgraph.From(Table, FieldID),
+		sqlgraph.To(RolesUsersInverseTable, RolesUsersColumn),
+		sqlgraph.Edge(sqlgraph.O2M, true, RolesUsersTable, RolesUsersColumn),
+	)
+}

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

@@ -0,0 +1,419 @@
+// 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 user
+
+import (
+	"entgo.io/ent/dialect/sql"
+	"entgo.io/ent/dialect/sql/sqlgraph"
+	"entgo.io/ent/entc/integration/edgeschema/ent/predicate"
+)
+
+// ID filters vertices based on their ID field.
+func ID(id int) predicate.User {
+	return predicate.User(sql.FieldEQ(FieldID, id))
+}
+
+// IDEQ applies the EQ predicate on the ID field.
+func IDEQ(id int) predicate.User {
+	return predicate.User(sql.FieldEQ(FieldID, id))
+}
+
+// IDNEQ applies the NEQ predicate on the ID field.
+func IDNEQ(id int) predicate.User {
+	return predicate.User(sql.FieldNEQ(FieldID, id))
+}
+
+// IDIn applies the In predicate on the ID field.
+func IDIn(ids ...int) predicate.User {
+	return predicate.User(sql.FieldIn(FieldID, ids...))
+}
+
+// IDNotIn applies the NotIn predicate on the ID field.
+func IDNotIn(ids ...int) predicate.User {
+	return predicate.User(sql.FieldNotIn(FieldID, ids...))
+}
+
+// IDGT applies the GT predicate on the ID field.
+func IDGT(id int) predicate.User {
+	return predicate.User(sql.FieldGT(FieldID, id))
+}
+
+// IDGTE applies the GTE predicate on the ID field.
+func IDGTE(id int) predicate.User {
+	return predicate.User(sql.FieldGTE(FieldID, id))
+}
+
+// IDLT applies the LT predicate on the ID field.
+func IDLT(id int) predicate.User {
+	return predicate.User(sql.FieldLT(FieldID, id))
+}
+
+// IDLTE applies the LTE predicate on the ID field.
+func IDLTE(id int) predicate.User {
+	return predicate.User(sql.FieldLTE(FieldID, id))
+}
+
+// Name applies equality check predicate on the "name" field. It's identical to NameEQ.
+func Name(v string) predicate.User {
+	return predicate.User(sql.FieldEQ(FieldName, v))
+}
+
+// NameEQ applies the EQ predicate on the "name" field.
+func NameEQ(v string) predicate.User {
+	return predicate.User(sql.FieldEQ(FieldName, v))
+}
+
+// NameNEQ applies the NEQ predicate on the "name" field.
+func NameNEQ(v string) predicate.User {
+	return predicate.User(sql.FieldNEQ(FieldName, v))
+}
+
+// NameIn applies the In predicate on the "name" field.
+func NameIn(vs ...string) predicate.User {
+	return predicate.User(sql.FieldIn(FieldName, vs...))
+}
+
+// NameNotIn applies the NotIn predicate on the "name" field.
+func NameNotIn(vs ...string) predicate.User {
+	return predicate.User(sql.FieldNotIn(FieldName, vs...))
+}
+
+// NameGT applies the GT predicate on the "name" field.
+func NameGT(v string) predicate.User {
+	return predicate.User(sql.FieldGT(FieldName, v))
+}
+
+// NameGTE applies the GTE predicate on the "name" field.
+func NameGTE(v string) predicate.User {
+	return predicate.User(sql.FieldGTE(FieldName, v))
+}
+
+// NameLT applies the LT predicate on the "name" field.
+func NameLT(v string) predicate.User {
+	return predicate.User(sql.FieldLT(FieldName, v))
+}
+
+// NameLTE applies the LTE predicate on the "name" field.
+func NameLTE(v string) predicate.User {
+	return predicate.User(sql.FieldLTE(FieldName, v))
+}
+
+// NameContains applies the Contains predicate on the "name" field.
+func NameContains(v string) predicate.User {
+	return predicate.User(sql.FieldContains(FieldName, v))
+}
+
+// NameHasPrefix applies the HasPrefix predicate on the "name" field.
+func NameHasPrefix(v string) predicate.User {
+	return predicate.User(sql.FieldHasPrefix(FieldName, v))
+}
+
+// NameHasSuffix applies the HasSuffix predicate on the "name" field.
+func NameHasSuffix(v string) predicate.User {
+	return predicate.User(sql.FieldHasSuffix(FieldName, v))
+}
+
+// NameEqualFold applies the EqualFold predicate on the "name" field.
+func NameEqualFold(v string) predicate.User {
+	return predicate.User(sql.FieldEqualFold(FieldName, v))
+}
+
+// NameContainsFold applies the ContainsFold predicate on the "name" field.
+func NameContainsFold(v string) predicate.User {
+	return predicate.User(sql.FieldContainsFold(FieldName, v))
+}
+
+// HasGroups applies the HasEdge predicate on the "groups" edge.
+func HasGroups() predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := sqlgraph.NewStep(
+			sqlgraph.From(Table, FieldID),
+			sqlgraph.Edge(sqlgraph.M2M, false, GroupsTable, GroupsPrimaryKey...),
+		)
+		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.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := newGroupsStep()
+		sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
+			for _, p := range preds {
+				p(s)
+			}
+		})
+	})
+}
+
+// HasFriends applies the HasEdge predicate on the "friends" edge.
+func HasFriends() predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := sqlgraph.NewStep(
+			sqlgraph.From(Table, FieldID),
+			sqlgraph.Edge(sqlgraph.M2M, false, FriendsTable, FriendsPrimaryKey...),
+		)
+		sqlgraph.HasNeighbors(s, step)
+	})
+}
+
+// HasFriendsWith applies the HasEdge predicate on the "friends" edge with a given conditions (other predicates).
+func HasFriendsWith(preds ...predicate.User) predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := newFriendsStep()
+		sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
+			for _, p := range preds {
+				p(s)
+			}
+		})
+	})
+}
+
+// HasRelatives applies the HasEdge predicate on the "relatives" edge.
+func HasRelatives() predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := sqlgraph.NewStep(
+			sqlgraph.From(Table, FieldID),
+			sqlgraph.Edge(sqlgraph.M2M, false, RelativesTable, RelativesPrimaryKey...),
+		)
+		sqlgraph.HasNeighbors(s, step)
+	})
+}
+
+// HasRelativesWith applies the HasEdge predicate on the "relatives" edge with a given conditions (other predicates).
+func HasRelativesWith(preds ...predicate.User) predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := newRelativesStep()
+		sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
+			for _, p := range preds {
+				p(s)
+			}
+		})
+	})
+}
+
+// HasLikedTweets applies the HasEdge predicate on the "liked_tweets" edge.
+func HasLikedTweets() predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := sqlgraph.NewStep(
+			sqlgraph.From(Table, FieldID),
+			sqlgraph.Edge(sqlgraph.M2M, false, LikedTweetsTable, LikedTweetsPrimaryKey...),
+		)
+		sqlgraph.HasNeighbors(s, step)
+	})
+}
+
+// HasLikedTweetsWith applies the HasEdge predicate on the "liked_tweets" edge with a given conditions (other predicates).
+func HasLikedTweetsWith(preds ...predicate.Tweet) predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := newLikedTweetsStep()
+		sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
+			for _, p := range preds {
+				p(s)
+			}
+		})
+	})
+}
+
+// HasTweets applies the HasEdge predicate on the "tweets" edge.
+func HasTweets() predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := sqlgraph.NewStep(
+			sqlgraph.From(Table, FieldID),
+			sqlgraph.Edge(sqlgraph.M2M, false, TweetsTable, TweetsPrimaryKey...),
+		)
+		sqlgraph.HasNeighbors(s, step)
+	})
+}
+
+// HasTweetsWith applies the HasEdge predicate on the "tweets" edge with a given conditions (other predicates).
+func HasTweetsWith(preds ...predicate.Tweet) predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := newTweetsStep()
+		sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
+			for _, p := range preds {
+				p(s)
+			}
+		})
+	})
+}
+
+// HasRoles applies the HasEdge predicate on the "roles" edge.
+func HasRoles() predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := sqlgraph.NewStep(
+			sqlgraph.From(Table, FieldID),
+			sqlgraph.Edge(sqlgraph.M2M, false, RolesTable, RolesPrimaryKey...),
+		)
+		sqlgraph.HasNeighbors(s, step)
+	})
+}
+
+// HasRolesWith applies the HasEdge predicate on the "roles" edge with a given conditions (other predicates).
+func HasRolesWith(preds ...predicate.Role) predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := newRolesStep()
+		sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
+			for _, p := range preds {
+				p(s)
+			}
+		})
+	})
+}
+
+// HasJoinedGroups applies the HasEdge predicate on the "joined_groups" edge.
+func HasJoinedGroups() predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := sqlgraph.NewStep(
+			sqlgraph.From(Table, FieldID),
+			sqlgraph.Edge(sqlgraph.O2M, true, JoinedGroupsTable, JoinedGroupsColumn),
+		)
+		sqlgraph.HasNeighbors(s, step)
+	})
+}
+
+// HasJoinedGroupsWith applies the HasEdge predicate on the "joined_groups" edge with a given conditions (other predicates).
+func HasJoinedGroupsWith(preds ...predicate.UserGroup) predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := newJoinedGroupsStep()
+		sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
+			for _, p := range preds {
+				p(s)
+			}
+		})
+	})
+}
+
+// HasFriendships applies the HasEdge predicate on the "friendships" edge.
+func HasFriendships() predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := sqlgraph.NewStep(
+			sqlgraph.From(Table, FieldID),
+			sqlgraph.Edge(sqlgraph.O2M, true, FriendshipsTable, FriendshipsColumn),
+		)
+		sqlgraph.HasNeighbors(s, step)
+	})
+}
+
+// HasFriendshipsWith applies the HasEdge predicate on the "friendships" edge with a given conditions (other predicates).
+func HasFriendshipsWith(preds ...predicate.Friendship) predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := newFriendshipsStep()
+		sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
+			for _, p := range preds {
+				p(s)
+			}
+		})
+	})
+}
+
+// HasRelationship applies the HasEdge predicate on the "relationship" edge.
+func HasRelationship() predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := sqlgraph.NewStep(
+			sqlgraph.From(Table, FieldID),
+			sqlgraph.Edge(sqlgraph.O2M, true, RelationshipTable, RelationshipColumn),
+		)
+		sqlgraph.HasNeighbors(s, step)
+	})
+}
+
+// HasRelationshipWith applies the HasEdge predicate on the "relationship" edge with a given conditions (other predicates).
+func HasRelationshipWith(preds ...predicate.Relationship) predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := newRelationshipStep()
+		sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
+			for _, p := range preds {
+				p(s)
+			}
+		})
+	})
+}
+
+// HasLikes applies the HasEdge predicate on the "likes" edge.
+func HasLikes() predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := sqlgraph.NewStep(
+			sqlgraph.From(Table, FieldID),
+			sqlgraph.Edge(sqlgraph.O2M, true, LikesTable, LikesColumn),
+		)
+		sqlgraph.HasNeighbors(s, step)
+	})
+}
+
+// HasLikesWith applies the HasEdge predicate on the "likes" edge with a given conditions (other predicates).
+func HasLikesWith(preds ...predicate.TweetLike) predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := newLikesStep()
+		sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
+			for _, p := range preds {
+				p(s)
+			}
+		})
+	})
+}
+
+// HasUserTweets applies the HasEdge predicate on the "user_tweets" edge.
+func HasUserTweets() predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := sqlgraph.NewStep(
+			sqlgraph.From(Table, FieldID),
+			sqlgraph.Edge(sqlgraph.O2M, true, UserTweetsTable, UserTweetsColumn),
+		)
+		sqlgraph.HasNeighbors(s, step)
+	})
+}
+
+// HasUserTweetsWith applies the HasEdge predicate on the "user_tweets" edge with a given conditions (other predicates).
+func HasUserTweetsWith(preds ...predicate.UserTweet) predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := newUserTweetsStep()
+		sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
+			for _, p := range preds {
+				p(s)
+			}
+		})
+	})
+}
+
+// HasRolesUsers applies the HasEdge predicate on the "roles_users" edge.
+func HasRolesUsers() predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := sqlgraph.NewStep(
+			sqlgraph.From(Table, FieldID),
+			sqlgraph.Edge(sqlgraph.O2M, true, RolesUsersTable, RolesUsersColumn),
+		)
+		sqlgraph.HasNeighbors(s, step)
+	})
+}
+
+// HasRolesUsersWith applies the HasEdge predicate on the "roles_users" edge with a given conditions (other predicates).
+func HasRolesUsersWith(preds ...predicate.RoleUser) predicate.User {
+	return predicate.User(func(s *sql.Selector) {
+		step := newRolesUsersStep()
+		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.User) predicate.User {
+	return predicate.User(sql.AndPredicates(predicates...))
+}
+
+// Or groups predicates with the OR operator between them.
+func Or(predicates ...predicate.User) predicate.User {
+	return predicate.User(sql.OrPredicates(predicates...))
+}
+
+// Not applies the not operator on the given predicate.
+func Not(p predicate.User) predicate.User {
+	return predicate.User(sql.NotPredicates(p))
+}