Re: ADT Lib (4.2)

[Tim Teulings <tim@edge.ping.de>]

Hallo!

> A Reader is not a Writer.  A Writer is not a Reader.  One can't be
> implemented as an extension of the other.

Ok, I see this similar.

> Your description is a little bit one sided.  You miss one advantage of
> this approach: The user can select the iterator, and with it the
> enumeration order.  

Thanks. That is another improvement.

> But you also miss a severe disadvantage: The hidden cost.  A tree
> iterator is an expensive thing.  You might even manage to have a run
> time cost that exceeds O(n).  Having a single, but stupid and costly,
> implementation of this function, is no benefit.

This is a principle problem of genericy. The user can use a more direct
interface (e.g. left, right, top attributes of a tree node) if he wants
more speed. However he must always judge between speed and genericy but
he should have the choise to do so.

> What I do see is a lot of prose.  You have presented a lot of text on
> this topic.  But nothing has been forthcoming that can be turned into
> a part of the (slowly) evolving set of modules.  Until you present
> something "hard" (instead of "soft" prose), I fear we will never get
> past the stage of a spirited discussion.  Have a nice holiday.


I was aware of this. Since my time before holiday is limited and
becase I do not have documentation of the STL at hand (and I want to
take alook at it before I do a more specific proposal) I will dalay
this to the end of my holiday.

-- 
Gru...
       Tim.