October 30, 2013 Re: How do you implement a recursive walker of a tree with a lazy range? | ||||
---|---|---|---|---|
| ||||
On 10/30/13, Philippe Sigaud <philippe.sigaud@gmail.com> wrote:
> Does that syntax come with DMD 2.064? The (T) part, I mean.
Yes.
Glad to see you here btw, do you have your own solution to the problem?
|
October 30, 2013 Re: How do you implement a recursive walker of a tree with a lazy range? | ||||
---|---|---|---|---|
| ||||
Attachments:
| On Wed, Oct 30, 2013 at 7:09 PM, Andrej Mitrovic <andrej.mitrovich@gmail.com > wrote: > On 10/30/13, Philippe Sigaud <philippe.sigaud@gmail.com> wrote: > > Does that syntax come with DMD 2.064? The (T) part, I mean. > > Yes. > Ah, that's cool! I've been waiting for that one for years. > > Glad to see you here btw, do you have your own solution to the problem? > As Benjamin, I used an internal stack. But that was years ago, let me see. https://github.com/PhilippeSigaud/dranges/blob/master/treerange.d#L185 or, for graphs: https://github.com/PhilippeSigaud/dranges/blob/master/graphrange.d#L25 Hmm, what I did there doesn't seem really lazy. I guess with today Phobos and DMD it's possible to have far less allocations. (that code dates from 2009-2011) |
Copyright © 1999-2021 by the D Language Foundation