Hoogle Search
Within LTS Haskell 24.39 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
module Statistics.Sample.
Powers Very fast statistics over simple powers of a sample. These can all be computed efficiently in just a single pass over a sample, with that pass subject to stream fusion. The tradeoff is that some of these functions are less numerically robust than their counterparts in the Sample module. Where this is the case, the alternatives are noted.
-
statistics Statistics.Sample.Powers No documentation available.
-
statistics Statistics.Test.MannWhitneyU Test type for test which compare positional (mean,median etc.) information of samples.
-
statistics Statistics.Test.Types Test type for test which compare positional (mean,median etc.) information of samples.
-
statistics Statistics.Types Newtype wrapper for p-value.
module Data.StorableVector.Lazy.
Pattern Functions for StorableVector that allow control of the size of individual chunks. This is import for an application like the following: You want to mix audio signals that are relatively shifted. The structure of chunks of three streams may be illustrated as:
[____] [____] [____] [____] ... [____] [____] [____] [____] ... [____] [____] [____] [____] ...
When we mix the streams (zipWith3 (x y z -> x+y+z)) with respect to the chunk structure of the first signal, computing the first chunk requires full evaluation of all leading chunks of the stream. However the last value of the third leading chunk is much later in time than the last value of the first leading chunk. We like to reduce these dependencies using a different chunk structure, say[____] [____] [____] [____] ... [__] [____] [____] [____] ... [] [____] [____] [____] ...
module Data.StorableVector.Lazy.
Pointer In principle you can traverse through a lazy storable vector using repeated calls to viewL. However this needs a bit of pointer arrangement and allocation. This data structure makes the inner loop faster, that consists of traversing through a chunk.
-
storablevector Data.StorableVector.Lazy.Pointer No documentation available.
module Data.StorableVector.
Pointer In principle you can traverse through a storable vector using repeated calls to viewL or using index. However this needs a bit of pointer arrangement and allocation. This data structure should make loops optimally fast.
-
storablevector Data.StorableVector.Pointer We might have name the data type iterator.