[Haskell-cafe] strange stack overflow with Data.Map

Tomasz Zielonka tomasz.zielonka at gmail.com
Mon Jan 2 14:42:33 EST 2006

On Mon, Jan 02, 2006 at 05:28:39PM +0000, Adrian Hey wrote:
> BTW, I think I would prefer the default behaviour of insert
> to be to retain existing elements because this allows the
> optimisation of not updating the data structure representing
> the set at all (which should help keep heap burn rate down).

I hope you don't propose this for Map. It would break some nice uses,
like representing variable scopes in an interpreter. The "replacing"
insert allows you to easily implement hiding variables in outer

Best regards

I am searching for a programmer who is good at least in some of
[Haskell, ML, C++, Linux, FreeBSD, math] for work in Warsaw, Poland

More information about the Libraries mailing list