Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re^4: recursive anonymous subroutines

by runrig (Abbot)
on Apr 11, 2006 at 23:26 UTC ( #542703=note: print w/ replies, xml ) Need Help??


in reply to Re^3: recursive anonymous subroutines
in thread recursive anonymous subroutines

Just thought I'd point out that this is an interesting reinvention of a previous post (though with one less level into the call stack due to the goto). Compare:

# Your's: sub make_call { goto $_[0] } # Anonymonk's(slightly rearranged): sub Y { $_[0]->(@_) }
Update: Well, it's more the same if you change your call to:
make_call (sub { my $factor = $_[1]; return $factor > 1 ? $_[0]->($_[0], $factor-1) * $factor : 1; }, $_);


Comment on Re^4: recursive anonymous subroutines
Select or Download Code
Re^5: recursive anonymous subroutines
by snoopy (Deacon) on Apr 18, 2006 at 00:58 UTC

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://542703]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (6)
As of 2014-11-23 10:19 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My preferred Perl binaries come from:














    Results (130 votes), past polls