Metadata-Version: 2.1
Name: pyungo
Version: 0.9.0
Summary: Function dependencies resolution and execution
Home-page: https://github.com/cedricleroy/pyungo
Author: Cedric Leroy
Author-email: cedie73@hotmail.fr
License: MIT
Keywords: dag workflow function dependency
Platform: UNKNOWN
Classifier: Development Status :: 3 - Alpha
Classifier: Intended Audience :: Developers
Classifier: License :: OSI Approved :: MIT License
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.6
Classifier: Programming Language :: Python :: 3.7
Classifier: Programming Language :: Python :: 3.8

pyungo
======

|pypi| |python-version| |build-status| |license|

pyungo is a lightweight library to link a set of dependent
functions together, and execute them in an ordered manner.

pyungo is built around ``Graphs`` and ``Nodes`` used in a
`DAG <https://en.wikipedia.org/wiki/Directed_acyclic_graph>`_
(Directed Acyclic Graph). A `Node` represent a function being
run with a defined set of inputs and returning one or several
outputs. A ``Graph`` is a collection of ``Nodes`` where data
can flow in an logical manner, the output of one node serving
as input of another.

installation
------------

.. code-block:: console

    >> pip install pyungo

simple example
--------------

.. code-block:: python

    graph = Graph()

    @graph.register()
    def f_my_function_2(d, a):
        e = d - a
        return e

    @graph.register()
    def f_my_function_1(c):
        d = c / 10
        return d

    @graph.register()
    def f_my_function_3(a, b):
        c = a + b
        return c

    res = graph.calculate(data={'a': 2, 'b': 3})
    print(res)

pyungo is registering the functions at import time. It then
resolve the ``DAG`` and figure out the sequence at which the
functions have to be run per their inputs / outputs. In this 
case, it will be function 3 then 1 and finally 2.

The ordered ``Graph`` is run with ``calculate``, with the given
data. It returns the output of the last function being 
run (e), but all intermediate results are also available 
in the ``graph`` instance.

The result will be (a + b) / 10 - a = -1.5

links
-----

* Documentation: https://cedricleroy.github.io/pyungo/
* Releases: https://pypi.org/project/pyungo/
* Tests: https://circleci.com/gh/cedricleroy/pyungo/


.. |pypi| image:: https://img.shields.io/pypi/v/pyungo.svg
    :target: https://pypi.org/project/pyungo/

.. |build-status| image:: https://circleci.com/gh/cedricleroy/pyungo.svg?style=shield
    :target: https://circleci.com/gh/cedricleroy/pyungo

.. |python-version| image:: https://img.shields.io/badge/python-3.6+-blue.svg
    :target: https://www.python.org/downloads/release/python-360/

.. |license| image:: https://img.shields.io/github/license/cedricleroy/pyungo.svg
    :target: https://github.com/cedricleroy/pyungo/blob/master/LICENSE.txt


