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.

Exact lookup

1. ideographic :: WriteAttr Element Float

   threepenny-gui	Graphics.UI.Threepenny.SVG

   No documentation available.

2. ideographic :: WriteAttr Element Float

   threepenny-gui	Graphics.UI.Threepenny.SVG.Attributes

   No documentation available.

3. iDefault :: Int -> Maybe Value

   tidal	Sound.Tidal.Boot

   No documentation available.

4. iDefault :: Int -> Maybe Value

   tidal	Sound.Tidal.Stream.Target

   No documentation available.

5. idct1 :: Transform Double Double

   vector-fftw	Numeric.FFT.Vector.Invertible

   A type-1 discrete cosine transform which is the inverse of dct1.

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

6. idct2 :: Transform Double Double

   vector-fftw	Numeric.FFT.Vector.Invertible

   A type-3 discrete cosine transform which is the inverse of dct2.

   y_k = (1/(2n)) [x_0 + 2 sum_(j=1)^(n-1) x_j cos(pi j(k+1/2)/n)]
   

7. idct3 :: Transform Double Double

   vector-fftw	Numeric.FFT.Vector.Invertible

   A type-2 discrete cosine transform which is the inverse of dct3.

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

8. idct4 :: Transform Double Double

   vector-fftw	Numeric.FFT.Vector.Invertible

   A type-4 discrete cosine transform which is the inverse of dct4.

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

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

   vector-fftw	Numeric.FFT.Vector.Invertible

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

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

10. idst1 :: Transform Double Double

    vector-fftw	Numeric.FFT.Vector.Invertible

    A type-1 discrete sine transform which is the inverse of dst1.

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

Page 328 of many | Previous | Next