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. mapTasks_ :: Foldable t => TaskGroup -> t (IO a) -> IO ()

   async-pool	Control.Concurrent.Async.Pool

   Execute a group of tasks within the given task group, ignoring results.

2. mappendMultipartData :: MultipartData tag -> MultipartData tag -> MultipartData tag

   autodocodec-servant-multipart	Autodocodec.Multipart

   No documentation available.

3. mapBBDB :: (BBDB -> BBDB) -> [BBDBFile] -> [BBDBFile]

   bbdb	Database.BBDB

   This and filterBBDB are the main functions you should use to manipulate a set of BBDB entries. You supply a function that applies a transformation on a BBDB record, and this function will apply that transformation to every BBDBEntry in a BBDB file. Sample usage:

   starCompanies = do
   b <- readBBDB "/home/henry/.bbdb"
   writeFile "/home/henry/.bbdb-new" $ asLisp . mapBBDB starCompany $ b
   where
   starCompany x = case (company x) of
   Nothing -> x
   Just y -> x { company = Just ("*" ++ y) }
   

   Prepend a star ("*") to each company field of a BBDB file and write the result out as a new bbdb file.

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

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

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

   bytezap	Bytezap.Poke.KnownLen

   No documentation available.

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

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

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

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

   classy-prelude-yesod	ClassyPrelude.Yesod

   Monadic mapAccumWhileC.

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

Page 375 of many | Previous | Next