Hello Donald,
Sunday, August 6, 2006, 7:03:45 AM, you wrote:
the best way to optimize Haskell program (with current technologies)
is to rewrite it in strict imperative manner:
Strict, very often, since we get unboxed types out of ghc. Imperative,
not always (and will be less so with
On 06/08/06, Bulat Ziganshin [EMAIL PROTECTED] wrote:
more used than average lib. btw, is it possible to rewrite this
algorithm in more high-level way using FPS, of course with more or
less good speed?
Using Data.ByteString, I see no noticeable decrease in performance.
data C = R|G|B deriving
Hello Chris,
Saturday, August 5, 2006, 3:47:19 AM, you wrote:
in Haskell before blitting the data (whilst also retaining some
semblance of functional programming...)
the best way to optimize Haskell program (with current technologies)
is to rewrite it in strict imperative manner:
