[Haskell-cafe] Optimizing hash array mapped tries

Edward Z. Yang ezyang at MIT.EDU
Mon Mar 1 17:58:48 EST 2010

Excerpts from Don Stewart's message of Wed Feb 24 16:13:18 -0500 2010:
> Almost all the vector library generators fill a vector destructively,
> before doing an unsafeFreeze.

Alright.  Is there a standard idiom for filling vectors pointing to vectors
destructively, and then unsafely freezing all of them (as you would find in a
recursively defined datastructure), or is this something simply not supported
by the compiler at this time?


More information about the Haskell-Cafe mailing list