Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

1. monoidConcat :: Monoid m => T m -> m

   synthesizer-core	Synthesizer.State.Signal

   Deprecated: Use foldMap instead.

2. monoidConcatMap :: Monoid m => (a -> m) -> T a -> m

   synthesizer-core	Synthesizer.State.Signal

   Deprecated: Use foldMap instead.

3. arrangeEquidist :: (Storable v, C v) => ChunkSize -> T Int (T v) -> T v

   synthesizer-core	Synthesizer.Storable.Cut

   The result is a Lazy StorableVector with chunks of the given size.

4. accumulateBinPosModulatedPyramid :: Storable v => (v -> v -> v) -> Int -> T (Int, Int) -> T v -> T v

   synthesizer-core	Synthesizer.Storable.Filter.NonRecursive

   No documentation available.

5. accumulatePosModulatedPyramid :: Storable v => ([T v] -> (Int, Int) -> v) -> ([Int], [T v]) -> T (Int, Int) -> T v

   synthesizer-core	Synthesizer.Storable.Filter.NonRecursive

   Moving average, where window bounds must be always non-negative. The laziness granularity is 2^height. This function is only slightly more efficient than its counterpart from Generic.Filter, since it generates strict blocks and not one-block chunky signals.

6. movingAccumulateModulatedPyramid :: Storable v => (v -> v -> v) -> v -> Int -> Int -> T Int -> T v -> T v

   synthesizer-core	Synthesizer.Storable.Filter.NonRecursive

   No documentation available.

7. movingAverageModulatedPyramid :: (C a, C a v, Storable Int, Storable v) => a -> Int -> Int -> T Int -> T v -> T v

   synthesizer-core	Synthesizer.Storable.Filter.NonRecursive

   The first argument is the amplification. The main reason to introduce it, was to have only a Module constraint instead of Field. This way we can also filter stereo signals.

8. pyramid :: Storable v => (v -> v -> v) -> Int -> 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. class Semigroup a => Monoid a

    turtle	Turtle

    The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following:

    • Right identity x <> mempty = x
    • Left identity mempty <> x = x
    • Associativity x <> (y <> z) = (x <> y) <> z (Semigroup law)
    • Concatenation mconcat = foldr (<>) mempty
    You can alternatively define mconcat instead of mempty, in which case the laws are:
    • Unit mconcat (pure x) = x
    • Multiplication mconcat (join xss) = mconcat (fmap mconcat xss)
    • Subclass mconcat (toList xs) = sconcat xs
    The method names refer to the monoid of lists under concatenation, but there are many other instances. Some types can be viewed as a monoid in more than one way, e.g. both addition and multiplication on numbers. In such cases we often define newtypes and make those instances of Monoid, e.g. Sum and Product. NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.

Page 1330 of many | Previous | Next