[Haskell-cafe] Optimizing hash array mapped tries

[Brandon S. Allbery KF8NH]

On Feb 22, 2010, at 02:15 , Edward Z. Yang wrote:
> * i-Full-update essentially copies a 32-size vector, with a change to
>  one element.  I think I am getting brutally punished for this, in
>  terms of both memory usage as well as runtime.  What I'm curious is
>  whether or not this is intrinsic to the algorithm, or if it's
>  something special that GHC is doing.

IIRC this is intrinsic to the way GHC modifies and garbage-collects  
array modifications.  There's been discussion on -cafe about it.

-- 
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allbery at kf8nh.com
system administrator [openafs,heimdal,too many hats] allbery at ece.cmu.edu
electrical and computer engineering, carnegie mellon university    KF8NH


-------------- next part --------------
A non-text attachment was scrubbed...
Name: PGP.sig
Type: application/pgp-signature
Size: 195 bytes
Desc: This is a digitally signed message part
Url : http://www.haskell.org/pipermail/haskell-cafe/attachments/20100223/61a362e8/PGP.bin