(x, y=0)
| 489 | dy = db.from_sequence(y, npartitions=10) |
| 490 | |
| 491 | def maximum(x, y=0): |
| 492 | y = repeat(y) if isinstance(y, int) else y |
| 493 | return [max(a, b) for (a, b) in zip(x, y)] |
| 494 | |
| 495 | sol = maximum(x, y=10) |
| 496 | assert_eq(db.map_partitions(maximum, dx, y=10), sol) |
no test coverage detected
searching dependent graphs…