How do you implement a recursive walker of a tree with a lazy range?
Dicebot
public at dicebot.lv
Wed Oct 30 11:08:54 PDT 2013
On Wednesday, 30 October 2013 at 17:31:10 UTC, Philippe Sigaud
wrote:
> On Wed, Oct 30, 2013 at 1:55 PM, bearophile
> <bearophileHUGS at lycos.com>wrote:
>
>
>
>> alias VisitRange(T) = InputRange!(const Tree!T);
>>
>>
>
> Does that syntax come with DMD 2.064? The (T) part, I mean.
Yes. http://dlang.org/changelog#eponymous_template
More information about the Digitalmars-d-learn
mailing list