# Map Functions

Map Functions is an actively used design pattern. Map is the name of a higher-order function that applies a given function to each element of a functor, e.g. a list, returning a list of results in the same order.

?Years Old |

- the Map Functions wikipedia page
- Have a question about Map Functions not answered here? Email me and let me know how I can help.

Languages **with** Map Functions include haskell, javascript

### Example from haskell:

class Functor f where fmap :: (a -> b) -> f a -> f b (<$) :: a -> f b -> f a

### Example from javascript:

[1,2.1].map(Math.round)

Last updated February 18th, 2020