Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. mapBy :: (ByteString -> a -> Maybe b) -> Trie a -> Trie b

   bytestring-trie	Data.Trie

   Keyed version of filterMap. Warning: This function suffers Bug #25.

2. mapBy :: (ByteString -> a -> Maybe b) -> Trie a -> Trie b

   bytestring-trie	Data.Trie.Internal

   Keyed version of filterMap. Warning: This function suffers Bug #25.

3. mapCabal :: forall (m :: Type -> Type) . Monad m => PackageName -> DebBase -> CabalT m ()

   cabal-debian	Debian.Debianize

   Map all versions of Cabal package pname to Debian package dname. Not really a debian package name, but the name of a cabal package that maps to the debian package name we want. (Should this be a SrcPkgName?)

4. mapCabal :: forall (m :: Type -> Type) . Monad m => PackageName -> DebBase -> CabalT m ()

   cabal-debian	Debian.Debianize.DebianName

   Map all versions of Cabal package pname to Debian package dname. Not really a debian package name, but the name of a cabal package that maps to the debian package name we want. (Should this be a SrcPkgName?)

5. mapFieldNames :: (String -> String) -> [FieldDescr a] -> [FieldDescr a]

   cabal-install	Distribution.Client.ParseUtils

   Apply a name mangling function to the field names of all the field descriptions. The typical use case is to apply some prefix.

6. mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()

   calligraphy	Calligraphy.Prelude

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ is just like traverse_, but specialised to monadic actions.

7. mappend :: Monoid a => a -> a -> a

   calligraphy	Calligraphy.Prelude

   An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

8. mapError :: (MonadError e m, MonadError e' n) => (m (Either e a) -> n (Either e' b)) -> m a -> n b

   can-i-haz	Control.Monad.Except.CoHas

   MonadError analogue of the mapExceptT function. The computation is unwrapped, a function is applied to the Either, and the result is lifted into the second MonadError instance.

9. mapExcept :: (Either e a -> Either e' b) -> Except e a -> Except e' b

   can-i-haz	Control.Monad.Except.CoHas

   Map the unwrapped computation using the given function.

   • runExcept (mapExcept f m) = f (runExcept
     m)

10. mapExceptT :: (m (Either e a) -> n (Either e' b)) -> ExceptT e m a -> ExceptT e' n b

    can-i-haz	Control.Monad.Except.CoHas

    Map the unwrapped computation using the given function.

    • runExceptT (mapExceptT f m) = f
      (runExceptT m)

Page 280 of many | Previous | Next