Subject: Re: [boost] [range] flat_array_view feature request.
From: John M. Dlugosz (mpbecey7gu_at_[hidden])
Date: 2014-01-13 23:49:49
On 1/6/2014 1:11 PM, Nat Goodspeed wrote:
> You can also build a literally recursive flattening iterator with
> coroutines. ;-)
Yes, I always thought that would be a great approach to traversing a tree that is easily
But, that will give a single-pass iterator. For that you can just implement the recursive
traverse that takes a functor to perform on each element, with no need for funny business.
More specific than just "using co-routines", there's probably a Generator framework around
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk