On 10/15/12 8:46 PM, H. S. Teoh wrote:
Thanks to an idea by Andrei, I now have an implementation of the
Cartesian product of two infinite ranges that requires only forward
ranges.
However, I'm running into an array-out-of-bounds problem with
std.algorithm.joiner, and I don't know how to reduce the code to track
down the problem. Here's the code:
[snip]
I'm traveling with little time to spare, but one visible thing is that
the limit of the iteration (25) spills into the result. May be easiest
to track things starting from that observation.
Andrei
