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.

  1. sumAndConvolveTripleAlt :: (C a, C b, C c) => (a -> b -> c) -> Triple a -> Triple b -> ((a, b), (c, c, c, c, c))

    synthesizer-core Synthesizer.Generic.Filter.NonRecursive

    No documentation available.

  2. sumRange :: (C v, Transform sig v) => sig v -> (Int, Int) -> v

    synthesizer-core Synthesizer.Generic.Filter.NonRecursive

    No documentation available.

  3. sumRangeFromPyramid :: (C v, Transform sig v) => [sig v] -> (Int, Int) -> v

    synthesizer-core Synthesizer.Generic.Filter.NonRecursive

    No documentation available.

  4. sumRangeFromPyramidFoldr :: (C v, Transform sig v) => [sig v] -> (Int, Int) -> v

    synthesizer-core Synthesizer.Generic.Filter.NonRecursive

    No documentation available.

  5. sumRangeFromPyramidReverse :: (C v, Transform sig v) => [sig v] -> (Int, Int) -> v

    synthesizer-core Synthesizer.Generic.Filter.NonRecursive

    No documentation available.

  6. sums :: (C v, Transform sig v) => Int -> sig v -> sig v

    synthesizer-core Synthesizer.Generic.Filter.NonRecursive

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

  7. sumsDownsample2 :: (C v, Write sig v) => LazySize -> sig v -> sig v

    synthesizer-core Synthesizer.Generic.Filter.NonRecursive

    No documentation available.

  8. sumsPosModulated :: (C v, Transform sig (Int, Int), Transform sig v) => sig (Int, Int) -> sig v -> sig v

    synthesizer-core Synthesizer.Generic.Filter.NonRecursive

    No documentation available.

  9. sumsPosModulatedPyramid :: (C v, Transform sig (Int, Int), Write sig v) => Int -> sig (Int, Int) -> sig v -> sig v

    synthesizer-core Synthesizer.Generic.Filter.NonRecursive

    No documentation available.

  10. sumsStaticInt :: (C v, Write sig v) => Int -> sig v -> sig v

    synthesizer-core Synthesizer.Generic.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 51 of many | Previous | Next