In article <[EMAIL PROTECTED]>,
Stefan `Sec` Zehl <[EMAIL PROTECTED]> writes:
> On Sat, Apr 13, 2002 at 11:45:33AM +0000, Ton Hospel wrote:
>> Ok, this one is now finished too.
>> There is no post-mortem link yet, but you can find it at
>> http://la.pm.org/cgi-bin/PGAS/post_mortem.cgi?id=1
>
> Can someone explain to me why the winning solution of
>
> -li0 $,=pop;sub p{map&p,1..$,--;++$,||++$^I}p;print$^I
>
> hasn't been shortened to:
>
> -l $,=pop;sub p{map&p,1..$,--;++$,||++$p}p;print$p
>
> To me that seems about equivalent?
>
the accumulator must be a string so you get magic ++
If you let it go from undef, it's a numeric ++
