Struct NodePlan 

#[non_exhaustive]
pub struct NodePlan {
    pub shape: TileShape,
    pub materialize: bool,
    pub cacheable: bool,
}

How the scheduler must treat one node.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

shape: TileShape

The shape tiles of this node’s output take.

materialize: bool

Whether this node’s whole output must be realized before its consumers pull from it.

Set where demand on this node is not forward-monotonic and the pixels below come from a forward-only source (ADR-0009). It is a property of this position in this pipeline, not of the node’s op.

cacheable: bool

Whether this node’s tiles are worth retaining in the tile cache.

Only nodes whose output is genuinely demanded more than once qualify: a shared graph prefix, or a node feeding a spatial op whose tile requests overlap. In a linear pipeline every tile is produced once and consumed once, so caching it would be pure waste — and, worse, would fill the byte budget with garbage and make a streaming pipeline’s memory look like the cache budget rather than a few tiles.

Trait Implementations

impl Clone for NodePlan

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for NodePlan

impl Debug for NodePlan

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

Formats the value using the given formatter.

impl Eq for NodePlan

impl PartialEq for NodePlan

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for NodePlan