Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. mapConcurrently_ :: Foldable f => (a -> IO b) -> f a -> IO ()

   async	Control.Concurrent.Async.Internal

   mapConcurrently_ is mapConcurrently with the return value discarded; a concurrent equivalent of mapM_.

2. mapAccumLM :: Monad m => (acc -> x -> m (acc, y)) -> acc -> [x] -> m (acc, [y])

   test-framework	Test.Framework.Providers.API

   No documentation available.

3. mappendBy :: Monoid b => (a -> b) -> a -> a -> b

   test-framework	Test.Framework.Providers.API

   No documentation available.

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

   optparse-applicative	Options.Applicative

   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.

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

   optparse-applicative	Options.Applicative.Builder

   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.

6. mapParser :: (forall x . () => ArgumentReachability -> Option x -> b) -> Parser a -> [b]

   optparse-applicative	Options.Applicative.Common

   Map a polymorphic function over all the options of a parser, and collect the results in a list.

7. mapAccumS :: forall (m :: Type -> Type) a s b . Monad m => (a -> s -> ConduitT b Void m s) -> s -> ConduitT () b m () -> ConduitT a Void m s

   conduit	Conduit

   Consume a source with a strict accumulator, in a way piecewise defined by a controlling stream. The latter will be evaluated until it terminates.

   >>> let f a s = liftM (:s) $ mapC (*a) =$ CL.take a
   
   >>> reverse $ runIdentity $ yieldMany [0..3] $$ mapAccumS f [] (yieldMany [1..])
   [[],[1],[4,6],[12,15,18]] :: [[Int]]
   

8. mapAccumWhileC :: forall (m :: Type -> Type) a s b . Monad m => (a -> s -> Either s (s, b)) -> s -> ConduitT a b m s

   conduit	Conduit

   mapWhileC with a break condition dependent on a strict accumulator. Equivalently, mapAccum as long as the result is Right. Instead of producing a leftover, the breaking input determines the resulting accumulator via Left.

9. mapAccumWhileMC :: Monad m => (a -> s -> m (Either s (s, b))) -> s -> ConduitT a b m s

   conduit	Conduit

   Monadic mapAccumWhileC.

10. mapC :: forall (m :: Type -> Type) a b . Monad m => (a -> b) -> ConduitT a b m ()

    conduit	Conduit

    Apply a transformation to all values in a stream.

Page 75 of many | Previous | Next