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.

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

    synthesizer-core Synthesizer.Generic.Filter.NonRecursive

    No documentation available.

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

    synthesizer-core Synthesizer.Generic.Filter.NonRecursive

    No documentation available.

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

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

    synthesizer-core Synthesizer.Generic.Filter.NonRecursive

    No documentation available.

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

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

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

  8. sum1 :: (C a, Read sig a) => sig a -> a

    synthesizer-core Synthesizer.Generic.Signal

    No documentation available.

  9. sumRange :: C v => T v -> (Int, Int) -> v

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

  10. sumRangeFromPyramid :: C v => [T v] -> (Int, Int) -> v

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

Page 52 of many | Previous | Next