420 lines
13 KiB
Go
420 lines
13 KiB
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 (
|
|
"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))
|
|
}
|