Struct Graph 

pub struct Graph { /* private fields */ }

A built, type-checked DAG. Tile-independent; build once per style and evaluate many times.

Implementations

impl Graph

pub fn len(&self) -> usize

Number of nodes.

pub fn is_empty(&self) -> bool

pub fn output(&self) -> NodeIx

pub fn topo_order(&self) -> &[NodeIx]

Topological order; output node is last.

pub fn node(&self, ix: NodeIx) -> &dyn Node

pub fn node_id(&self, ix: NodeIx) -> &str

pub fn upstream(&self, ix: NodeIx) -> impl Iterator<Item = NodeIx> + '_

Upstream nodes feeding ix, deduplicated.

pub fn downstream(&self, ix: NodeIx) -> &[NodeIx]

Downstream nodes consuming ix’s output (may contain duplicates if the same node connects multiple of its input ports to ix).

pub fn incoming(&self, ix: NodeIx, port_ix: usize) -> Option<NodeIx>

The source feeding node.inputs()[port_ix], if connected.

pub fn output_kind(&self, ix: NodeIx) -> PortKind

Resolved output PortKind for ix. Decided at build time; polymorphic nodes’ kind is fixed once the graph is built.

pub fn compute_levels(&self) -> Vec<u32>

Group nodes into evaluation “levels”. A node’s level is one more than the maximum level of its inputs (sources are at level 0). All nodes in the same level have no edges between them and can be evaluated in parallel. Returned as levels[node_ix] = depth.

pub fn level_buckets(&self) -> Vec<Vec<NodeIx>>

Bucket nodes by level, preserving topo order within each bucket for determinism.

pub fn compute_pad(&self, doc_pad: u32) -> Result<Vec<u32>, BuildError>

Compute the canvas padding each node must supply, given the document-level pad requested at the output.

Trait Implementations

impl Debug for Graph

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

Formats the value using the given formatter.