()
| 422 | |
| 423 | |
| 424 | def test_keys(): |
| 425 | dsk = {("x", i, j): () for i in range(5) for j in range(6)} |
| 426 | dx = Array(dsk, "x", chunks=(10, 10), shape=(50, 60), dtype="f8") |
| 427 | assert dx.__dask_keys__() == [[(dx.name, i, j) for j in range(6)] for i in range(5)] |
| 428 | # Cache works |
| 429 | assert dx.__dask_keys__() is dx.__dask_keys__() |
| 430 | # Test mutating names clears key cache |
| 431 | dx.dask = {("y", i, j): () for i in range(5) for j in range(6)} |
| 432 | dx._name = "y" |
| 433 | new_keys = [[(dx.name, i, j) for j in range(6)] for i in range(5)] |
| 434 | assert dx.__dask_keys__() == new_keys |
| 435 | assert np.array_equal(dx._key_array, np.array(new_keys, dtype="object")) |
| 436 | d = Array({}, "x", (), shape=(), dtype="f8") |
| 437 | assert d.__dask_keys__() == [("x",)] |
| 438 | |
| 439 | |
| 440 | def test_Array_computation(): |
nothing calls this directly
no test coverage detected
searching dependent graphs…