Struct FrameGraph 

pub struct FrameGraph { /* private fields */ }

Per-frame collection of recorded passes.

Agents append passes during execute(). submit_frame_graph drains the graph in topological order and submits the buffers to the device.

Implementations

impl FrameGraph

pub fn new() -> Self

Creates an empty frame graph.

pub fn add_pass( &mut self, descriptor: PassDescriptor, command_buffer: CommandBufferId, )

Records a pass: descriptor + the command buffer the agent already produced.

pub fn len(&self) -> usize

Number of recorded passes.

pub fn is_empty(&self) -> bool

Whether the graph has no recorded passes.

pub fn clear(&mut self)

Drops all recorded passes without submitting them — used to recover from a frame error before the engine reaches the submit step.

pub fn compile(&mut self) -> Vec<CommandBufferId>

Drains the graph and returns command buffers in submission order.

The order is computed by a stable Kahn’s algorithm over read/write dependencies: a pass that writes resource R must run before any pass that reads R. Insertion order is the tie-breaker, so when the declared order is already valid (the common case) the result equals insertion order.

Trait Implementations

impl Default for FrameGraph

fn default() -> FrameGraph

Returns the “default value” for a type.