Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. mapWithKey :: (BKey -> a -> b) -> BDictMap a -> BDictMap b

   bencoding	Data.BEncode.BDict

   O(n). Map a function over all keys/value pairs in the dictionary.

2. mapHandle :: forall (e :: Effects) (es :: Effects) . (Handle h, e :> es) => h e -> h es

   bluefin	Bluefin.Compound

   Used to create compound effects, i.e. handles that contain other handles.

3. mappend' :: forall (n :: Natural) s (m :: Natural) . PokeKnownLen n s -> PokeKnownLen m s -> PokeKnownLen (n + m) s

   bytezap	Bytezap.Poke.KnownLen

   No documentation available.

4. 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

   classy-prelude-yesod	ClassyPrelude.Yesod

   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]]
   

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

   classy-prelude-yesod	ClassyPrelude.Yesod

   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.

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

   classy-prelude-yesod	ClassyPrelude.Yesod

   Monadic mapAccumWhileC.

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

   classy-prelude-yesod	ClassyPrelude.Yesod

   Apply a transformation to all values in a stream.

8. mapCE :: forall (m :: Type -> Type) f a b . (Monad m, Functor f) => (a -> b) -> ConduitT (f a) (f b) m ()

   classy-prelude-yesod	ClassyPrelude.Yesod

   Apply a transformation to all elements in a chunked stream.

9. mapConcurrently :: (MonadUnliftIO m, Traversable t) => (a -> m b) -> t a -> m (t b)

   classy-prelude-yesod	ClassyPrelude.Yesod

   Executes a Traversable container of items concurrently, it uses the Flat type internally.

10. mapConcurrently_ :: (MonadUnliftIO m, Foldable f) => (a -> m b) -> f a -> m ()

    classy-prelude-yesod	ClassyPrelude.Yesod

    Executes a Traversable container of items concurrently, it uses the Flat type internally. This function ignores the results.

Page 376 of many | Previous | Next