No project description provided
A function composition framework that supports:
- State - functions which retain state for their next turn of action.
- Prioritized paths - lazily attempt overloaded composition paths according to priorities.
- Deep dependency injection - compose a function to a variadic function at the end of an arbitrarily long pipeline.
- Non cancerous
pip install computation-graph
python setup.py sdist bdist_wheel; twine upload dist/*; rm -rf dist/;
The runner will type check all outputs for nodes with return type annotations. In case of a wrong typing, it will log the node at fault.
Available computation trace visualizers:
To use, replace
run.to_callable_with_side_effect with your selected style as the first argument.
This debugger will save a file on each graph execution to current working directory.
You can use this file in a graph viewer like gephi. Nodes colored red are part of the 'winning' computation path. Each of these nodes has the attributes 'result' and 'state'. 'result' is the output of the node, and 'state' is the new state of the node.
In gephi you can filter for the nodes participating in calculation of final result by filtering on result != null.
Release history Release notifications | RSS feed
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.