`tierkreis.controller.storage.adjacency`¶

Graph information based on adjacency.

Module Contents¶

Functions¶

`unfinished_inputs`	Find the unfinished inputs of a node.
`outputs_iter`	Find all the outputs of a node and provide them with their index as map elements.

Data¶

logger

API¶

logger = 'getLogger(...)'¶

unfinished_inputs(storage: tierkreis.controller.storage.protocol.ControllerStorage, loc: tierkreis.controller.data.location.Loc, node: tierkreis.controller.data.graph.NodeDef) → list[tierkreis.controller.data.core.ValueRef]¶

Find the unfinished inputs of a node.

Parameters:

storage (ControllerStorage) – The storage to write from.
loc (Loc) – The node location to check for.
node (NodeDef) – The node definition containing the output names.

Returns:

A list of references to node inputs.

Return type:

list[ValueRef]

outputs_iter(storage: tierkreis.controller.storage.protocol.ControllerStorage, loc: tierkreis.controller.data.location.Loc) → list[tuple[int, tierkreis.controller.data.core.PortID]]¶

Find all the outputs of a node and provide them with their index as map elements.

This is only used in map nodes to go from the * port to the values of actual map elements. This can be from an unfold where we get (index, index) or map (index, “eval_output_name-index”)