DData

[Daan Leijen]

On Mon, 17 May 2004 16:36:27 +0200, Robert Will <robert.will at stud.tu-ilmenau.de> wrote:

> ----- 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.

Hmm, I think you are right. As "balance" will force structure on the entire
tree it seems that removing the strictness on the branches will be safe. It still
could lead to "drag" -- but it may also speed up many applications due to
less explicit evaluation (as remarked by Simon). Let the benchmark be the judge than :-)

-- Daan.