pub fn iter_node_outputs(
        &self,
        label: impl Into<NodeLabel>,
    ) -> Result<impl Iterator<Item = (&Edge, &NodeState)>, RenderGraphError> {
        let node = self.get_node_state(label)?;
        Ok(node
            .edges
            .output_edges
            .iter()
            .map(|edge| (edge, edge.get_input_node()))
            .map(move |(edge, input_node_id)| (edge, self.get_node_state(input_node_id).unwrap())))
    }
/// Returns an iterator over a tuple of the ouput edges and the corresponding input nodes
/// for the node referenced by the label.
Returns an iterator over a tuple of the ouput edges and the corresponding input nodes
for the node referenced by the label.
Returns an iterator over a tuple of the ouput edges and the corresponding input nodes for the node referenced by the label .
pub fn iter_node_outputs(
        &self,
        label: impl Into<NodeLabel>,
    ) -> Result<impl Iterator<Item = (&Edge, &NodeState)>, RenderGraphError> {
        let node = self.get_node_state(label)?;
        Ok(node
            .edges
            .output_edges
            .iter()
            .map(|edge| (edge, edge.get_input_node()))
            .map(move |(edge, input_node_id)| (edge, self.get_node_state(input_node_id).unwrap())))
    }
pub fn iter_node_outputs ( & self , label : impl Into < NodeLabel > , ) -> Result < impl Iterator < Item = ( & Edge , & NodeState ) > , RenderGraphError > { let node = self . get_node_state ( label ) ? ; Ok ( node . edges . output_edges . iter ( ) . map ( | edge | ( edge , edge . get_input_node ( ) ) ) . map ( move | ( edge , input_node_id ) | ( edge , self . get_node_state ( input_node_id ) . unwrap ( ) ) ) ) }
Returns an iterator over a tuple of the ouput edges and the corresponding input nodes
for the node referenced by the label.
Returns an iterator over a tuple of the ouput edges and the corresponding input nodes for the node referenced by the label .
&self
label
impl Into<NodeLabel>
&self
label
impl Into<NodeLabel>