Trim sides from each block. This couples well with the ``map_overlap`` operation which may leave excess data on each block. See also -------- dask.array.overlap.map_overlap
(x, depth, boundary=None)
| 92 | |
| 93 | |
| 94 | def trim_overlap(x, depth, boundary=None): |
| 95 | """Trim sides from each block. |
| 96 | |
| 97 | This couples well with the ``map_overlap`` operation which may leave |
| 98 | excess data on each block. |
| 99 | |
| 100 | See also |
| 101 | -------- |
| 102 | dask.array.overlap.map_overlap |
| 103 | |
| 104 | """ |
| 105 | |
| 106 | # parameter to be passed to trim_internal |
| 107 | axes = coerce_depth(x.ndim, depth) |
| 108 | return trim_internal(x, axes=axes, boundary=boundary) |
| 109 | |
| 110 | |
| 111 | def trim_internal(x, axes, boundary=None): |
nothing calls this directly
no test coverage detected
searching dependent graphs…