Bartosz Milewski seems to like D more than C++ now :)

Andrei Alexandrescu SeeWebsiteForEmail at erdani.org
Fri Sep 20 09:35:17 PDT 2013


On 9/20/13 7:55 AM, Craig Dillabaugh wrote:
> Excuse my lack of knowledge on Ranges, so maybe what I am proposing is
> infeasible, for a binary tree for example couldn't you have a
> InOrderRange, PreOrderRange, and PostOrderRange or alternately
> DepthFirstRange, and BreadFirstRange.  From a consumers view those would
> be linear operations?

The tree object would have functions returning by value each of these 
range types.

Andrei




More information about the Digitalmars-d mailing list