unpack_collections(expr)
Replace Delayed
with their keys
Convert literals to things the schedulers can handle
Extract dask graphs from all enclosed values
The object to be normalized. This function knows how to handle dask collections, as well as most builtin python types.
Normalize a python object and merge all sub-graphs.
>>> import daskThis example is valid syntax, but we were not able to check execution
... a = delayed(1, 'a')
... b = delayed(2, 'b')
... task, collections = unpack_collections([a, b, 3])
... task ['a', 'b', 3]
>>> collections (Delayed('a'), Delayed('b'))This example is valid syntax, but we were not able to check execution
>>> task, collections = unpack_collections({a: 1, b: 2})This example is valid syntax, but we were not able to check execution
... task (<class 'dict'>, [['a', 1], ['b', 2]])
>>> collections (Delayed('a'), Delayed('b'))See :
The following pages refer to to this document either explicitly or contain code examples using this.
dask.delayed.unpack_collections
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them