úÎQ®NÛ,      !"#$% & ' ( ) * + NoneUse the ''minimal standard''2 Lehmer generator to quickly generate some random 6 numbers with reasonable statistical properties. By ''reasonable'' we mean good N enough for games and test data, but not cryptography or anything where the . quality of the randomness really matters. GBy nature of the algorithm, the maximum value in the output is clipped  to (valMin + 2^31 - 1) From ''4Random Number Generators: Good ones are hard to find'' ( Stephen K. Park and Keith W. Miller. > Communications of the ACM, Oct 1988, Volume 31, Number 10. FGenerate some randomish doubles with terrible statistical properties. < This just takes randomish ints then scales them, so there')s not much randomness in low-order bits. FGenerate some randomish doubles with terrible statistical properties. ; This just takes randmish ints then scales them, so there')s not much randomness in low-order bits. Shape of array Minumum value in output. Maximum value in output. Random seed. Array of randomish numbers. Length of vector. Minumum value in output. Maximum value in output. Random seed. Vector of randomish numbers. Shape of array Minumum value in output. Maximum value in output. Random seed. Array of randomish numbers. Length of vector Minimum value in output Maximum value in output  Random seed. Vector of randomish doubles. NoneJCompute the root mean square of an RGB color. Result is in the range [0..1]. JCompute the root mean square of an RGB color. Result is in the range [0..1]. FConvert an RGB color to its luminance value. Result in the range [0..1]. FConvert an RGB color to its luminance value. Result in the range [0..1]. "Promote a value in the range [0..1] to a grey RGB8 color. "Promote a value in the range [0..1] to a grey RGB8 color. 6Promote a tuple of color components to a RGB8 color. = Each of the source components should be in the range [0..1]. 6Promote a tuple of color components to a RGB8 color. = Each of the source components should be in the range [0..1].     None 'Take the row number of a rank-2 index. *Take the column number of a rank-2 index. %Matrix matrix multiply, in parallel. &Matrix matrix multiply, sequentially. $Transpose a 2D matrix, in parallel. %Transpose a 2D matrix, sequentially.     None:A function that gets out of range elements from an image. Image-kernel convolution, C which takes a function specifying what value to return when the  kernel doesn' t apply. 7Use the provided value for every out-of-range element. -If the requested element is out of range use ( the closest one from the real image. Image-kernel convolution, R which takes a function specifying what value to use for out-of-range elements. The original get function. The shape of the image. (Index of element we were trying to get. &Function to get border elements when  the stencil does not apply. #Stencil to use in the convolution.  Input image. %How to handle out-of-range elements. #Stencil to use in the convolution.  Input image. None-Standard Hot to Cold hypsometric color ramp. 3 Color sequence is red, yellow, green, cyan, blue. Minimum value of range. Maximum value of range.  Data value. NoneComplex doubles. (Take the magnitude of a complex number. FTake the argument (phase) of a complex number, in the range [-pi .. pi]. ,-,-None4Calculate roots of unity for the forward transform. 4Calculate roots of unity for the inverse transform. &Length of lowest dimension of result. &Length of lowest dimension of result. None! Check if an . is a power of two. "KCompute the DFT of a 3d array. Array dimensions must be powers of two else /. #ICompute the DFT of a matrix. Array dimensions must be powers of two else /. $ICompute the DFT of a vector. Array dimensions must be powers of two else /.  0!"12#3$456 !"#$ !"#$  0!"12#3$456 None%+Apply the centering transform to a vector. &+Apply the centering transform to a matrix. '-Apply the centering transform to a 3d array. %&'%&'%&'%&' None(;Compute the DFT along the low order dimension of an array. )CCompute the inverse DFT along the low order dimension of an array. *<Generic function for computation of forward or inverse DFT. R This function is also useful if you transform many arrays with the same extent,  and don',t want to recompute the roots for each one. H The extent of the given roots must match that of the input array, else /. +#Compute a single value of the DFT. H The extent of the given roots must match that of the input array, else /. ()*Roots of unity.  Input array. +Roots of unity.  Input array. Index of the value we want. ()*+()*+()*+7    !"#$%&'()*+,-./ 0 1 2 3 4 5 6789:;<=>?@ABCDEFrepa-algorithms-3.2.3.1$Data.Array.Repa.Algorithms.Randomish Data.Array.Repa.Algorithms.Pixel!Data.Array.Repa.Algorithms.Matrix#Data.Array.Repa.Algorithms.Convolve$Data.Array.Repa.Algorithms.ColorRamp"Data.Array.Repa.Algorithms.Complex$Data.Array.Repa.Algorithms.DFT.RootsData.Array.Repa.Algorithms.FFT%Data.Array.Repa.Algorithms.DFT.CenterData.Array.Repa.Algorithms.DFTrandomishIntArrayrandomishIntVectorrandomishDoubleArrayrandomishDoubleVectorfloatRmsOfRGB8doubleRmsOfRGB8floatLuminanceOfRGB8doubleLuminanceOfRGB8rgb8OfGreyFloatrgb8OfGreyDouble rgb8OfFloat rgb8OfDoublerowcolmmultPmmultS transpose2P transpose2SGetOut convolvePoutAsoutClamp convolveOutPrampColorHotToColdComplexmagargcalcRootsOfUnityPcalcInverseRootsOfUnityPModeInverseReverseForward isPowerOfTwofft3dPfft2dPfft1dPcenter1dcenter2dcenter3ddftPidftP dftWithRootsPdftWithRootsSingleS$fFractional(,)$fNum(,)ghc-prim GHC.TypesIntbaseGHC.Errerror signOfMode fftTrans3drotate3d fftTrans2d fftTrans1dffttwiddle