14 Jan
2014
14 Jan
'14
4:49 a.m.
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 done recursively. But, that will give a single-pass iterator. For that you can just implement the recursive
On 1/6/2014 1:11 PM, Nat Goodspeed wrote: 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 already.