zkt24/z2/backend/ent/whitelist/where.go

// Code generated by ent, DO NOT EDIT.

package whitelist

import (
	"thesis/ent/predicate"

	"entgo.io/ent/dialect/sql"
	"entgo.io/ent/dialect/sql/sqlgraph"
)

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

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

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

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

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

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

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

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

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

// HasSponsor applies the HasEdge predicate on the "Sponsor" edge.
func HasSponsor() predicate.WhiteList {
	return predicate.WhiteList(func(s *sql.Selector) {
		step := sqlgraph.NewStep(
			sqlgraph.From(Table, FieldID),
			sqlgraph.Edge(sqlgraph.O2M, false, SponsorTable, SponsorColumn),
		)
		sqlgraph.HasNeighbors(s, step)
	})
}

// HasSponsorWith applies the HasEdge predicate on the "Sponsor" edge with a given conditions (other predicates).
func HasSponsorWith(preds ...predicate.Validators) predicate.WhiteList {
	return predicate.WhiteList(func(s *sql.Selector) {
		step := newSponsorStep()
		sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
			for _, p := range preds {
				p(s)
			}
		})
	})
}

// HasAccount applies the HasEdge predicate on the "Account" edge.
func HasAccount() predicate.WhiteList {
	return predicate.WhiteList(func(s *sql.Selector) {
		step := sqlgraph.NewStep(
			sqlgraph.From(Table, FieldID),
			sqlgraph.Edge(sqlgraph.O2M, false, AccountTable, AccountColumn),
		)
		sqlgraph.HasNeighbors(s, step)
	})
}

// HasAccountWith applies the HasEdge predicate on the "Account" edge with a given conditions (other predicates).
func HasAccountWith(preds ...predicate.Key) predicate.WhiteList {
	return predicate.WhiteList(func(s *sql.Selector) {
		step := newAccountStep()
		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.WhiteList) predicate.WhiteList {
	return predicate.WhiteList(sql.AndPredicates(predicates...))
}

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

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