Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

1. withForkWait :: IO () -> (IO () -> IO a) -> IO a

   process	System.Process.Internals

   Fork a thread while doing something else, but kill it if there's an exception. This is important in the cases above because we want to kill the thread that is holding the Handle lock, because when we clean up the process we try to close that handle, which could otherwise deadlock.

2. statusIsInformational :: Status -> Bool

   http-types	Network.HTTP.Types

   Informational class Checks if the status is in the 1XX range.

3. hMaxForwards :: HeaderName

   http-types	Network.HTTP.Types.Header

   Max-Forwards

4. statusIsInformational :: Status -> Bool

   http-types	Network.HTTP.Types.Status

   Informational class Checks if the status is in the 1XX range.

5. byteArrayAsForeignPtr :: ByteArray -> ForeignPtr Word8

   primitive	Data.Primitive.ByteArray

   Create a foreign pointer that points to the array's data. This operation is only safe on pinned byte arrays. The array's data is not garbage collected while references to the foreign pointer exist. Writing to the array through the foreign pointer results in undefined behavior.

6. mutableByteArrayAsForeignPtr :: MutableByteArray RealWorld -> ForeignPtr Word8

   primitive	Data.Primitive.ByteArray

   Variant of byteArrayAsForeignPtr for mutable byte arrays. Similarly, this is only safe on pinned mutable byte arrays. This function differs from the variant for immutable arrays in that it is safe to write to the array though the foreign pointer.

7. declareClassyFor :: [(String, (String, String))] -> [(String, String)] -> DecsQ -> DecsQ

   lens	Control.Lens.Combinators

   Similar to makeClassyFor, but takes a declaration quote.

8. declareLensesFor :: [(String, String)] -> DecsQ -> DecsQ

   lens	Control.Lens.Combinators

   Similar to makeLensesFor, but takes a declaration quote.

9. ifor :: (TraversableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f (t b)

   lens	Control.Lens.Combinators

   Traverse with an index (and the arguments flipped).

   for a ≡ ifor a . const
   ifor ≡ flip itraverse
   

10. iforM :: (TraversableWithIndex i t, Monad m) => t a -> (i -> a -> m b) -> m (t b)

    lens	Control.Lens.Combinators

    Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results, with access its position (and the arguments flipped).

    forM a ≡ iforM a . const
    iforM ≡ flip imapM
    

Page 414 of many | Previous | Next