Struct SimpleNodeRegistry 

pub struct SimpleNodeRegistry { /* private fields */ }

Simple in-memory node registry for compilation.

Implementations

impl SimpleNodeRegistry

pub fn new() -> Self

An empty registry; populate it with register, register_meta or register_step_meta.

pub fn register_step_meta(&mut self, node_id: impl Into<String>, meta: StepMeta)

Register a step’s metadata, so its schemas take part in validation.

pub fn register(&mut self, node_id: impl Into<String>, filter: &dyn Filter)

Register a filter, taking metadata and config hash from the instance itself.

pub fn register_meta( &mut self, node_id: impl Into<String>, meta: FilterMeta, config_hash: CacheKey, )

Register filter metadata directly, for callers that have no filter instance to hand — a plan received over the wire, a test.

Trait Implementations

impl Default for SimpleNodeRegistry

fn default() -> Self

Returns the “default value” for a type.

impl NodeRegistry for SimpleNodeRegistry

fn node_meta(&self, node_id: &str) -> Option<NodeMeta>

A node’s contract — schemas, cacheability, effectfulness — whichever kind it is. None means the graph names a node nobody registered, which the compiler reports rather than guesses around.

fn config_hash(&self, node_id: &str) -> Option<CacheKey>

The node’s configuration identity, folded into cache keys. Required rather than derived because only the registry knows how a node’s configuration is canonicalized (Rust: canonical CBOR of fields; Python: qualname + config + source hash).

fn meta(&self, node_id: &str) -> Option<FilterMeta>

The computational view, for the phases that only make sense for a filter: gradient flow, differentiable collapsing.