(split_every, nkeys)
| 315 | ], |
| 316 | ) |
| 317 | def test_split_every(split_every, nkeys): |
| 318 | dsk = {("a", i): i for i in range(100)} |
| 319 | t1 = Tuple(dsk, list(dsk)) |
| 320 | c = checkpoint(t1, split_every=split_every) |
| 321 | assert len(c.__dask_graph__()) == nkeys |
| 322 | assert c.compute(scheduler="sync") is None |
| 323 | |
| 324 | t2 = wait_on(t1, split_every=split_every) |
| 325 | assert len(t2.__dask_graph__()) == nkeys + 100 |
| 326 | assert t2.compute(scheduler="sync") == tuple(range(100)) |
| 327 | |
| 328 | dsk3 = {"b": 1, "c": 2} |
| 329 | t3 = Tuple(dsk3, list(dsk3)) |
| 330 | t4 = bind(t3, t1, split_every=split_every, assume_layers=False) |
| 331 | assert len(t4.__dask_graph__()) == nkeys + 2 |
| 332 | assert t4.compute(scheduler="sync") == (1, 2) |
| 333 | |
| 334 | |
| 335 | def test_split_every_invalid(): |
nothing calls this directly
no test coverage detected
searching dependent graphs…