MonkeyCode/backend/db/usergroupuser/where.go

// Code generated by ent, DO NOT EDIT.

package usergroupuser

import (
	"entgo.io/ent/dialect/sql"
	"entgo.io/ent/dialect/sql/sqlgraph"
	"github.com/chaitin/MonkeyCode/backend/db/predicate"
	"github.com/google/uuid"
)

// ID filters vertices based on their ID field.
func ID(id uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldEQ(FieldID, id))
}

// IDEQ applies the EQ predicate on the ID field.
func IDEQ(id uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldEQ(FieldID, id))
}

// IDNEQ applies the NEQ predicate on the ID field.
func IDNEQ(id uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldNEQ(FieldID, id))
}

// IDIn applies the In predicate on the ID field.
func IDIn(ids ...uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldIn(FieldID, ids...))
}

// IDNotIn applies the NotIn predicate on the ID field.
func IDNotIn(ids ...uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldNotIn(FieldID, ids...))
}

// IDGT applies the GT predicate on the ID field.
func IDGT(id uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldGT(FieldID, id))
}

// IDGTE applies the GTE predicate on the ID field.
func IDGTE(id uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldGTE(FieldID, id))
}

// IDLT applies the LT predicate on the ID field.
func IDLT(id uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldLT(FieldID, id))
}

// IDLTE applies the LTE predicate on the ID field.
func IDLTE(id uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldLTE(FieldID, id))
}

// UserGroupID applies equality check predicate on the "user_group_id" field. It's identical to UserGroupIDEQ.
func UserGroupID(v uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldEQ(FieldUserGroupID, v))
}

// UserID applies equality check predicate on the "user_id" field. It's identical to UserIDEQ.
func UserID(v uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldEQ(FieldUserID, v))
}

// UserGroupIDEQ applies the EQ predicate on the "user_group_id" field.
func UserGroupIDEQ(v uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldEQ(FieldUserGroupID, v))
}

// UserGroupIDNEQ applies the NEQ predicate on the "user_group_id" field.
func UserGroupIDNEQ(v uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldNEQ(FieldUserGroupID, v))
}

// UserGroupIDIn applies the In predicate on the "user_group_id" field.
func UserGroupIDIn(vs ...uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldIn(FieldUserGroupID, vs...))
}

// UserGroupIDNotIn applies the NotIn predicate on the "user_group_id" field.
func UserGroupIDNotIn(vs ...uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldNotIn(FieldUserGroupID, vs...))
}

// UserIDEQ applies the EQ predicate on the "user_id" field.
func UserIDEQ(v uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldEQ(FieldUserID, v))
}

// UserIDNEQ applies the NEQ predicate on the "user_id" field.
func UserIDNEQ(v uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldNEQ(FieldUserID, v))
}

// UserIDIn applies the In predicate on the "user_id" field.
func UserIDIn(vs ...uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldIn(FieldUserID, vs...))
}

// UserIDNotIn applies the NotIn predicate on the "user_id" field.
func UserIDNotIn(vs ...uuid.UUID) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.FieldNotIn(FieldUserID, vs...))
}

// HasUserGroup applies the HasEdge predicate on the "user_group" edge.
func HasUserGroup() predicate.UserGroupUser {
	return predicate.UserGroupUser(func(s *sql.Selector) {
		step := sqlgraph.NewStep(
			sqlgraph.From(Table, FieldID),
			sqlgraph.Edge(sqlgraph.M2O, false, UserGroupTable, UserGroupColumn),
		)
		sqlgraph.HasNeighbors(s, step)
	})
}

// HasUserGroupWith applies the HasEdge predicate on the "user_group" edge with a given conditions (other predicates).
func HasUserGroupWith(preds ...predicate.UserGroup) predicate.UserGroupUser {
	return predicate.UserGroupUser(func(s *sql.Selector) {
		step := newUserGroupStep()
		sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
			for _, p := range preds {
				p(s)
			}
		})
	})
}

// HasUser applies the HasEdge predicate on the "user" edge.
func HasUser() predicate.UserGroupUser {
	return predicate.UserGroupUser(func(s *sql.Selector) {
		step := sqlgraph.NewStep(
			sqlgraph.From(Table, FieldID),
			sqlgraph.Edge(sqlgraph.M2O, false, UserTable, UserColumn),
		)
		sqlgraph.HasNeighbors(s, step)
	})
}

// HasUserWith applies the HasEdge predicate on the "user" edge with a given conditions (other predicates).
func HasUserWith(preds ...predicate.User) predicate.UserGroupUser {
	return predicate.UserGroupUser(func(s *sql.Selector) {
		step := newUserStep()
		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.UserGroupUser) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.AndPredicates(predicates...))
}

// Or groups predicates with the OR operator between them.
func Or(predicates ...predicate.UserGroupUser) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.OrPredicates(predicates...))
}

// Not applies the not operator on the given predicate.
func Not(p predicate.UserGroupUser) predicate.UserGroupUser {
	return predicate.UserGroupUser(sql.NotPredicates(p))
}