Jan Kybic [EMAIL PROTECTED] wrote,
I have recently coded in Haskell a little program which evaluates
a function given as a series of matrix products. Matrices and vectors
are represented as type X. Surprisingly, compiled with 'ghc -O2'
(vers 5.02.2) the program runs faster with X=Array than
Could you try IOUArray for completeness too? (An IOUArray is the
unboxed version of IOArray, it can be found in Data.Array.IO).
It fits in as the fastest:
IOUnboxedMutArray 0.48u 0.04s 0:00.58 89.6%
NormalArray 1.65u 0.20s 0:01.89 97.8%
