Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

  1. forkMapM :: (a -> IO b) -> [a] -> IO [Either SomeException b]

    monad-loops Control.Monad.Loops

    Like mapM, but run all the actions in parallel threads, collecting up the results and returning them all. Does not return until all actions finish.

  2. forkMapM_ :: (a -> IO b) -> [a] -> IO [Maybe SomeException]

    monad-loops Control.Monad.Loops

    like forkMapM but without bothering to keep the return values

  3. forkMapM__ :: (a -> IO b) -> [a] -> IO ()

    monad-loops Control.Monad.Loops

    like forkMapM_ but not even bothering to track success or failure of the child threads. Still waits for them all though.

  4. contramapGLogFunc :: (a -> b) -> GLogFunc b -> GLogFunc a

    rio RIO

    A contramap. Use this to wrap sub-loggers via mapRIO. If you are on base > 4.12.0, you can just use contramap.

  5. contramapMaybeGLogFunc :: (a -> Maybe b) -> GLogFunc b -> GLogFunc a

    rio RIO

    A vesion of contramapMaybeGLogFunc which supports filering.

  6. concatMap :: (Word8 -> ByteString) -> ByteString -> ByteString

    rio RIO.ByteString

    Map a function over a ByteString and concatenate the results

  7. concatMap :: (Word8 -> ByteString) -> ByteString -> ByteString

    rio RIO.ByteString.Lazy

    Map a function over a ByteString and concatenate the results

  8. module RIO.HashMap

    Strict Map with hashed keys. Import as:

    import qualified RIO.HashMap as HM
    
    This module does not export any partial functions. For those, see RIO.HashMap.Partial

  9. data HashMap k v

    rio RIO.HashMap

    A map from keys to values. A map cannot contain duplicate keys; each key can map to at most one value.

  10. fromMap :: HashMap a () -> HashSet a

    rio RIO.HashSet

    Convert from the equivalent HashMap with () values.

    >>> HashSet.fromMap (HashMap.singleton 1 ())
    fromList [1]
    

Page 491 of many | Previous | Next