Hoogle Search
Within LTS Haskell 24.45 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
uniformB :: UniformDistribution -> Doublestatistics Statistics.Distribution.Uniform Upper boundary of distribution
uniformDistr :: Double -> Double -> UniformDistributionstatistics Statistics.Distribution.Uniform Create uniform distribution.
uniformDistrE :: Double -> Double -> Maybe UniformDistributionstatistics Statistics.Distribution.Uniform Create uniform distribution.
rfor :: Monad m => Int -> Int -> (Int -> m ()) -> m ()statistics Statistics.Function Simple reverse-for loop. Counts from start-1 to end (which must be less than start).
welfordMean :: Vector v Double => v Double -> Doublestatistics Statistics.Sample O(n) Arithmetic mean. This uses Welford's algorithm to provide numerical stability, using a single pass over the sample data. Compared to mean, this loses a surprising amount of precision unless the inputs are very large.
-
Fourier-related transformations of mathematical functions. These functions are written for simplicity and correctness, not speed. If you need a fast FFT implementation for your application, you should strongly consider using a library of FFTW bindings instead.
fromForeignPtr :: ForeignPtr a -> Int -> Vector astorablevector Data.StorableVector.Base O(1) Build a Vector from a ForeignPtr
-
storablevector Data.StorableVector.Base Just like Unsafe.performIO, but we inline it. Big performance gains as it exposes lots of things to further inlining. Very unsafe. In particular, you should do no memory allocation inside an inlinePerformIO block. On Hugs this is just Unsafe.performIO.
toForeignPtr :: Vector a -> (ForeignPtr a, Int, Int)storablevector Data.StorableVector.Base O(1) Deconstruct a ForeignPtr from a Vector
-
tar Codec.Archive.Tar No documentation available.