Struct NodeId 

pub struct NodeId {
    pub idx: u32,
    pub gen: u32,
}

A handle to an operator slot in the Graph arena. idx is the slot index; gen is the slot’s generation, bumped every time the slot is freed (a pipeline teardown — Graph::destroy_pipeline). The generation is what makes slot REUSE safe: a stale handle to a torn-down pipeline carries the old gen, so it fails the generation check in Graph::node instead of silently aliasing the new tenant of a recycled slot. Distinct from physical removal (which would shift indices and is impossible here) — the slot keeps its index across reuse.

Fields

idx: u32

gen: u32

Implementations

impl NodeId

pub fn new(idx: u32, gen: u32) -> NodeId

Construct a raw handle from a slot index and generation. The graph vends NodeIds from add; this is for the few call sites that wire a known slot directly (the builder/testkit and integration tests that reference a freshly-added node at generation 0).

Trait Implementations

impl Clone for NodeId

fn clone(&self) -> NodeId

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NodeId

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

Formats the value using the given formatter.

impl Hash for NodeId

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for NodeId

fn eq(&self, other: &NodeId) -> 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 Copy for NodeId

impl Eq for NodeId

impl StructuralPartialEq for NodeId