[Haskell-cafe] Boxed Mutable Arrays
moonpatio at gmail.com
Tue Dec 15 21:35:54 EST 2009
What are peoples' thoughts on this?
On 12/14/09, Brad Larsen <brad.larsen at gmail.com> wrote:
> Is anyone working on fixing ticket #650
> <http://hackage.haskell.org/trac/ghc/ticket/650>? In short, STArray
> and the garbage collector don't play well together, resulting in array
> updates being non-constant time operations. This bug makes it very
> difficult/impossible to write efficient array algorithms that depend
> upon mutation in Haskell.
> On another note, does this (or perhaps better phrased, will this) bug
> also affect Data Parallel Haskell?
> I would really like to see highly efficient, mutable, boxed arrays in
> Haskell! Unfortunately, I don't have the know-how to fix Ticket 650.
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
More information about the Haskell-Cafe