sub zipn {
local $[ = 0;
[
map {
my $index = $_;
map {
defined($_[$_][$index]) ?
$_[$_][$index]:
''
} 0..$#_
} 0.. maximum(map { $#{$_[$_]} } 0..$#_)
]
}
sub maximum {
local $[ = 0;
($#_ == 1) ?
(
($_[0] >= $_[1]) ?
$_[0]:
$_[1]
):
maximum(maximum($_[0], $_[1]), @_[2..$#_]);
}
Call it like so:
zipn([1,2,3], [4,5,6], [7,8,9,10])
and it'll return this:
[1,4,7,2,5,8,3,6,9,'','',10]
What fun! Note that if any of the arrays are too short, it fills in the blanks with the empty string, cos that's what I needed at the time. Changing it to emit undefs would be trivial. And yes, the maximum function is hideously inefficient, but I enjoy recursion.
local $[ = 0; (Score:2)
Re:local $[ = 0; (Score:1)
I fail to see anything in that snippet from the man page which suggests that it is either unnecessary or an error.
Re:local $[ = 0; (Score:2)
Re:local $[ = 0; (Score:2)
print $[;
if (0) { local $[ = 1; }
print $[;
if (0) { $[ = 1; }
print $[;
Docs clarified (Score:2)
Re:Docs clarified (Score:1)
max() (Score:1)
Re:max() (Score:1)