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.

  1. class (Read sig, Monoid sig) => Transform sig

    synthesizer-core Synthesizer.Generic.Cut

    No documentation available.

  2. cacheForward :: (Element y, Transform sig y) => sig y -> Cache sig y

    synthesizer-core Synthesizer.Generic.Fourier

    The expression cacheForward prototype precomputes all data that is needed for forward Fourier transforms for signals of the type and length prototype. You can use this cache in transformWithCache.

  3. transformBackward :: (Element y, Transform sig y) => sig y -> sig y

    synthesizer-core Synthesizer.Generic.Fourier

    Shall we divide the result values by the length of the signal? Our dimensional wrapper around the Fourier transform does not expect this.

  4. transformForward :: (Element y, Transform sig y) => sig y -> sig y

    synthesizer-core Synthesizer.Generic.Fourier

    No documentation available.

  5. transformWithCache :: (Element y, Transform sig y) => Cache sig y -> sig y -> sig y

    synthesizer-core Synthesizer.Generic.Fourier

    The size and type of the signal must match the parameters, that the cache was generated for.

  6. class (Transform sig y, Transform0 sig, Read sig y) => Transform (sig :: Type -> Type) y

    synthesizer-core Synthesizer.Generic.Signal

    No documentation available.

  7. class Read0 sig => Transform0 (sig :: Type -> Type)

    synthesizer-core Synthesizer.Generic.Signal

    No documentation available.

  8. chirpTransform :: C y => y -> T y -> T y

    synthesizer-core Synthesizer.Plain.Analysis

    Almost naive implementation of the chirp transform, a generalization of the Fourier transform. More sophisticated algorithms like Rader, Cooley-Tukey, Winograd, Prime-Factor may follow.

  9. chirpTransform :: C y => y -> T y -> T y

    synthesizer-core Synthesizer.State.Analysis

    Almost naive implementation of the chirp transform, a generalization of the Fourier transform. More sophisticated algorithms like Rader, Cooley-Tukey, Winograd, Prime-Factor may follow.

  10. makeFormat :: (a -> Text) -> Format r (a -> r)

    turtle Turtle.Format

    Create your own format specifier

Page 1312 of many | Previous | Next