# map -package:Cabal -package:base -package:text -package:pipes -package:containers -package:ghc -package:bytestring

O(n) Map a function over a vector.
Map a function over a Bundle
O(n) Map a function over a vector.
O(n) Map a function over a vector.
O(n) Map a function over a vector.
O(n) Map a function over a vector.
Transform this map by applying a function to every value.
Transform this set by applying a function to every value. The resulting set may be smaller than the source.
```>>> HashSet.map show (HashSet.fromList [1,2,3])
HashSet.fromList ["1","2","3"]
```
Transform the original string-like value but keep it case insensitive.
Not on Stackage, so not searched. Class of key-value maps
Apply a transformation to the other computation.
Map both the return value and output of a computation using the given function.
• ```runAccum (mapAccum f m) = f . runAccum
m```
Map both the return value and output of a computation using the given function.
• ```runAccumT (mapAccumT f m) = f .
runAccumT m```
Apply a function to transform the result of a continuation-passing computation.
• ```runCont (mapCont f m) = f . runCont
m```
Apply a function to transform the result of a continuation-passing computation. This has a more restricted type than the map operations for other monad transformers, because ContT does not define a functor in the category of monads.
• ```runContT (mapContT f m) = f . runContT
m```
Map the unwrapped computation using the given function.
• ```runExcept (mapExcept f m) = f (runExcept
m)```
Map the unwrapped computation using the given function.
• ```runExceptT (mapExceptT f m) = f
(runExceptT m)```
Lift a unary operation to the new monad.
Transform the computation inside a MaybeT.
• ```runMaybeT (mapMaybeT f m) = f (runMaybeT
m)```
Map the return value, final state and output of a computation using the given function.
• ```runRWS (mapRWS f m) r s = f (runRWS m r
s)```
Map the inner computation using the given function.
• runRWST (mapRWST f m) r s = f (runRWST m r s) mapRWST :: (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n b
Map the return value, final state and output of a computation using the given function.
• ```runRWS (mapRWS f m) r s = f (runRWS m r
s)```
Map the inner computation using the given function.
• ```runRWST (mapRWST f m) r s = f (runRWST m
r s)```