How do you implement a recursive walker of a tree with a lazy range?

Andrej Mitrovic andrej.mitrovich at gmail.com
Wed Oct 30 07:58:08 PDT 2013


On 10/30/13, Chris Cain <clcain at uncg.edu> wrote:
> I'm not confident that this is the most efficient way, but it
> works.

It allocates, I'm looking for a lazy range. I would be surprised that
such a common task as iterating a tree is not possible without using
classes and workarounds.


More information about the Digitalmars-d-learn mailing list