Inspired by the approach in Two handy tools for nested arrays: mapat and transpose and vague residual memories from HOP, I'd set up a list of iterators, one for each source (said iterator returns '' when exhausted to handle "short" source rows); then just pull off the head from each to get your next new transposed row. That should be able to scale well (if your iterators are sufficiently lazy).
The cake is a lie.
The cake is a lie.
The cake is a lie.
In reply to Re: rearranging an array of arrays
by Fletch
in thread rearranging an array of arrays
by punkish
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |