Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

1. mapDB_ :: (HasCallStack, MonadDB m, FromRow row) => (row -> m r) -> m ()

   hpqtypes	Database.PostgreSQL.PQTypes.Fold

   Fetcher of rows returned by a query as a monadic map.

2. mapDBT :: (DBState n -> DBState m) -> (m (a, DBState m) -> n (b, DBState n)) -> DBT m a -> DBT n b

   hpqtypes	Database.PostgreSQL.PQTypes.Internal.Monad

   Transform the underlying monad.

3. mapped :: (Identical f, Functor h) => LensLike f (h a) (h b) a b

   lens-family-core	Lens.Family.Stock

   mapped :: Functor h => Setter (h a) (h b) a b
   

   An SEC referencing the parameter of a functor.

4. mapHandlers :: forall (m :: Type -> Type) (n :: Type -> Type) . (forall (a :: Method 'ClientToServer 'Request) . () => Handler m a -> Handler n a) -> (forall (a :: Method 'ClientToServer 'Notification) . () => Handler m a -> Handler n a) -> Handlers m -> Handlers n

   lsp	Language.LSP.Server

   No documentation available.

5. mapping :: forall (k :: Type -> Type -> Type) a b . Category k => (a -> b) -> Machine (k a) b

   machines	Data.Machine.Process

   Apply a function to all values coming from the input This can be constructed from a plan with

   mapping :: Category k => (a -> b) -> Machine (k a) b
   mapping f = repeatedly $ await >>= yield . f
   

   Examples:

   >>> runT $ mapping (*2) <~ source [1..3]
   [2,4,6]
   

6. map16 :: Word8

   messagepack	Data.MessagePack.Spec

   No documentation available.

7. map32 :: Word8

   messagepack	Data.MessagePack.Spec

   No documentation available.

8. mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

   Examples

   mapM is literally a traverse with a type signature restricted to Monad. Its implementation may be more efficient due to additional power of Monad.

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

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

   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.

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

    mixed-types-num	Numeric.MixedTypes.PreludeHiding

    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.

Page 223 of many | Previous | Next