Re: [Haskell-cafe] Large data structures

Hallo, On 12/11/06, Matthew Brecknell wrote:

Yes. Take a look at Data.Map. This data structure provides various operations which create a new map from an old one in O(log n) time, by splicing bits of the old map into the new one. Importantly, performing any of these operations does not destroy the old map if your code still references it. On the other hand, if your code drops references to the old map, then the garbage collector can reclaim any branches of the old map not used in the new one. You may also be interested in this paper:

http://www.cs.cmu.edu/~rwh/theses/okasaki.pdf

Thanks for the info and the link, looks interesting. Cheers, -- -alex http://www.ventonegro.org/