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. module Liquid.Prelude.Totality_LHAssumptions

    No documentation available.

  2. module Prelude_LHAssumptions

    No documentation available.

  3. kahanSum :: [Double] -> Double

    logfloat Data.Number.LogFloat.Raw

    O(n). Floating-point summation, via Kahan's algorithm. This is nominally equivalent to sum, but greatly mitigates the problem of losing precision. N.B., this only requires a single pass over the data; but we use a strict left fold for performance, so it's still not amenable to list fusion.

  4. logSumExp :: [Double] -> Double

    logfloat Data.Number.LogFloat.Raw

    O(n). Log-domain summation, aka: (log . sum . fmap exp). Algebraically this is ⨆ xs, which is the log-domain equivalent of ∑ xs. N.B., this function requires two passes over the input. Thus, it is not amenable to list fusion, and hence will use a lot of memory when summing long lists.

  5. asum :: Additive a => Mealy a a

    mealy Data.Mealy

    accumulated sum

  6. medAbsSum :: Medianer a b -> a

    mealy Data.Mealy

    No documentation available.

  7. sSum :: Num n => SFlow n n

    midair Midair.Handy

    Add all values from the input stream

  8. sSumHS :: Num n => Maybe n -> SFlow n n

    midair Midair.Handy

    Hotswap version of sSum

  9. package monad-resumption

    Resumption and reactive resumption monads for Haskell. This package contains the definitions of Resumption and Reactive Resumption Monads.

  10. module Control.Monad.Resumption

    A resumption monad transformer, based on the formulation in the article Cheap (But Functional) Threads by William L. Harrison and Adam Procter.

Page 353 of many | Previous | Next