TraversalQuantifier
Read onlyYes
FinalYes
The resolved form of a `quant` quantifier applied to an edge/join traversal.
Where the array surface resolves quant into an AQL quantifier keyword
(ANY / ALL / NONE / AT LEAST (n)), a relation traversal is an existence
check shaped as LENGTH( FOR … RETURN 1 ) <comparator> <threshold>. This value
object carries the four decisions that shape that predicate:
comparator— the comparison applied to theLENGTH(...)count (>,==,>=);threshold— the right-hand operand (0for existence/absence,nfor « at least n »);useLimit— whether aLIMIT 1short-circuit can be emitted (existence/absence) or must be dropped because the rows have to be counted (« at least n »);negate— whether the leaf condition must be negated (all→ « no linked vertex violates the condition »).
Tags
Table of Contents
Properties
- $comparator : string
- $negate : bool
- $threshold : int
- $useLimit : bool
Methods
- __construct() : mixed
- Creates a new TraversalQuantifier instance.
Properties
$comparator
public
string
$comparator
$negate
public
bool
$negate
$threshold
public
int
$threshold
$useLimit
public
bool
$useLimit
Methods
__construct()
Creates a new TraversalQuantifier instance.
public
__construct(string $comparator, int $threshold, bool $useLimit, bool $negate) : mixed
Parameters
- $comparator : string
-
The comparison applied to the
LENGTH(...)count. - $threshold : int
-
The right-hand operand of the comparison.
- $useLimit : bool
-
Whether a
LIMIT 1short-circuit may be emitted. - $negate : bool
-
Whether the leaf condition must be negated.