Struct gantz::Graph [−][src]
pub struct Graph { /* fields omitted */ }The graph type
Methods
impl Graph[src]
impl Graphpub fn push_evaluation(&mut self, node: Index)[src]
pub fn push_evaluation(&mut self, node: Index)Push evaluation of the graph from the specified outlets on the given node.
- For each outlet on the given node, evaluate the output and use it to evaluate the input for each child inlet connected to this outlet.
- Repeat this for each child in BFS order.
pub fn pull_evaluation(&mut self, _node: Index, _inlets: &[Inlet])[src]
pub fn pull_evaluation(&mut self, _node: Index, _inlets: &[Inlet])Pull evaluation of the graph from the specified outlets on the given node.
This causes the graph to performa DFS through each of the inlets to find the deepest nodes. Evaluation occurs as though a "push" was sent simultaneously to each of the deepest nodes. Outlets are only calculated once per node. If an outlet value is required more than once, it will be borrowed accordingly.