pub enum PathAst {
Pred(String, bool),
Rep(Box<PathAst>, Rep),
Seq(Box<PathAst>, Box<PathAst>),
Alt(Box<PathAst>, Box<PathAst>),
NegatedSet(Vec<String>, bool),
}Expand description
A lowered property path expression, evaluated as a binary relation over the graph’s nodes.
Variants§
Pred(String, bool)
A single predicate, optionally reversed.
Rep(Box<PathAst>, Rep)
Repetition (*/+/?) of a sub-path.
Seq(Box<PathAst>, Box<PathAst>)
Sequence a/b (relational composition).
Alt(Box<PathAst>, Box<PathAst>)
Alternative a|b (union).
NegatedSet(Vec<String>, bool)
Negated property set !(p1|…|pn) — one step over any predicate not
in the set, in the given direction (reversed for the ^p members,
which spargebra wraps in a Reverse).
Trait Implementations§
Auto Trait Implementations§
impl Freeze for PathAst
impl RefUnwindSafe for PathAst
impl Send for PathAst
impl Sync for PathAst
impl Unpin for PathAst
impl UnsafeUnpin for PathAst
impl UnwindSafe for PathAst
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more