Hal Daume III <[EMAIL PROTECTED]> wrote,

> clearly IOMutArray is the best, even outperforming the
> UnboxedArray.  Unfortunately, writing code in the IOMutArray format is
> much uglier than writing it in the UnboxedArray or NormalArray formats,
> even though I know that I'm never going to refer to an old version of the
> array, so inplace updates are a-okay.
> 
> So my question is: how can I get better performance without wrapping
> everything in the IO (or some other) monad?

<Shameless Plug>
  This question is the motivation for our work on optimising
  array codes: <http://www.cse.unsw.edu.au/~chak/papers/CK01.html>
  Unfortunately, I can't point you to a web site where you
  can download everything ready to run, but the plan is to
  have some library code for more general consumption ready
  in the next couple of weeks.
</Shameless Plug>

Cheers,
Manuel
_______________________________________________
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users

Reply via email to