Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. sumRangeFromPyramidFoldr :: C v => [T v] -> (Int, Int) -> v

   synthesizer-core	Synthesizer.Plain.Filter.NonRecursive

   No documentation available.

2. sumRangeFromPyramidRec :: C v => [T v] -> (Int, Int) -> v

   synthesizer-core	Synthesizer.Plain.Filter.NonRecursive

   No documentation available.

3. sums :: C v => Int -> T v -> T v

   synthesizer-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.

4. sumsDownsample2 :: C v => T v -> T v

   synthesizer-core	Synthesizer.Plain.Filter.NonRecursive

   No documentation available.

5. sumsPosModulated :: C v => T (Int, Int) -> T v -> T v

   synthesizer-core	Synthesizer.Plain.Filter.NonRecursive

   No documentation available.

6. sumsPosModulatedPyramid :: C v => Int -> T (Int, Int) -> T v -> T v

   synthesizer-core	Synthesizer.Plain.Filter.NonRecursive

   Moving average, where window bounds must be always non-negative. The laziness granularity is 2^height.

7. sumsPyramid :: C v => Int -> T v -> T v

   synthesizer-core	Synthesizer.Plain.Filter.NonRecursive

   No documentation available.

8. sumsStaticInt :: C v => Int -> T v -> T v

   synthesizer-core	Synthesizer.Plain.Filter.Recursive.MovingAverage

   Like sums but in a recursive form. This needs only linear time (independent of the window size) but may accumulate rounding errors.

   ys = xs * (1,0,0,0,-1) / (1,-1)
   ys * (1,-1) = xs * (1,0,0,0,-1)
   ys = xs * (1,0,0,0,-1) + ys * (0,1)
   

9. sums :: C v => Int -> T v -> T v

   synthesizer-core	Synthesizer.State.Filter.NonRecursive

   Moving (uniformly weighted) average in the most trivial form. This is very slow and needs about n * length x operations.

10. sumsStaticInt :: C v => Int -> T v -> T v

    synthesizer-core	Synthesizer.State.Filter.Recursive.MovingAverage

    Like sums but in a recursive form. This needs only linear time (independent of the window size) but may accumulate rounding errors.

    ys = xs * (1,0,0,0,-1) / (1,-1)
    ys * (1,-1) = xs * (1,0,0,0,-1)
    ys = xs * (1,0,0,0,-1) + ys * (0,1)
    

Page 53 of many | Previous | Next