feat: upgrade from community to pro / remove unused edges in storage policy
This commit is contained in:
@@ -945,29 +945,6 @@ func NodeIDNotNil() predicate.StoragePolicy {
|
||||
return predicate.StoragePolicy(sql.FieldNotNull(FieldNodeID))
|
||||
}
|
||||
|
||||
// HasUsers applies the HasEdge predicate on the "users" edge.
|
||||
func HasUsers() predicate.StoragePolicy {
|
||||
return predicate.StoragePolicy(func(s *sql.Selector) {
|
||||
step := sqlgraph.NewStep(
|
||||
sqlgraph.From(Table, FieldID),
|
||||
sqlgraph.Edge(sqlgraph.O2M, false, UsersTable, UsersColumn),
|
||||
)
|
||||
sqlgraph.HasNeighbors(s, step)
|
||||
})
|
||||
}
|
||||
|
||||
// HasUsersWith applies the HasEdge predicate on the "users" edge with a given conditions (other predicates).
|
||||
func HasUsersWith(preds ...predicate.User) predicate.StoragePolicy {
|
||||
return predicate.StoragePolicy(func(s *sql.Selector) {
|
||||
step := newUsersStep()
|
||||
sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
|
||||
for _, p := range preds {
|
||||
p(s)
|
||||
}
|
||||
})
|
||||
})
|
||||
}
|
||||
|
||||
// HasGroups applies the HasEdge predicate on the "groups" edge.
|
||||
func HasGroups() predicate.StoragePolicy {
|
||||
return predicate.StoragePolicy(func(s *sql.Selector) {
|
||||
|
||||
Reference in New Issue
Block a user