(a, b)
| 189 | |
| 190 | |
| 191 | def same_keys(a, b): |
| 192 | def key(k): |
| 193 | if isinstance(k, str): |
| 194 | return (k, -1, -1, -1) |
| 195 | else: |
| 196 | return k |
| 197 | |
| 198 | return sorted(a.dask, key=key) == sorted(b.dask, key=key) |
| 199 | |
| 200 | |
| 201 | def _not_empty(x): |
no outgoing calls
searching dependent graphs…