pub struct PatternPlan {
pub path_var: Option<BindingId>,
pub search: Option<PathPrefixPlan>,
pub start: NodeStep,
pub steps: Vec<(EdgeStep, NodeStep)>,
}Fields§
§path_var: Option<BindingId>Binding for the whole path value (kind == BindingKind::Path).
search: Option<PathPrefixPlan>The lowered path-search / path-mode prefix, or None when the pattern
carried no prefix (the default: every path, edge-unique WALK). A search
other than All/None is only ever set on a pattern with exactly one
quantified segment, anchored forward on its start (the lowering enforces
both), so the executing operator’s source is the pattern’s start node.
start: NodeStep§steps: Vec<(EdgeStep, NodeStep)>Multi-hop chain: each step is an edge followed by the node it reaches.
Trait Implementations§
Source§impl Clone for PatternPlan
impl Clone for PatternPlan
Source§impl Debug for PatternPlan
impl Debug for PatternPlan
impl Eq for PatternPlan
Source§impl Hash for PatternPlan
impl Hash for PatternPlan
Source§impl PartialEq for PatternPlan
impl PartialEq for PatternPlan
impl StructuralPartialEq for PatternPlan
Auto Trait Implementations§
impl Freeze for PatternPlan
impl RefUnwindSafe for PatternPlan
impl Send for PatternPlan
impl Sync for PatternPlan
impl Unpin for PatternPlan
impl UnsafeUnpin for PatternPlan
impl UnwindSafe for PatternPlan
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.