snapshot of https://github.com/ent/ent.git (master, 2026-09-15; blobs > 131072B omitted)
This commit is contained in:
100
examples/o2orecur/ent/node/node.go
Normal file
100
examples/o2orecur/ent/node/node.go
Normal file
@@ -0,0 +1,100 @@
|
||||
// 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 node
|
||||
|
||||
import (
|
||||
"entgo.io/ent/dialect/sql"
|
||||
"entgo.io/ent/dialect/sql/sqlgraph"
|
||||
)
|
||||
|
||||
const (
|
||||
// Label holds the string label denoting the node type in the database.
|
||||
Label = "node"
|
||||
// FieldID holds the string denoting the id field in the database.
|
||||
FieldID = "id"
|
||||
// FieldValue holds the string denoting the value field in the database.
|
||||
FieldValue = "value"
|
||||
// FieldPrevID holds the string denoting the prev_id field in the database.
|
||||
FieldPrevID = "prev_id"
|
||||
// EdgePrev holds the string denoting the prev edge name in mutations.
|
||||
EdgePrev = "prev"
|
||||
// EdgeNext holds the string denoting the next edge name in mutations.
|
||||
EdgeNext = "next"
|
||||
// Table holds the table name of the node in the database.
|
||||
Table = "nodes"
|
||||
// PrevTable is the table that holds the prev relation/edge.
|
||||
PrevTable = "nodes"
|
||||
// PrevColumn is the table column denoting the prev relation/edge.
|
||||
PrevColumn = "prev_id"
|
||||
// NextTable is the table that holds the next relation/edge.
|
||||
NextTable = "nodes"
|
||||
// NextColumn is the table column denoting the next relation/edge.
|
||||
NextColumn = "prev_id"
|
||||
)
|
||||
|
||||
// Columns holds all SQL columns for node fields.
|
||||
var Columns = []string{
|
||||
FieldID,
|
||||
FieldValue,
|
||||
FieldPrevID,
|
||||
}
|
||||
|
||||
// ValidColumn reports if the column name is valid (part of the table columns).
|
||||
func ValidColumn(column string) bool {
|
||||
for i := range Columns {
|
||||
if column == Columns[i] {
|
||||
return true
|
||||
}
|
||||
}
|
||||
return false
|
||||
}
|
||||
|
||||
// OrderOption defines the ordering options for the Node queries.
|
||||
type OrderOption func(*sql.Selector)
|
||||
|
||||
// ByID orders the results by the id field.
|
||||
func ByID(opts ...sql.OrderTermOption) OrderOption {
|
||||
return sql.OrderByField(FieldID, opts...).ToFunc()
|
||||
}
|
||||
|
||||
// ByValue orders the results by the value field.
|
||||
func ByValue(opts ...sql.OrderTermOption) OrderOption {
|
||||
return sql.OrderByField(FieldValue, opts...).ToFunc()
|
||||
}
|
||||
|
||||
// ByPrevID orders the results by the prev_id field.
|
||||
func ByPrevID(opts ...sql.OrderTermOption) OrderOption {
|
||||
return sql.OrderByField(FieldPrevID, opts...).ToFunc()
|
||||
}
|
||||
|
||||
// ByPrevField orders the results by prev field.
|
||||
func ByPrevField(field string, opts ...sql.OrderTermOption) OrderOption {
|
||||
return func(s *sql.Selector) {
|
||||
sqlgraph.OrderByNeighborTerms(s, newPrevStep(), sql.OrderByField(field, opts...))
|
||||
}
|
||||
}
|
||||
|
||||
// ByNextField orders the results by next field.
|
||||
func ByNextField(field string, opts ...sql.OrderTermOption) OrderOption {
|
||||
return func(s *sql.Selector) {
|
||||
sqlgraph.OrderByNeighborTerms(s, newNextStep(), sql.OrderByField(field, opts...))
|
||||
}
|
||||
}
|
||||
func newPrevStep() *sqlgraph.Step {
|
||||
return sqlgraph.NewStep(
|
||||
sqlgraph.From(Table, FieldID),
|
||||
sqlgraph.To(Table, FieldID),
|
||||
sqlgraph.Edge(sqlgraph.O2O, true, PrevTable, PrevColumn),
|
||||
)
|
||||
}
|
||||
func newNextStep() *sqlgraph.Step {
|
||||
return sqlgraph.NewStep(
|
||||
sqlgraph.From(Table, FieldID),
|
||||
sqlgraph.To(Table, FieldID),
|
||||
sqlgraph.Edge(sqlgraph.O2O, false, NextTable, NextColumn),
|
||||
)
|
||||
}
|
||||
Reference in New Issue
Block a user