Struct Node 

pub struct Node { /* private fields */ }

A node in the immutable operation graph.

Nodes are never mutated after construction. Build them through Image rather than directly.

Implementations

impl Node

pub const fn id(&self) -> NodeId

This node’s unique identifier.

pub const fn descriptor(&self) -> ImageDescriptor

The shape of this node’s output, resolved at build time.

pub fn inputs(&self) -> &[Arc<Node>]

This node’s inputs, in the order the op consumes them.

pub fn op(&self) -> Option<&Arc<dyn Op>>

The op this node applies, or None if it is a source.

pub fn producer(&self) -> Option<&Arc<dyn Producer>>

The producer at this node, or None if it is an interior op.

pub fn name(&self) -> &'static str

A short name for this node, for diagnostics.

pub fn node_count(self: &Arc<Self>) -> usize

The number of nodes reachable from here, counting shared nodes once.

Useful for asserting in tests that chaining built the graph it should have, and that a shared prefix really is shared.

Trait Implementations

impl Debug for Node

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

Formats the value using the given formatter.

impl Drop for Node

fn drop(&mut self)

Tear the graph down iteratively.

The derived drop glue would recurse once per node: a node drops its inputs, each of which drops its inputs, and so on. A long chain — which callers build simply by chaining many ops — would then overflow the stack at teardown, aborting the process. Since an abort is exactly what the failure model forbids, teardown uses an explicit worklist.

Only uniquely-owned inputs are unwrapped: a node still shared by another branch of the DAG is left for its last owner to drop.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.