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. mapsPost :: forall (m :: Type -> Type) f g r . (Monad m, Functor g) => (forall x . () => f x -> g x) -> Stream f m r -> Stream g m r

   streaming	Streaming.Prelude

   Map layers of one functor to another with a transformation. Compare hoist, which has a similar effect on the monadic parameter.

   mapsPost id = id
   mapsPost f . mapsPost g = mapsPost (f . g)
   mapsPost f = maps f
   

   mapsPost is essentially the same as maps, but it imposes a Functor constraint on its target functor rather than its source functor. It should be preferred if fmap is cheaper for the target functor than for the source functor.

2. mapMaybe :: Filterable f => (a -> Maybe b) -> f a -> f b

   witherable	Witherable

   Like mapMaybe.

3. mapStateVar :: (b -> a) -> (a -> b) -> StateVar a -> StateVar b

   StateVar	Data.StateVar

   Change the type of a StateVar

4. mapFromUnboxed :: PrimType a => (a -> b) -> UArray a -> Array b

   basement	Basement.BoxedArray

   No documentation available.

5. mapToUnboxed :: PrimType b => (a -> b) -> Array a -> UArray b

   basement	Basement.BoxedArray

   No documentation available.

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

   basement	Basement.Compat.Base

   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.

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

   basement	Basement.Imports

   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. mapM :: forall m a b (n :: Nat) . Monad m => (a -> m b) -> ListN n a -> m (ListN n b)

   basement	Basement.Sized.List

   Map each element of a List to a monadic action, evaluate these actions sequentially and collect the results

9. mapM_ :: forall m a b (n :: Nat) . Monad m => (a -> m b) -> ListN n a -> m ()

   basement	Basement.Sized.List

   Map each element of a List to a monadic action, evaluate these actions sequentially and ignore the results

10. mapi :: forall a b (n :: Nat) . (Natural -> a -> b) -> ListN n a -> ListN n b

    basement	Basement.Sized.List

    Map all elements in a list with an additional index

Page 183 of many | Previous | Next