snapshot of https://github.com/ent/ent.git (master, 2026-09-15; blobs > 131072B omitted)
This commit is contained in:
281
entc/integration/gremlin/ent/document/where.go
Normal file
281
entc/integration/gremlin/ent/document/where.go
Normal file
@@ -0,0 +1,281 @@
|
||||
// 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 document
|
||||
|
||||
import (
|
||||
"entgo.io/ent/dialect/gremlin/graph/dsl"
|
||||
"entgo.io/ent/dialect/gremlin/graph/dsl/__"
|
||||
"entgo.io/ent/dialect/gremlin/graph/dsl/p"
|
||||
"entgo.io/ent/entc/integration/gremlin/ent/predicate"
|
||||
)
|
||||
|
||||
// ID filters vertices based on their ID field.
|
||||
func ID(id string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.HasID(id)
|
||||
})
|
||||
}
|
||||
|
||||
// IDEQ applies the EQ predicate on the ID field.
|
||||
func IDEQ(id string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.HasID(p.EQ(id))
|
||||
})
|
||||
}
|
||||
|
||||
// IDNEQ applies the NEQ predicate on the ID field.
|
||||
func IDNEQ(id string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.HasID(p.NEQ(id))
|
||||
})
|
||||
}
|
||||
|
||||
// IDIn applies the In predicate on the ID field.
|
||||
func IDIn(ids ...string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
v := make([]any, len(ids))
|
||||
for i := range v {
|
||||
v[i] = ids[i]
|
||||
}
|
||||
t.HasID(p.Within(v...))
|
||||
})
|
||||
}
|
||||
|
||||
// IDNotIn applies the NotIn predicate on the ID field.
|
||||
func IDNotIn(ids ...string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
v := make([]any, len(ids))
|
||||
for i := range v {
|
||||
v[i] = ids[i]
|
||||
}
|
||||
t.HasID(p.Without(v...))
|
||||
})
|
||||
}
|
||||
|
||||
// IDGT applies the GT predicate on the ID field.
|
||||
func IDGT(id string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.HasID(p.GT(id))
|
||||
})
|
||||
}
|
||||
|
||||
// IDGTE applies the GTE predicate on the ID field.
|
||||
func IDGTE(id string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.HasID(p.GTE(id))
|
||||
})
|
||||
}
|
||||
|
||||
// IDLT applies the LT predicate on the ID field.
|
||||
func IDLT(id string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.HasID(p.LT(id))
|
||||
})
|
||||
}
|
||||
|
||||
// IDLTE applies the LTE predicate on the ID field.
|
||||
func IDLTE(id string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.HasID(p.LTE(id))
|
||||
})
|
||||
}
|
||||
|
||||
// Name applies equality check predicate on the "name" field. It's identical to NameEQ.
|
||||
func Name(v string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldName, p.EQ(v))
|
||||
})
|
||||
}
|
||||
|
||||
// Attachment applies equality check predicate on the "attachment" field. It's identical to AttachmentEQ.
|
||||
func Attachment(v []byte) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldAttachment, p.EQ(v))
|
||||
})
|
||||
}
|
||||
|
||||
// NameEQ applies the EQ predicate on the "name" field.
|
||||
func NameEQ(v string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldName, p.EQ(v))
|
||||
})
|
||||
}
|
||||
|
||||
// NameNEQ applies the NEQ predicate on the "name" field.
|
||||
func NameNEQ(v string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldName, p.NEQ(v))
|
||||
})
|
||||
}
|
||||
|
||||
// NameIn applies the In predicate on the "name" field.
|
||||
func NameIn(vs ...string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldName, p.Within(vs...))
|
||||
})
|
||||
}
|
||||
|
||||
// NameNotIn applies the NotIn predicate on the "name" field.
|
||||
func NameNotIn(vs ...string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldName, p.Without(vs...))
|
||||
})
|
||||
}
|
||||
|
||||
// NameGT applies the GT predicate on the "name" field.
|
||||
func NameGT(v string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldName, p.GT(v))
|
||||
})
|
||||
}
|
||||
|
||||
// NameGTE applies the GTE predicate on the "name" field.
|
||||
func NameGTE(v string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldName, p.GTE(v))
|
||||
})
|
||||
}
|
||||
|
||||
// NameLT applies the LT predicate on the "name" field.
|
||||
func NameLT(v string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldName, p.LT(v))
|
||||
})
|
||||
}
|
||||
|
||||
// NameLTE applies the LTE predicate on the "name" field.
|
||||
func NameLTE(v string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldName, p.LTE(v))
|
||||
})
|
||||
}
|
||||
|
||||
// NameContains applies the Contains predicate on the "name" field.
|
||||
func NameContains(v string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldName, p.Containing(v))
|
||||
})
|
||||
}
|
||||
|
||||
// NameHasPrefix applies the HasPrefix predicate on the "name" field.
|
||||
func NameHasPrefix(v string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldName, p.StartingWith(v))
|
||||
})
|
||||
}
|
||||
|
||||
// NameHasSuffix applies the HasSuffix predicate on the "name" field.
|
||||
func NameHasSuffix(v string) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldName, p.EndingWith(v))
|
||||
})
|
||||
}
|
||||
|
||||
// AttachmentEQ applies the EQ predicate on the "attachment" field.
|
||||
func AttachmentEQ(v []byte) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldAttachment, p.EQ(v))
|
||||
})
|
||||
}
|
||||
|
||||
// AttachmentNEQ applies the NEQ predicate on the "attachment" field.
|
||||
func AttachmentNEQ(v []byte) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldAttachment, p.NEQ(v))
|
||||
})
|
||||
}
|
||||
|
||||
// AttachmentIn applies the In predicate on the "attachment" field.
|
||||
func AttachmentIn(vs ...[]byte) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldAttachment, p.Within(vs...))
|
||||
})
|
||||
}
|
||||
|
||||
// AttachmentNotIn applies the NotIn predicate on the "attachment" field.
|
||||
func AttachmentNotIn(vs ...[]byte) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldAttachment, p.Without(vs...))
|
||||
})
|
||||
}
|
||||
|
||||
// AttachmentGT applies the GT predicate on the "attachment" field.
|
||||
func AttachmentGT(v []byte) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldAttachment, p.GT(v))
|
||||
})
|
||||
}
|
||||
|
||||
// AttachmentGTE applies the GTE predicate on the "attachment" field.
|
||||
func AttachmentGTE(v []byte) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldAttachment, p.GTE(v))
|
||||
})
|
||||
}
|
||||
|
||||
// AttachmentLT applies the LT predicate on the "attachment" field.
|
||||
func AttachmentLT(v []byte) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldAttachment, p.LT(v))
|
||||
})
|
||||
}
|
||||
|
||||
// AttachmentLTE applies the LTE predicate on the "attachment" field.
|
||||
func AttachmentLTE(v []byte) predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.Has(Label, FieldAttachment, p.LTE(v))
|
||||
})
|
||||
}
|
||||
|
||||
// PayloadIsNil applies the IsNil predicate on the "payload" field.
|
||||
func PayloadIsNil() predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.HasLabel(Label).HasNot(FieldPayload)
|
||||
})
|
||||
}
|
||||
|
||||
// PayloadNotNil applies the NotNil predicate on the "payload" field.
|
||||
func PayloadNotNil() predicate.Document {
|
||||
return predicate.Document(func(t *dsl.Traversal) {
|
||||
t.HasLabel(Label).Has(FieldPayload)
|
||||
})
|
||||
}
|
||||
|
||||
// And groups predicates with the AND operator between them.
|
||||
func And(predicates ...predicate.Document) predicate.Document {
|
||||
return predicate.Document(func(tr *dsl.Traversal) {
|
||||
trs := make([]any, 0, len(predicates))
|
||||
for _, p := range predicates {
|
||||
t := __.New()
|
||||
p(t)
|
||||
trs = append(trs, t)
|
||||
}
|
||||
tr.Where(__.And(trs...))
|
||||
})
|
||||
}
|
||||
|
||||
// Or groups predicates with the OR operator between them.
|
||||
func Or(predicates ...predicate.Document) predicate.Document {
|
||||
return predicate.Document(func(tr *dsl.Traversal) {
|
||||
trs := make([]any, 0, len(predicates))
|
||||
for _, p := range predicates {
|
||||
t := __.New()
|
||||
p(t)
|
||||
trs = append(trs, t)
|
||||
}
|
||||
tr.Where(__.Or(trs...))
|
||||
})
|
||||
}
|
||||
|
||||
// Not applies the not operator on the given predicate.
|
||||
func Not(p predicate.Document) predicate.Document {
|
||||
return predicate.Document(func(tr *dsl.Traversal) {
|
||||
t := __.New()
|
||||
p(t)
|
||||
tr.Where(__.Not(t))
|
||||
})
|
||||
}
|
||||
Reference in New Issue
Block a user