snapshot of https://github.com/ent/ent.git (master, 2026-09-15; blobs > 131072B omitted)
Some checks failed
Atlas CI Public / lint (push) Failing after 13s
Atlas CI Public / sync (push) Has been skipped

This commit is contained in:
upstream-mirror
2026-09-15 22:12:36 +05:00
commit 4b3ad0b611
2680 changed files with 719472 additions and 0 deletions

View File

@@ -0,0 +1,121 @@
// 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 attachedfile
import (
"time"
"entgo.io/ent/dialect/sql"
"entgo.io/ent/dialect/sql/sqlgraph"
)
const (
// Label holds the string label denoting the attachedfile type in the database.
Label = "attached_file"
// FieldID holds the string denoting the id field in the database.
FieldID = "id"
// FieldAttachTime holds the string denoting the attach_time field in the database.
FieldAttachTime = "attach_time"
// FieldFID holds the string denoting the f_id field in the database.
FieldFID = "f_id"
// FieldProcID holds the string denoting the proc_id field in the database.
FieldProcID = "proc_id"
// EdgeFi holds the string denoting the fi edge name in mutations.
EdgeFi = "fi"
// EdgeProc holds the string denoting the proc edge name in mutations.
EdgeProc = "proc"
// Table holds the table name of the attachedfile in the database.
Table = "attached_files"
// FiTable is the table that holds the fi relation/edge.
FiTable = "attached_files"
// FiInverseTable is the table name for the File entity.
// It exists in this package in order to avoid circular dependency with the "file" package.
FiInverseTable = "files"
// FiColumn is the table column denoting the fi relation/edge.
FiColumn = "f_id"
// ProcTable is the table that holds the proc relation/edge.
ProcTable = "attached_files"
// ProcInverseTable is the table name for the Process entity.
// It exists in this package in order to avoid circular dependency with the "process" package.
ProcInverseTable = "processes"
// ProcColumn is the table column denoting the proc relation/edge.
ProcColumn = "proc_id"
)
// Columns holds all SQL columns for attachedfile fields.
var Columns = []string{
FieldID,
FieldAttachTime,
FieldFID,
FieldProcID,
}
// 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
}
var (
// DefaultAttachTime holds the default value on creation for the "attach_time" field.
DefaultAttachTime func() time.Time
)
// OrderOption defines the ordering options for the AttachedFile 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()
}
// ByAttachTime orders the results by the attach_time field.
func ByAttachTime(opts ...sql.OrderTermOption) OrderOption {
return sql.OrderByField(FieldAttachTime, opts...).ToFunc()
}
// ByFID orders the results by the f_id field.
func ByFID(opts ...sql.OrderTermOption) OrderOption {
return sql.OrderByField(FieldFID, opts...).ToFunc()
}
// ByProcID orders the results by the proc_id field.
func ByProcID(opts ...sql.OrderTermOption) OrderOption {
return sql.OrderByField(FieldProcID, opts...).ToFunc()
}
// ByFiField orders the results by fi field.
func ByFiField(field string, opts ...sql.OrderTermOption) OrderOption {
return func(s *sql.Selector) {
sqlgraph.OrderByNeighborTerms(s, newFiStep(), sql.OrderByField(field, opts...))
}
}
// ByProcField orders the results by proc field.
func ByProcField(field string, opts ...sql.OrderTermOption) OrderOption {
return func(s *sql.Selector) {
sqlgraph.OrderByNeighborTerms(s, newProcStep(), sql.OrderByField(field, opts...))
}
}
func newFiStep() *sqlgraph.Step {
return sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.To(FiInverseTable, FieldID),
sqlgraph.Edge(sqlgraph.M2O, false, FiTable, FiColumn),
)
}
func newProcStep() *sqlgraph.Step {
return sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.To(ProcInverseTable, FieldID),
sqlgraph.Edge(sqlgraph.M2O, false, ProcTable, ProcColumn),
)
}

View File

