Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapMaybeWithKey :: (k -> v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2unordered-containers Data.HashMap.Strict Transform this map by applying a function to every value and retaining only some of them.
mapWithKey :: (k -> v1 -> v2) -> HashMap k v1 -> HashMap k v2unordered-containers Data.HashMap.Strict Transform this map by applying a function to every value.
mapSize :: Testable prop => (Int -> Int) -> prop -> Propertytasty-quickcheck Test.Tasty.QuickCheck Adjust the test case size for a property, by transforming it with the given function.
mapHashed :: Hashable b => (a -> b) -> Hashed a -> Hashed bhashable Data.Hashable mapCatchT :: (m (Either SomeException a) -> n (Either SomeException b)) -> CatchT m a -> CatchT n bexceptions Control.Monad.Catch.Pure Map the unwrapped computation using the given function.
runCatchT (mapCatchT f m) = f (runCatchT m)
mapArray :: (MArray a e' m, MArray a e m, Ix i) => (e' -> e) -> a i e' -> m (a i e)array Data.Array.Base Constructs a new array derived from the original array by applying a function to each of the elements.
mapIndices :: (MArray a e m, Ix i, Ix j) => (i, i) -> (i -> j) -> a j e -> m (a i e)array Data.Array.Base Constructs a new array derived from the original array by applying a function to each of the indices.
mapMArrayM_ :: (MArray a e m, Ix i) => (e -> m b) -> a i e -> m ()array Data.Array.Base Map elements to monadic actions, sequence them left-to-right, and discard the results.
mapArray :: (MArray a e' m, MArray a e m, Ix i) => (e' -> e) -> a i e' -> m (a i e)array Data.Array.MArray Constructs a new array derived from the original array by applying a function to each of the elements.
mapIndices :: (MArray a e m, Ix i, Ix j) => (i, i) -> (i -> j) -> a j e -> m (a i e)array Data.Array.MArray Constructs a new array derived from the original array by applying a function to each of the indices.