Struct ResolvedNodeSpec 

pub struct ResolvedNodeSpec {
    pub var: u32,
    pub label_ids: Vec<u32>,
    pub label_names: Vec<String>,
    pub properties: Vec<(String, IrLiteral)>,
    pub computed_properties: Vec<(String, Expr)>,
    pub is_reference: bool,
}

A node to create, fully resolved (no expression-arena coupling).

Built by the relational lowering layer from a graphforge_ir::CreateNodeSpec: label IDs are paired with their resolved names and property maps are evaluated to literal key/value pairs, so the execution layer needs no access to the IR arena or ontology.

Fields

var: u32

Pattern variable id (VarId.0).

label_ids: Vec<u32>

Complete resolved label type-id set, in pattern order.

label_names: Vec<String>

Complete resolved label-name set, in pattern order.

properties: Vec<(String, IrLiteral)>

Literal property key/value pairs (constant or constant-folded values).

computed_properties: Vec<(String, Expr)>

Row-dependent property values that could not be folded to a literal (e.g. {n: x} from a driving UNWIND/MATCH): each is a DataFusion Expr over the input columns, evaluated per minted row by the execution layer (#814). Surfaced through the node’s expressions() so the optimizer rewrites the columns they reference.

is_reference: bool

true when this var was bound by a preceding MATCH/WITH — the executor references the matched node (its identity comes from the input row) rather than minting a new one (#703).

Trait Implementations

impl Clone for ResolvedNodeSpec

fn clone(&self) -> ResolvedNodeSpec

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ResolvedNodeSpec

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

Formats the value using the given formatter.

impl PartialEq for ResolvedNodeSpec

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ResolvedNodeSpec