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.
sum1 :: (C a, Read sig a) => sig a -> asynthesizer-core Synthesizer.Generic.Signal No documentation available.
sumRange :: C v => T v -> (Int, Int) -> vsynthesizer-core Synthesizer.Plain.Filter.NonRecursive Compute the sum of the values from index l to (r-1). (I.e. somehow a right open interval.) This can be used for implementation of a moving average filter. However, its counterpart sumRangeFromPyramid is much faster for large windows.
sumRangeFromPyramid :: C v => [T v] -> (Int, Int) -> vsynthesizer-core Synthesizer.Plain.Filter.NonRecursive This function should be much faster than sumRange but slower than the recursively implemented movingAverage. However in contrast to movingAverage it should not suffer from cancelation.
sumRangeFromPyramidFoldr :: C v => [T v] -> (Int, Int) -> vsynthesizer-core Synthesizer.Plain.Filter.NonRecursive No documentation available.
sumRangeFromPyramidRec :: C v => [T v] -> (Int, Int) -> vsynthesizer-core Synthesizer.Plain.Filter.NonRecursive No documentation available.
sums :: C v => Int -> T v -> T vsynthesizer-core Synthesizer.Plain.Filter.NonRecursive Moving (uniformly weighted) average in the most trivial form. This is very slow and needs about n * length x operations.
sumsDownsample2 :: C v => T v -> T vsynthesizer-core Synthesizer.Plain.Filter.NonRecursive No documentation available.
sumsPosModulated :: C v => T (Int, Int) -> T v -> T vsynthesizer-core Synthesizer.Plain.Filter.NonRecursive No documentation available.
sumsPosModulatedPyramid :: C v => Int -> T (Int, Int) -> T v -> T vsynthesizer-core Synthesizer.Plain.Filter.NonRecursive Moving average, where window bounds must be always non-negative. The laziness granularity is 2^height.
sumsPyramid :: C v => Int -> T v -> T vsynthesizer-core Synthesizer.Plain.Filter.NonRecursive No documentation available.