Enum GraphMatchPathPattern 

#[non_exhaustive]
pub enum GraphMatchPathPattern {
    Path(Vec<AstNode<GraphMatchPathPattern>>),
    Union(Vec<AstNode<GraphMatchPathPattern>>),
    Multiset(Vec<AstNode<GraphMatchPathPattern>>),
    Questioned(Box<AstNode<GraphMatchPathPattern>>),
    Quantified(GraphMatchPathPatternQuantified),
    Sub(Box<AstNode<GraphPathSubPattern>>),
    Node(AstNode<GraphMatchNode>),
    Edge(AstNode<GraphMatchEdge>),
    Simplified(AstNode<GraphMatchSimplified>),
}

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Path(Vec<AstNode<GraphMatchPathPattern>>)

Union(Vec<AstNode<GraphMatchPathPattern>>)

Multiset(Vec<AstNode<GraphMatchPathPattern>>)

Questioned(Box<AstNode<GraphMatchPathPattern>>)

Quantified(GraphMatchPathPatternQuantified)

Sub(Box<AstNode<GraphPathSubPattern>>)

Node(AstNode<GraphMatchNode>)

A single node in a graph pattern.

Edge(AstNode<GraphMatchEdge>)

A single edge in a graph pattern.

Simplified(AstNode<GraphMatchSimplified>)

Trait Implementations

impl Clone for GraphMatchPathPattern

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 GraphMatchPathPattern

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

Formats the value using the given formatter.

impl PartialEq for GraphMatchPathPattern

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

Equality operator ==.

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

Inequality operator !=.

impl PrettyDoc for GraphMatchPathPattern

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 GraphMatchPathPattern

impl Visit for GraphMatchPathPattern

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

where V: Visitor<'v>,