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.
- the Map Functions wikipedia page
- Have a question about Map Functions not answered here? Email me and let me know how I can help.
Example from haskell:
class Functor f where fmap :: (a -> b) -> f a -> f b (<$) :: a -> f b -> f a
Last updated January 24th, 2020