Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

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

    synthesizer-core Synthesizer.Plain.Filter.NonRecursive

    No documentation available.

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

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

    synthesizer-core Synthesizer.Plain.Filter.NonRecursive

    No documentation available.

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

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

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

  7. sumsDownsample2 :: (C v, Storable v) => T v -> T v

    synthesizer-core Synthesizer.Storable.Filter.NonRecursive

    No documentation available.

  8. sumsDownsample2Alt :: (C v, Storable v) => T v -> T v

    synthesizer-core Synthesizer.Storable.Filter.NonRecursive

    No documentation available.

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

    synthesizer-core Synthesizer.Storable.Filter.NonRecursive

    No documentation available.

  10. sumFrom :: forall v s (m :: Type -> Type) . (VectorSpace v s, Monad m) => v -> Automaton m v v

    automaton Data.Automaton

    Sum up all inputs so far, with an explicit initial value.

Page 53 of many | Previous | Next