MovingMap

f applied to each width-(w+1) window of list, sliding by 1 with no padding.

✓ checked against that system · ! checked, with disagreements (hover a chip)Wolfram LanguageMovingMap!↗

MovingMap(f, list, w)f applied to each window {list[i], …, list[i+w]} -- Length(list) - w results

Typed signatures

Type	Package	Applies
((collection<any>) -> any, collection<any>, integer) -> collection	combinatorics	always

Domain: Collections

Details

• Same as Map(f, Partition(list, w + 1, 1)) -- no boundary padding or clipping, unlike a centered-radius window.

Examples

Basic #

Each width-2 window has length 2 -- three windows from a 4-element list

live ↗

In$\mathrm{MovingMap}(\mathrm{Length}, \bigl\lbrack1, 2, 3, 4\bigr\rbrack, 1)$Out$\bigl\lbrack2, 2, 2\bigr\rbrack$

A window of width three slides along the list, averaging each

live ↗

In$\mathrm{MovingMap}(\mathrm{Mean}, \bigl\lbrack x_1, x_2, x_3, x_4, x_5\bigr\rbrack, 2)$Out$\bigl\lbrack\frac{x_1+x_2+x_3}{3}, \frac{x_2+x_3+x_4}{3}, \frac{x_3+x_4+x_5}{3}\bigr\rbrack$

live ↗

In$\mathrm{MovingMap}(\mathrm{Total}, \bigl\lbrack1, 2, 3, 4, 5\bigr\rbrack, 2)$Out$\bigl\lbrack6, 9, 12\bigr\rbrack$

Scope #

live ↗

In$\mathrm{MovingMap}(f, \mathrm{data}, 2)$Out$\mathrm{MovingMap}(f, \mathrm{data}, 2)$

live ↗

In$\mathrm{MovingMap}(f, v, 2)$Out$\mathrm{MovingMap}(f, v, 2)$

Properties #

live ↗

In$\mathrm{MovingMap}(()↦\mathrm{Last}(\operatorname{\_1})-\mathrm{First}(\operatorname{\_1}), \mathrm{data}, 1)$Out$\mathrm{MovingMap}(()↦\mathrm{Last}(\operatorname{\_1})-\mathrm{First}(\operatorname{\_1}), \mathrm{data}, 1)$

About

Examples	6
Checked against	Wolfram Language 3 agree3 differ
Crosswalk	Wolfram Language