Struct QueryAst 

pub struct QueryAst {
    pub root_kind: String,
    pub steps: Vec<QueryStep>,
    pub expansions: Vec<ExpansionSlot>,
    pub edge_expansions: Vec<EdgeExpansionSlot>,
    pub final_limit: Option<usize>,
}

Abstract syntax tree representing a graph query.

Eq is intentionally NOT derived because QueryStep::RawVectorSearch carries a Vec<f32> payload; Vec<f32> implements PartialEq but not Eq (IEEE-754 NaN breaks reflexivity). Existing PartialEq-only callers are unaffected.

Fields

root_kind: String

Node kind used as the root of the query.

steps: Vec<QueryStep>

Ordered pipeline of search, traversal, and filter steps.

expansions: Vec<ExpansionSlot>

Named expansion slots evaluated per root result in grouped queries.

edge_expansions: Vec<EdgeExpansionSlot>

Named edge-projecting expansion slots evaluated per root result in grouped queries. Sibling to expansions; vec membership is the discriminator between node- and edge-expansion slots. Slot names must be unique across both vecs.

final_limit: Option<usize>

Optional hard cap on the number of result rows.

Trait Implementations

impl Clone for QueryAst

fn clone(&self) -> QueryAst

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for QueryAst

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

Formats the value using the given formatter.

impl PartialEq for QueryAst

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for QueryAst