[email protected]
[Top] [All Lists]

Re: [Haskell-cafe] Boxed Mutable Arrays

Subject: Re: [Haskell-cafe] Boxed Mutable Arrays
From: Serguey Zefirov
Date: Wed, 16 Dec 2009 13:50:13 +0300
2009/12/16 Matt Morrow <[email protected]>:
> What are peoples' thoughts on this?
> http://hackage.haskell.org/trac/ghc/ticket/650#comment:16

I think it won't get any better.

Either we have O(log(N)) updates because we have to update
hierarchical structure to speed up GC scanning (to get it to
O(Mlog(N)), where M is a number of updated cells), or we have O(N)
scanning.

As far as I can tell, other systems (Java, for example) suffer from
that problem as well.
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe

<Prev in Thread] Current Thread [Next in Thread>