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.
sumsStaticInt :: C v => Int -> T v -> T vsynthesizer-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)
sums :: C v => Int -> T v -> T vsynthesizer-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.
sumsStaticInt :: C v => Int -> T v -> T vsynthesizer-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)
sumsDownsample2 :: (C v, Storable v) => T v -> T vsynthesizer-core Synthesizer.Storable.Filter.NonRecursive No documentation available.
sumsDownsample2Alt :: (C v, Storable v) => T v -> T vsynthesizer-core Synthesizer.Storable.Filter.NonRecursive No documentation available.
sumsPosModulatedPyramid :: (C v, Storable v) => Int -> T (Int, Int) -> T v -> T vsynthesizer-core Synthesizer.Storable.Filter.NonRecursive No documentation available.
sumFrom :: forall v s (m :: Type -> Type) . (VectorSpace v s, Monad m) => v -> Automaton m v vautomaton Data.Automaton Sum up all inputs so far, with an explicit initial value.
sumN :: forall (m :: Type -> Type) a . (Monad m, Num a) => Automaton m a aautomaton Data.Automaton Sum up all inputs so far, initialised at 0.
sumS :: forall (m :: Type -> Type) v s . (Monad m, VectorSpace v s) => Automaton m v vautomaton Data.Automaton Like sumFrom, initialised at 0.
-
beam-core Database.Beam.Backend.SQL.SQL92 No documentation available.