map package:Cabal

map f xs is the list obtained by applying f to each element of xs, i.e.,
map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
map f [x1, x2, ...] == [f x1, f x2, ...]
A Map from keys k to values a.
The mapMaybe function is a version of map which can throw out elements. In particular, the functional argument returns something of type Maybe b. If this is Nothing, no element is added on to the result list. If it is Just b, then b is included in the result list.


Using mapMaybe f x is a shortcut for catMaybes $ map f x in most cases:
>>> import Text.Read ( readMaybe )

>>> let readMaybeInt = readMaybe :: String -> Maybe Int

>>> mapMaybe readMaybeInt ["1", "Foo", "3"]

>>> catMaybes $ map readMaybeInt ["1", "Foo", "3"]
If we map the Just constructor, the entire list should be returned:
>>> mapMaybe Just [1,2,3]
An associative operation NOTE: This method is redundant and has the default implementation mappend = '(<>)' since base-
Monadic variant of mapAccumL.
O(1). Convert a graph into a map from keys to nodes. The resulting map m is guaranteed to have the property that all ((k,n) -> k == nodeKey n) (toList m).
Map a function over all the elements of a container and concatenate the resulting lists.
Map each element of the structure to a monoid, and combine the results.
Generically generate a Semigroup (<>) operation for any type implementing Generic. This operation will append two values by point-wise appending their component fields. It is only defined for product types.
gmappend a (gmappend b c) = gmappend (gmappend a b) c
A map from component name to all matching components. These coincide with componentGraph
A GHC version-dependent mapping of extensions to flags. This must be set to be able to make use of the ghcOptExtensions.
A map of dependencies. Newtyped since the default monoid instance is not appropriate. The monoid instance uses intersectVersionRanges.