Method execute

native/shared/src/renderer/graph.rs:145–155

Schedule + run all nodes in order. Consumes the graph because each node's `run` closure is `FnOnce`.

(self, ctx: &mut Ctx)

    /// Schedule + run all nodes in order. Consumes the graph because
    /// each node's `run` closure is `FnOnce`.
    pub fn execute(self, ctx: &mut Ctx) -> Result<(), GraphError> {
        let order = schedule(&self.nodes)?;
        // Drain in order. Using Option<PassNode> trick so we can take()
        // nodes out by index without panicking the Vec's geometry.
        let mut slots: Vec<Option<PassNode<'a, Ctx>>> = self.nodes.into_iter().map(Some).collect();
        for i in order {
            let node = slots[i].take().expect("each node scheduled exactly once");
            (node.run)(ctx);
        }
        Ok(())
    }
}

impl<'a, Ctx> Default for Graph<'a, Ctx> {