dask 2021.10.0

BackRef
sortkey(item)

Both strings and tuples are common key types in dask graphs. However In Python 3 one can not compare strings with tuples directly. This function maps many types to a form where they can be compared

Sorting key function that is robust to different types

Examples

This example is valid syntax, but we were not able to check execution
>>> sortkey('Hello')
('str', 'Hello')
This example is valid syntax, but we were not able to check execution
>>> sortkey(('x', 1))
('tuple', ('x', 1))
See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

dask.local.sortkey

Local connectivity graph

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


File: /dask/local.py#594
type: <class 'function'>
Commit: