1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569
|
// 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 entc, DO NOT EDIT.
package group
import (
"time"
"github.com/facebook/ent/dialect/gremlin/graph/dsl"
"github.com/facebook/ent/dialect/gremlin/graph/dsl/__"
"github.com/facebook/ent/dialect/gremlin/graph/dsl/p"
"github.com/facebook/ent/entc/integration/gremlin/ent/predicate"
)
// ID filters vertices based on their ID field.
func ID(id string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.HasID(id)
})
}
// IDEQ applies the EQ predicate on the ID field.
func IDEQ(id string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.HasID(p.EQ(id))
})
}
// IDNEQ applies the NEQ predicate on the ID field.
func IDNEQ(id string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.HasID(p.NEQ(id))
})
}
// IDIn applies the In predicate on the ID field.
func IDIn(ids ...string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
v := make([]interface{}, 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.Group {
return predicate.Group(func(t *dsl.Traversal) {
v := make([]interface{}, 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.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.HasID(p.GT(id))
})
}
// IDGTE applies the GTE predicate on the ID field.
func IDGTE(id string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.HasID(p.GTE(id))
})
}
// IDLT applies the LT predicate on the ID field.
func IDLT(id string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.HasID(p.LT(id))
})
}
// IDLTE applies the LTE predicate on the ID field.
func IDLTE(id string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.HasID(p.LTE(id))
})
}
// Active applies equality check predicate on the "active" field. It's identical to ActiveEQ.
func Active(v bool) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldActive, p.EQ(v))
})
}
// Expire applies equality check predicate on the "expire" field. It's identical to ExpireEQ.
func Expire(v time.Time) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldExpire, p.EQ(v))
})
}
// Type applies equality check predicate on the "type" field. It's identical to TypeEQ.
func Type(v string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldType, p.EQ(v))
})
}
// MaxUsers applies equality check predicate on the "max_users" field. It's identical to MaxUsersEQ.
func MaxUsers(v int) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldMaxUsers, p.EQ(v))
})
}
// Name applies equality check predicate on the "name" field. It's identical to NameEQ.
func Name(v string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.EQ(v))
})
}
// ActiveEQ applies the EQ predicate on the "active" field.
func ActiveEQ(v bool) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldActive, p.EQ(v))
})
}
// ActiveNEQ applies the NEQ predicate on the "active" field.
func ActiveNEQ(v bool) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldActive, p.NEQ(v))
})
}
// ExpireEQ applies the EQ predicate on the "expire" field.
func ExpireEQ(v time.Time) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldExpire, p.EQ(v))
})
}
// ExpireNEQ applies the NEQ predicate on the "expire" field.
func ExpireNEQ(v time.Time) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldExpire, p.NEQ(v))
})
}
// ExpireIn applies the In predicate on the "expire" field.
func ExpireIn(vs ...time.Time) predicate.Group {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = vs[i]
}
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldExpire, p.Within(v...))
})
}
// ExpireNotIn applies the NotIn predicate on the "expire" field.
func ExpireNotIn(vs ...time.Time) predicate.Group {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = vs[i]
}
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldExpire, p.Without(v...))
})
}
// ExpireGT applies the GT predicate on the "expire" field.
func ExpireGT(v time.Time) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldExpire, p.GT(v))
})
}
// ExpireGTE applies the GTE predicate on the "expire" field.
func ExpireGTE(v time.Time) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldExpire, p.GTE(v))
})
}
// ExpireLT applies the LT predicate on the "expire" field.
func ExpireLT(v time.Time) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldExpire, p.LT(v))
})
}
// ExpireLTE applies the LTE predicate on the "expire" field.
func ExpireLTE(v time.Time) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldExpire, p.LTE(v))
})
}
// TypeEQ applies the EQ predicate on the "type" field.
func TypeEQ(v string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldType, p.EQ(v))
})
}
// TypeNEQ applies the NEQ predicate on the "type" field.
func TypeNEQ(v string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldType, p.NEQ(v))
})
}
// TypeIn applies the In predicate on the "type" field.
func TypeIn(vs ...string) predicate.Group {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = vs[i]
}
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldType, p.Within(v...))
})
}
// TypeNotIn applies the NotIn predicate on the "type" field.
func TypeNotIn(vs ...string) predicate.Group {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = vs[i]
}
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldType, p.Without(v...))
})
}
// TypeGT applies the GT predicate on the "type" field.
func TypeGT(v string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldType, p.GT(v))
})
}
// TypeGTE applies the GTE predicate on the "type" field.
func TypeGTE(v string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldType, p.GTE(v))
})
}
// TypeLT applies the LT predicate on the "type" field.
func TypeLT(v string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldType, p.LT(v))
})
}
// TypeLTE applies the LTE predicate on the "type" field.
func TypeLTE(v string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldType, p.LTE(v))
})
}
// TypeContains applies the Contains predicate on the "type" field.
func TypeContains(v string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldType, p.Containing(v))
})
}
// TypeHasPrefix applies the HasPrefix predicate on the "type" field.
func TypeHasPrefix(v string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldType, p.StartingWith(v))
})
}
// TypeHasSuffix applies the HasSuffix predicate on the "type" field.
func TypeHasSuffix(v string) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldType, p.EndingWith(v))
})
}
// TypeIsNil applies the IsNil predicate on the "type" field.
func TypeIsNil() predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.HasLabel(Label).HasNot(FieldType)
})
}
// TypeNotNil applies the NotNil predicate on the "type" field.
func TypeNotNil() predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.HasLabel(Label).Has(FieldType)
})
}
// MaxUsersEQ applies the EQ predicate on the "max_users" field.
func MaxUsersEQ(v int) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldMaxUsers, p.EQ(v))
})
}
// MaxUsersNEQ applies the NEQ predicate on the "max_users" field.
func MaxUsersNEQ(v int) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldMaxUsers, p.NEQ(v))
})
}
// MaxUsersIn applies the In predicate on the "max_users" field.
func MaxUsersIn(vs ...int) predicate.Group {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = vs[i]
}
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldMaxUsers, p.Within(v...))
})
}
// MaxUsersNotIn applies the NotIn predicate on the "max_users" field.
func MaxUsersNotIn(vs ...int) predicate.Group {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = vs[i]
}
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldMaxUsers, p.Without(v...))
})
}
// MaxUsersGT applies the GT predicate on the "max_users" field.
func MaxUsersGT(v int) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldMaxUsers, p.GT(v))
})
}
// MaxUsersGTE applies the GTE predicate on the "max_users" field.
func MaxUsersGTE(v int) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldMaxUsers, p.GTE(v))
})
}
// MaxUsersLT applies the LT predicate on the "max_users" field.
func MaxUsersLT(v int) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldMaxUsers, p.LT(v))
})
}
// MaxUsersLTE applies the LTE predicate on the "max_users" field.
func MaxUsersLTE(v int) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldMaxUsers, p.LTE(v))
})
}
// MaxUsersIsNil applies the IsNil predicate on the "max_users" field.
func MaxUsersIsNil() predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.HasLabel(Label).HasNot(FieldMaxUsers)
})
}
// MaxUsersNotNil applies the NotNil predicate on the "max_users" field.
func MaxUsersNotNil() predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.HasLabel(Label).Has(FieldMaxUsers)
})
}
// NameEQ applies the EQ predicate on the "name" field.
func NameEQ(v string) predicate.Group {
return predicate.Group(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.Group {
return predicate.Group(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.Group {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = vs[i]
}
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.Within(v...))
})
}
// NameNotIn applies the NotIn predicate on the "name" field.
func NameNotIn(vs ...string) predicate.Group {
v := make([]interface{}, len(vs))
for i := range v {
v[i] = vs[i]
}
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.Without(v...))
})
}
// NameGT applies the GT predicate on the "name" field.
func NameGT(v string) predicate.Group {
return predicate.Group(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.Group {
return predicate.Group(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.Group {
return predicate.Group(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.Group {
return predicate.Group(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.Group {
return predicate.Group(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.Group {
return predicate.Group(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.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.Has(Label, FieldName, p.EndingWith(v))
})
}
// HasFiles applies the HasEdge predicate on the "files" edge.
func HasFiles() predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.OutE(FilesLabel).OutV()
})
}
// HasFilesWith applies the HasEdge predicate on the "files" edge with a given conditions (other predicates).
func HasFilesWith(preds ...predicate.File) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
tr := __.InV()
for _, p := range preds {
p(tr)
}
t.OutE(FilesLabel).Where(tr).OutV()
})
}
// HasBlocked applies the HasEdge predicate on the "blocked" edge.
func HasBlocked() predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.OutE(BlockedLabel).OutV()
})
}
// HasBlockedWith applies the HasEdge predicate on the "blocked" edge with a given conditions (other predicates).
func HasBlockedWith(preds ...predicate.User) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
tr := __.InV()
for _, p := range preds {
p(tr)
}
t.OutE(BlockedLabel).Where(tr).OutV()
})
}
// HasUsers applies the HasEdge predicate on the "users" edge.
func HasUsers() predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.InE(UsersInverseLabel).InV()
})
}
// HasUsersWith applies the HasEdge predicate on the "users" edge with a given conditions (other predicates).
func HasUsersWith(preds ...predicate.User) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
tr := __.OutV()
for _, p := range preds {
p(tr)
}
t.InE(UsersInverseLabel).Where(tr).InV()
})
}
// HasInfo applies the HasEdge predicate on the "info" edge.
func HasInfo() predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
t.OutE(InfoLabel).OutV()
})
}
// HasInfoWith applies the HasEdge predicate on the "info" edge with a given conditions (other predicates).
func HasInfoWith(preds ...predicate.GroupInfo) predicate.Group {
return predicate.Group(func(t *dsl.Traversal) {
tr := __.InV()
for _, p := range preds {
p(tr)
}
t.OutE(InfoLabel).Where(tr).OutV()
})
}
// And groups predicates with the AND operator between them.
func And(predicates ...predicate.Group) predicate.Group {
return predicate.Group(func(tr *dsl.Traversal) {
trs := make([]interface{}, 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.Group) predicate.Group {
return predicate.Group(func(tr *dsl.Traversal) {
trs := make([]interface{}, 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.Group) predicate.Group {
return predicate.Group(func(tr *dsl.Traversal) {
t := __.New()
p(t)
tr.Where(__.Not(t))
})
}
|