Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

  1. idst2 :: Transform Double Double

    vector-fftw Numeric.FFT.Vector.Invertible

    A type-3 discrete sine transform which is the inverse of dst2.

    y_k = (1/(2n)) [(-1)^k x_(n-1) + 2 sum_(j=0)^(n-2) x_j sin(pi(j+1)(k+1/2)/n)]
    

  2. idst3 :: Transform Double Double

    vector-fftw Numeric.FFT.Vector.Invertible

    A type-2 discrete sine transform which is the inverse of dst3.

    y_k = (1/n) sum_(j=0)^(n-1) x_j sin(pi(j+1/2)(k+1)/n)
    

  3. idst4 :: Transform Double Double

    vector-fftw Numeric.FFT.Vector.Invertible

    A type-4 discrete sine transform which is the inverse of dst4.

    y_k = (1/(2n)) sum_(j=0)^(n-1) x_j sin(pi(j+1/2)(k+1/2)/n)
    

  4. idft :: TransformND (Complex Double) (Complex Double)

    vector-fftw Numeric.FFT.Vector.Invertible.Multi

    A backward discrete Fourier transform which is the inverse of dft. The output and input sizes are the same (n).

  5. idct2 :: Transform Double Double

    vector-fftw Numeric.FFT.Vector.Unitary

    A type-3 discrete cosine transform which is the inverse of dct2. y_k = (-1)^k w(n-1) x_(n-1) + 2 sum_(j=0)^(n-2) w(j) x_j sin(pi(j+1)(k+1/2)/n); where w(0)=1/sqrt(n), and w(k)=1/sqrt(2n) for k>0.

  6. idft :: Transform (Complex Double) (Complex Double)

    vector-fftw Numeric.FFT.Vector.Unitary

    An inverse discrete Fourier transform. The output and input sizes are the same (n).

    y_k = (1/sqrt n) sum_(j=0)^(n-1) x_j e^(2pi i j k/n)
    

  7. idft :: TransformND (Complex Double) (Complex Double)

    vector-fftw Numeric.FFT.Vector.Unitary.Multi

    An inverse discrete Fourier transform. The output and input sizes are the same (n).

    y_k = (1/sqrt n) sum_(j=0)^(n-1) x_j e^(2pi i j k/n)
    

  8. idft :: Transform (Complex Double) (Complex Double)

    vector-fftw Numeric.FFT.Vector.Unnormalized

    A backward discrete Fourier transform. The output and input sizes are the same (n).

    y_k = sum_(j=0)^(n-1) x_j e^(2pi i j k/n)
    

  9. idft :: TransformND (Complex Double) (Complex Double)

    vector-fftw Numeric.FFT.Vector.Unnormalized.Multi

    A backward discrete Fourier transform. The output and input sizes are the same (n).

  10. idToken :: OAuth2Token -> Maybe IdToken

    yesod-auth-oauth2 Network.OAuth.OAuth2.Compat

    Exists when openid scope is in the Authorization Request and the provider supports OpenID protocol.

Page 329 of many | Previous | Next