Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses

Re: Re (tilly) 1: (Golf) Strings-to-Array

by jorg (Friar)
on Mar 30, 2001 at 15:46 UTC ( #68337=note: print w/replies, xml ) Need Help??

in reply to Re (tilly) 1: (Golf) Strings-to-Array
in thread (Golf) Strings-to-Array

tilly would you care to explain it as well at the risk of me producing this type of code on my next project?


"Do or do not, there is no try" -- Yoda
  • Comment on Re: Re (tilly) 1: (Golf) Strings-to-Array

Replies are listed 'Best First'.
Re (tilly) 3: (Golf) Strings-to-Array
by tilly (Archbishop) on Mar 30, 2001 at 18:09 UTC
    Please don't produce this kind of code except in fun.

    But since you ask, the trick is recursion. Here it is broken out:

    sub r { my $s; $s .= chop for @_ = @_; $s . 0 ? ( &r , $s ) : () }
    and now with better variable names, fewer implicit variables, rewritten loops, that kind of thing:
    sub recursive_s2a { my $str_last; foreach my $str (@_ = @_) { $str_last .= chop($str); } if ($str_last . 0) { return (recursive_s2a(@_) , $str_last ); } else { return; } }
    And now you see that the function creates the last string in the list to produce, tests whether that was the empty string, if it was it returns nothing, if it wasn't it then proceeds by recursion to generate the first strings, and adds the string it produced to that list.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://68337]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (2)
As of 2017-11-23 02:26 GMT
Find Nodes?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:

    Results (328 votes). Check out past polls.