insert_to_ooc(keys: 'list', chunks: 'tuple[tuple[int, ...], ...]', out, name: 'str', *, lock: 'Lock | bool' = True, region: 'slice | None' = None, return_stored: 'bool' = False, load_stored: 'bool' = False) -> 'dict'
Dask keys of the input array
Dask chunks of the input array
Where to store results to
First element of dask keys
Whether to lock or with what (default is True
, which means a threading.Lock
instance).
Where in out
to store arr
's results (default is None
, meaning all of out
).
Whether to return out
(default is False
, meaning None
is returned).
Whether to handling loading from out
at the same time. Ignored if return_stored
is not True
. (default is False
, meaning defer to return_stored
).
Creates a Dask graph for storing chunks from arr
in out
.
>>> import dask.array as daSee :
... d = da.ones((5, 6), chunks=(2, 3))
... a = np.empty(d.shape)
... insert_to_ooc(d.__dask_keys__(), d.chunks, a, "store-123") # doctest: +SKIP
The following pages refer to to this document either explicitly or contain code examples using this.
dask.array.core.insert_to_ooc
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