Re: DData

----- Original Message -----

I assume that you also removed the strictness on the branches (instead of just the key), .... If this is the case, analysis becomes more complicated. The application could speed up now when you don't use certain paths in the tree (as these are not evaluated). However, I think that it may also lead to a space leak: if someone inserts the same element a thousand times, there will be thunk of a thousand insertions.

No, the balancing algorithm does force the evaluation of all paths. We cannot have balanced lazy data structures (exept for lazyness in the elements). This page contains a longer explanation (search for "lazy"): http://www.stud.tu-ilmenau.de/~robertw/dessy/fun/principles.html Robert