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.

Exact lookup

1. fmapL :: (a -> b) -> Either a r -> Either b r

   errors	Data.EitherR

   Map a function over the Left value of an Either

2. fmapLT :: forall (m :: Type -> Type) a b r . Functor m => (a -> b) -> ExceptT a m r -> ExceptT b m r

   errors	Data.EitherR

   Map a function over the Left value of an ExceptT

3. peekMap :: (LuaError e, Ord a) => Peeker e a -> Peeker e b -> Peeker e (Map a b)

   hslua-marshalling	HsLua.Marshalling

   Retrieves a key-value Lua table as Map.

4. peekMap :: (LuaError e, Ord a) => Peeker e a -> Peeker e b -> Peeker e (Map a b)

   hslua-marshalling	HsLua.Marshalling.Peekers

   Retrieves a key-value Lua table as Map.

5. pushMap :: LuaError e => Pusher e a -> Pusher e b -> Pusher e (Map a b)

   hslua-marshalling	HsLua.Marshalling.Push

   Push Map as default key-value Lua table.

6. ismap_ :: Text -> Attribute

   lucid	Lucid.Html5

   The ismap attribute.

7. usemap_ :: Text -> Attribute

   lucid	Lucid.Html5

   The usemap attribute.

8. concatMap :: (Storable a, Storable b) => (a -> Vector b) -> Vector a -> Vector b

   storablevector	Data.StorableVector

   Map a function over a Vector and concatenate the results

9. foldMap :: (Storable a, Monoid m) => (a -> m) -> Vector a -> m

   storablevector	Data.StorableVector

   This is like mconcat . map f, but in many cases the result of f will not be storable.

10. monoidConcatMap :: (Storable a, Monoid m) => (a -> m) -> Vector a -> m

    storablevector	Data.StorableVector

    Deprecated: Use foldMap instead.

Page 496 of many | Previous | Next