@@ -0,0 +1,420 @@
// 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 attachedfile
import (
"context"
"fmt"
"time"
"entgo.io/ent"
"entgo.io/ent/dialect/sql"
"entgo.io/ent/entc/integration/edgeschema/ent/predicate"
)
// Mutation represents an operation that mutates the AttachedFile nodes in the graph.
type Mutation struct {
op ent.Op
typ string
attach_time *time.Time
clearedFields map[string]struct{}
fi *int
clearedfi bool
proc *int
clearedproc bool
predicates []predicate.AttachedFile
}
// NewMutation creates a new Mutation for the AttachedFile entity.
func NewMutation(op ent.Op) *Mutation {
return &Mutation{
op: op,
typ: "AttachedFile",
clearedFields: make(map[string]struct{}),
}
}
// Predicates returns the list of predicates set on the mutation.
func (m *Mutation) Predicates() []predicate.AttachedFile {
return m.predicates
}
// SetAttachTime sets the "attach_time" field.
func (m *Mutation) SetAttachTime(t time.Time) {
m.attach_time = &t
}
// AttachTime returns the value of the "attach_time" field in the mutation.
func (m *Mutation) AttachTime() (r time.Time, exists bool) {
v := m.attach_time
if v == nil {
return
}
return *v, true
}
// ResetAttachTime resets all changes to the "attach_time" field.
func (m *Mutation) ResetAttachTime() {
m.attach_time = nil
}
// SetFID sets the "f_id" field.
func (m *Mutation) SetFID(i int) {
m.fi = &i
}
// FID returns the value of the "f_id" field in the mutation.
func (m *Mutation) FID() (r int, exists bool) {
v := m.fi
if v == nil {
return
}
return *v, true
}
// ResetFID resets all changes to the "f_id" field.
func (m *Mutation) ResetFID() {
m.fi = nil
}
// SetProcID sets the "proc_id" field.
func (m *Mutation) SetProcID(i int) {
m.proc = &i
}
// ProcID returns the value of the "proc_id" field in the mutation.
func (m *Mutation) ProcID() (r int, exists bool) {
v := m.proc
if v == nil {
return
}
return *v, true
}
// ResetProcID resets all changes to the "proc_id" field.
func (m *Mutation) ResetProcID() {
m.proc = nil
}
// SetFiID sets the "fi" edge to the File entity by id.
func (m *Mutation) SetFiID(id int) {
m.fi = &id
}
// ClearFi clears the "fi" edge to the File entity.
func (m *Mutation) ClearFi() {
m.clearedfi = true
m.clearedFields[FieldFID] = struct{}{}
}
// FiCleared reports if the "fi" edge to the File entity was cleared.
func (m *Mutation) FiCleared() bool {
return m.clearedfi
}
// FiID returns the "fi" edge ID in the mutation.
func (m *Mutation) FiID() (id int, exists bool) {
if m.fi != nil {
return *m.fi, true
}
return
}
// FiIDs returns the "fi" edge IDs in the mutation.
// Note that IDs always returns len(IDs) <= 1 for unique edges, and you should use
// FiID instead. It exists only for internal usage by the builders.
func (m *Mutation) FiIDs() (ids []int) {
if id := m.fi; id != nil {
ids = append(ids, *id)
}
return
}
// ResetFi resets all changes to the "fi" edge.
func (m *Mutation) ResetFi() {
m.fi = nil
m.clearedfi = false
}
// ClearProc clears the "proc" edge to the Process entity.
func (m *Mutation) ClearProc() {
m.clearedproc = true
m.clearedFields[FieldProcID] = struct{}{}
}
// ProcCleared reports if the "proc" edge to the Process entity was cleared.
func (m *Mutation) ProcCleared() bool {
return m.clearedproc
}
// ProcIDs returns the "proc" edge IDs in the mutation.
// Note that IDs always returns len(IDs) <= 1 for unique edges, and you should use
// ProcID instead. It exists only for internal usage by the builders.
func (m *Mutation) ProcIDs() (ids []int) {
if id := m.proc; id != nil {
ids = append(ids, *id)
}
return
}
// ResetProc resets all changes to the "proc" edge.
func (m *Mutation) ResetProc() {
m.proc = nil
m.clearedproc = false
}
// Where appends a list predicates to the Mutation builder.
func (m *Mutation) Where(ps ...predicate.AttachedFile) {
m.predicates = append(m.predicates, ps...)
}
// WhereP appends storage-level predicates to the Mutation builder. Using this method,
// users can use type-assertion to append predicates that do not depend on any generated package.
func (m *Mutation) WhereP(ps ...func(*sql.Selector)) {
p := make([]predicate.AttachedFile, len(ps))
for i := range ps {
p[i] = ps[i]
}
m.Where(p...)
}
// Op returns the operation name.
func (m *Mutation) Op() ent.Op {
return m.op
}
// SetOp allows setting the mutation operation.
func (m *Mutation) SetOp(op ent.Op) {
m.op = op
}
// Type returns the node type of this mutation (AttachedFile).
func (m *Mutation) Type() string {
return m.typ
}
// Fields returns all fields that were changed during this mutation. Note that in
// order to get all numeric fields that were incremented/decremented, call
// AddedFields().
func (m *Mutation) Fields() []string {
fields := make([]string, 0, 3)
if m.attach_time != nil {
fields = append(fields, FieldAttachTime)
}
if m.fi != nil {
fields = append(fields, FieldFID)
}
if m.proc != nil {
fields = append(fields, FieldProcID)
}
return fields
}
// Field returns the value of a field with the given name. The second boolean
// return value indicates that this field was not set, or was not defined in the
// schema.
func (m *Mutation) Field(name string) (ent.Value, bool) {
switch name {
case FieldAttachTime:
return m.AttachTime()
case FieldFID:
return m.FID()
case FieldProcID:
return m.ProcID()
}
return nil, false
}
// OldField returns the old value of the field from the database. An error is
// returned if the mutation operation is not UpdateOne, or the query to the
// database failed.
func (m *Mutation) OldField(ctx context.Context, name string) (ent.Value, error) {
return nil, fmt.Errorf("unknown AttachedFile field %s", name)
}
// SetField sets the value of a field with the given name. It returns an error if
// the field is not defined in the schema, or if the type mismatched the field
// type.
func (m *Mutation) SetField(name string, value ent.Value) error {
switch name {
case FieldAttachTime:
v, ok := value.(time.Time)
if !ok {
return fmt.Errorf("unexpected type %T for field %s", value, name)
}
m.SetAttachTime(v)
return nil
case FieldFID:
v, ok := value.(int)
if !ok {
return fmt.Errorf("unexpected type %T for field %s", value, name)
}
m.SetFID(v)
return nil
case FieldProcID:
v, ok := value.(int)
if !ok {
return fmt.Errorf("unexpected type %T for field %s", value, name)
}
m.SetProcID(v)
return nil
}
return fmt.Errorf("unknown AttachedFile field %s", name)
}
// AddedFields returns all numeric fields that were incremented/decremented during
// this mutation.
func (m *Mutation) AddedFields() []string {
var fields []string
return fields
}
// AddedField returns the numeric value that was incremented/decremented on a field
// with the given name. The second boolean return value indicates that this field
// was not set, or was not defined in the schema.
func (m *Mutation) AddedField(name string) (ent.Value, bool) {
switch name {
}
return nil, false
}
// AddField adds the value to the field with the given name. It returns an error if
// the field is not defined in the schema, or if the type mismatched the field
// type.
func (m *Mutation) AddField(name string, value ent.Value) error {
switch name {
}
return fmt.Errorf("unknown AttachedFile numeric field %s", name)
}
// ClearedFields returns all nullable fields that were cleared during this
// mutation.
func (m *Mutation) ClearedFields() []string {
return nil
}
// FieldCleared returns a boolean indicating if a field with the given name was
// cleared in this mutation.
func (m *Mutation) FieldCleared(name string) bool {
_, ok := m.clearedFields[name]
return ok
}
// ClearField clears the value of the field with the given name. It returns an
// error if the field is not defined in the schema.
func (m *Mutation) ClearField(name string) error {
return fmt.Errorf("unknown AttachedFile nullable field %s", name)
}
// ResetField resets all changes in the mutation for the field with the given name.
// It returns an error if the field is not defined in the schema.
func (m *Mutation) ResetField(name string) error {
switch name {
case FieldAttachTime:
m.ResetAttachTime()
return nil
case FieldFID:
m.ResetFID()
return nil
case FieldProcID:
m.ResetProcID()
return nil
}
return fmt.Errorf("unknown AttachedFile field %s", name)
}
// AddedEdges returns all edge names that were set/added in this mutation.
func (m *Mutation) AddedEdges() []string {
edges := make([]string, 0, 2)
if m.fi != nil {
edges = append(edges, EdgeFi)
}
if m.proc != nil {
edges = append(edges, EdgeProc)
}
return edges
}
// AddedIDs returns all IDs (to other nodes) that were added for the given edge
// name in this mutation.
func (m *Mutation) AddedIDs(name string) []ent.Value {
switch name {
case EdgeFi:
if id := m.fi; id != nil {
return []ent.Value{*id}
}
case EdgeProc:
if id := m.proc; id != nil {
return []ent.Value{*id}
}
}
return nil
}
// RemovedEdges returns all edge names that were removed in this mutation.
func (m *Mutation) RemovedEdges() []string {
edges := make([]string, 0, 2)
return edges
}
// RemovedIDs returns all IDs (to other nodes) that were removed for the edge with
// the given name in this mutation.
func (m *Mutation) RemovedIDs(name string) []ent.Value {
return nil
}
// ClearedEdges returns all edge names that were cleared in this mutation.
func (m *Mutation) ClearedEdges() []string {
edges := make([]string, 0, 2)
if m.clearedfi {
edges = append(edges, EdgeFi)
}
if m.clearedproc {
edges = append(edges, EdgeProc)
}
return edges
}
// EdgeCleared returns a boolean which indicates if the edge with the given name
// was cleared in this mutation.
func (m *Mutation) EdgeCleared(name string) bool {
switch name {
case EdgeFi:
return m.clearedfi
case EdgeProc:
return m.clearedproc
}
return false
}
// ClearEdge clears the value of the edge with the given name. It returns an error
// if that edge is not defined in the schema.
func (m *Mutation) ClearEdge(name string) error {
switch name {
case EdgeFi:
m.ClearFi()
return nil
case EdgeProc:
m.ClearProc()
return nil
}
return fmt.Errorf("unknown AttachedFile unique edge %s", name)
}
// ResetEdge resets all changes to the edge with the given name in this mutation.
// It returns an error if the edge is not defined in the schema.
func (m *Mutation) ResetEdge(name string) error {
switch name {
case EdgeFi:
m.ResetFi()
return nil
case EdgeProc:
m.ResetProc()
return nil
}
return fmt.Errorf("unknown AttachedFile edge %s", name)
}

