[Haskell-cafe] Boxed Mutable Arrays
sergueyz at gmail.com
Wed Dec 16 05:50:13 EST 2009
2009/12/16 Matt Morrow <moonpatio at gmail.com>:
> What are peoples' thoughts on this?
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)
As far as I can tell, other systems (Java, for example) suffer from
that problem as well.
More information about the Haskell-Cafe