def mvavg(v, n):
windows = [islice(w, off, None) for off, w in enumerate(tee(v, n))]
return [sum(window) / n for window in zip(*windows)]
def mvavg(v, n):
windows = [islice(w, off, None) for off, w in enumerate(tee(v, n))]
return [sum(window) / n for window in zip(*windows)]
Maybe something like that would be a better use of a deque example? That or something that involves shifting things efficiently with/without a fixed size and not getting windows involved per se?
Maybe something like that would be a better use of a deque example? That or something that involves shifting things efficiently with/without a fixed size and not getting windows involved per se?
def mvavg(v, n):
windows = [islice(v, x, None) for x in range(n)]
return [sum(window) / n for window in zip(*windows)]
def mvavg(v, n):
windows = [islice(v, x, None) for x in range(n)]
return [sum(window) / n for window in zip(*windows)]