View File

@@ -0,0 +1,216 @@
// 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 attachedfile
import (
"time"
"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.AttachedFile {
return predicate.AttachedFile(sql.FieldEQ(FieldID, id))
}
// IDEQ applies the EQ predicate on the ID field.
func IDEQ(id int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldEQ(FieldID, id))
}
// IDNEQ applies the NEQ predicate on the ID field.
func IDNEQ(id int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldNEQ(FieldID, id))
}
// IDIn applies the In predicate on the ID field.
func IDIn(ids ...int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldIn(FieldID, ids...))
}
// IDNotIn applies the NotIn predicate on the ID field.
func IDNotIn(ids ...int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldNotIn(FieldID, ids...))
}
// IDGT applies the GT predicate on the ID field.
func IDGT(id int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldGT(FieldID, id))
}
// IDGTE applies the GTE predicate on the ID field.
func IDGTE(id int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldGTE(FieldID, id))
}
// IDLT applies the LT predicate on the ID field.
func IDLT(id int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldLT(FieldID, id))
}
// IDLTE applies the LTE predicate on the ID field.
func IDLTE(id int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldLTE(FieldID, id))
}
// AttachTime applies equality check predicate on the "attach_time" field. It's identical to AttachTimeEQ.
func AttachTime(v time.Time) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldEQ(FieldAttachTime, v))
}
// FID applies equality check predicate on the "f_id" field. It's identical to FIDEQ.
func FID(v int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldEQ(FieldFID, v))
}
// ProcID applies equality check predicate on the "proc_id" field. It's identical to ProcIDEQ.
func ProcID(v int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldEQ(FieldProcID, v))
}
// AttachTimeEQ applies the EQ predicate on the "attach_time" field.
func AttachTimeEQ(v time.Time) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldEQ(FieldAttachTime, v))
}
// AttachTimeNEQ applies the NEQ predicate on the "attach_time" field.
func AttachTimeNEQ(v time.Time) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldNEQ(FieldAttachTime, v))
}
// AttachTimeIn applies the In predicate on the "attach_time" field.
func AttachTimeIn(vs ...time.Time) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldIn(FieldAttachTime, vs...))
}
// AttachTimeNotIn applies the NotIn predicate on the "attach_time" field.
func AttachTimeNotIn(vs ...time.Time) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldNotIn(FieldAttachTime, vs...))
}
// AttachTimeGT applies the GT predicate on the "attach_time" field.
func AttachTimeGT(v time.Time) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldGT(FieldAttachTime, v))
}
// AttachTimeGTE applies the GTE predicate on the "attach_time" field.
func AttachTimeGTE(v time.Time) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldGTE(FieldAttachTime, v))
}
// AttachTimeLT applies the LT predicate on the "attach_time" field.
func AttachTimeLT(v time.Time) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldLT(FieldAttachTime, v))
}
// AttachTimeLTE applies the LTE predicate on the "attach_time" field.
func AttachTimeLTE(v time.Time) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldLTE(FieldAttachTime, v))
}
// FIDEQ applies the EQ predicate on the "f_id" field.
func FIDEQ(v int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldEQ(FieldFID, v))
}
// FIDNEQ applies the NEQ predicate on the "f_id" field.
func FIDNEQ(v int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldNEQ(FieldFID, v))
}
// FIDIn applies the In predicate on the "f_id" field.
func FIDIn(vs ...int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldIn(FieldFID, vs...))
}
// FIDNotIn applies the NotIn predicate on the "f_id" field.
func FIDNotIn(vs ...int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldNotIn(FieldFID, vs...))
}
// ProcIDEQ applies the EQ predicate on the "proc_id" field.
func ProcIDEQ(v int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldEQ(FieldProcID, v))
}
// ProcIDNEQ applies the NEQ predicate on the "proc_id" field.
func ProcIDNEQ(v int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldNEQ(FieldProcID, v))
}
// ProcIDIn applies the In predicate on the "proc_id" field.
func ProcIDIn(vs ...int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldIn(FieldProcID, vs...))
}
// ProcIDNotIn applies the NotIn predicate on the "proc_id" field.
func ProcIDNotIn(vs ...int) predicate.AttachedFile {
return predicate.AttachedFile(sql.FieldNotIn(FieldProcID, vs...))
}
// HasFi applies the HasEdge predicate on the "fi" edge.
func HasFi() predicate.AttachedFile {
return predicate.AttachedFile(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.Edge(sqlgraph.M2O, false, FiTable, FiColumn),
)
sqlgraph.HasNeighbors(s, step)
})
}
// HasFiWith applies the HasEdge predicate on the "fi" edge with a given conditions (other predicates).
func HasFiWith(preds ...predicate.File) predicate.AttachedFile {
return predicate.AttachedFile(func(s *sql.Selector) {
step := newFiStep()
sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) {
for _, p := range preds {
p(s)
}
})
})
}
// HasProc applies the HasEdge predicate on the "proc" edge.
func HasProc() predicate.AttachedFile {
return predicate.AttachedFile(func(s *sql.Selector) {
step := sqlgraph.NewStep(
sqlgraph.From(Table, FieldID),
sqlgraph.Edge(sqlgraph.M2O, false, ProcTable, ProcColumn),
)
sqlgraph.HasNeighbors(s, step)
})
}
// HasProcWith applies the HasEdge predicate on the "proc" edge with a given conditions (other predicates).
func HasProcWith(preds ...predicate.Process) predicate.AttachedFile {
return predicate.AttachedFile(func(s *sql.Selector) {
step := newProcStep()
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.AttachedFile) predicate.AttachedFile {
return predicate.AttachedFile(sql.AndPredicates(predicates...))
}
// Or groups predicates with the OR operator between them.
func Or(predicates ...predicate.AttachedFile) predicate.AttachedFile {
return predicate.AttachedFile(sql.OrPredicates(predicates...))
}
// Not applies the not operator on the given predicate.
func Not(p predicate.AttachedFile) predicate.AttachedFile {
return predicate.AttachedFile(sql.NotPredicates(p))
}