[Haskell-cafe] Large data structures

Alex Queiroz asandroq at gmail.com
Tue Dec 12 07:21:54 EST 2006


On 12/11/06, Matthew Brecknell <haskell at brecknell.org> 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.


More information about the Haskell-Cafe mailing list