Function _solve_dependencies

lantz/driver.py:470–494

Solve a dependency graph. :param dependencies: dependency dictionary. For each key, the value is an iterable indicating its dependencies. :param all_members: If provided :return: list of sets, each containing independent task only dependent of the p

(dependencies, all_members=None)

def _solve_dependencies(dependencies, all_members=None):
    """Solve a dependency graph.

    :param dependencies: dependency dictionary. For each key, the value is
                         an iterable indicating its dependencies.
    :param all_members: If provided
    :return: list of sets, each containing independent task only dependent of the
             previous set in the list.

    """
    d = dict((key, set(value)) for key, value in dependencies.items())
    if all_members:
        d.update({key: set() for key in all_members if key not in d})
    r = []
    while d:
        # values not in keys (items without dep)
        t = set(i for v in d.values() for i in v) - set(d.keys())
        # and keys without value (items without dep)
        t.update(k for k, v in d.items() if not v)
        # can be done right away
        r.append(t)
        # and cleaned up
        d = dict(((k, v - t) for k, v in d.items() if v))

    return r


def initialize_many(drivers, register_finalizer=True,