Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

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

  1. measMutatorWallSeconds :: Measured -> !Double

    criterion Criterion.Types

    (GC) Wall-clock time spent doing real work ("mutation"), as distinct from garbage collection. Access using fromDouble.

  2. measPeakMbAllocated :: Measured -> !Int64

    criterion Criterion.Types

    (GC) Max number of megabytes allocated. Access using fromInt.

  3. atomically :: STM a -> IO a

    stm Control.Monad.STM

    No documentation available.

  4. callCommand :: String -> IO ()

    process System.Process

    Creates a new process to run the specified shell command. If the command returns a non-zero exit code, an exception is raised. If an asynchronous exception is thrown to the thread executing callCommand, the forked process will be terminated and callCommand will wait (block) until the process has been terminated.

  5. callProcess :: FilePath -> [String] -> IO ()

    process System.Process

    Creates a new process to run the specified command with the given arguments, and wait for it to finish. If the command returns a non-zero exit code, an exception is raised. If an asynchronous exception is thrown to the thread executing callProcess, the forked process will be terminated and callProcess will wait (block) until the process has been terminated.

  6. hAllow :: HeaderName

    http-types Network.HTTP.Types

    Allow

  7. methodNotAllowed405 :: Status

    http-types Network.HTTP.Types

    Method Not Allowed 405

  8. hAllow :: HeaderName

    http-types Network.HTTP.Types.Header

    Allow

  9. methodNotAllowed405 :: Status

    http-types Network.HTTP.Types.Status

    Method Not Allowed 405

  10. module Data.Primitive.SmallArray

    Small arrays are boxed (im)mutable arrays. The underlying structure of the Array type contains a card table, allowing segments of the array to be marked as having been mutated. This allows the garbage collector to only re-traverse segments of the array that have been marked during certain phases, rather than having to traverse the entire array. SmallArray lacks this table. This means that it takes up less memory and has slightly faster writes. It is also more efficient during garbage collection so long as the card table would have a single entry covering the entire array. These advantages make them suitable for use as arrays that are known to be small. The card size is 128, so for uses much larger than that, Array would likely be superior.

Page 205 of many | Previous | Next