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

// 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)
}