Struct GraphMatchNode 

pub struct GraphMatchNode {
    pub variable: Option<SymbolPrimitive>,
    pub label: Option<AstNode<GraphMatchLabel>>,
    pub where_clause: Option<Box<Expr>>,
}

A single node in a graph pattern.

Fields

variable: Option<SymbolPrimitive>

the optional element variable of the node match, e.g.: x in MATCH (x)

label: Option<AstNode<GraphMatchLabel>>

the optional label(s) to match for the node, e.g.: Entity in MATCH (x:Entity)

where_clause: Option<Box<Expr>>

an optional node where clause, e.g.: WHERE c.name='Alarm' in MATCH (c WHERE c.name='Alarm')

Trait Implementations

impl Clone for GraphMatchNode

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for GraphMatchNode

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for GraphMatchNode

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl PrettyDoc for GraphMatchNode

fn pretty_doc<'b, D, A>(&'b self, arena: &'b D) -> DocBuilder<'b, D, A>

where D: DocAllocator<'b, A>, D::Doc: Clone, A: Clone,

impl StructuralPartialEq for GraphMatchNode

impl Visit for GraphMatchNode

fn visit<'v, V>(&'v self, v: &mut V) -> Traverse

where V: Visitor<'v>,