Map (higher-order function): Difference between revisions

Revision as of 21:59, 12 October 2020

Revision as of 17:08, 8 January 2021

Line 2:

{{one source|date=November 2012}}

In many [[programming language]]s, '''map''' is the name of a [[higher-order function]] that applies a [[procedural parameter|given function]] to each element of a [[Functor (disambiguationfunctional programming)|functor]], e.g. a [[list (computing)|list]], returning a list of results in the same order. It is often called ''apply-to-all'' when considered in [[functional form]].

The concept of a map is not limited to lists: it works for sequential [[Container (abstract data type)|containers]], tree-like containers, or even abstract containers such as [[futures and promises]].

Line 383:

==See also==

*[[Functor (functional programming)]]
*[[Convolution (computer science)]], also termed ''conv'' or ''zip''

* [[Filter (higher-order function)]]

* [[Fold (higher-order function)]]