An alternative solution for Q.76

1. Consider a one-dimensional array Z, build a two-dimensional array whose first row is (Z[0],Z[1],Z[2]) and each subsequent row is shifted by 1 (last row should be (Z[-3],Z[-2],Z[-1]) (★★★) hint: from numpy.lib import stride_tricks

# Author: Joe Kington / Erik Rigtorp from numpy.lib import stride_tricks

def rolling(a, window): shape = (a.size - window + 1, window) strides = (a.strides[0], a.strides[0]) return stride_tricks.as_strided(a, shape=shape, strides=strides) Z = rolling(np.arange(10), 3) print(Z)

Same as the last issue, sliding_window_view is an easier function in NumPy. The new solution will be:

Z = np.arange(10)
print(sliding_window_view(Z, window_shape=(3)))

[rougier]

Perfect! If you can make (individual) PR, that would be fantastic.

[FirefoxMetzger]

@Jeff1999 It is of course a matter of taste, but .sum([-2, -1]) might be easier to read than .sum(-1).sum(-1).

Also, since you are omitting kwargs everywhere else, maybe sliding_window_view(Z, (k, k)) may be more consistent and shorter.