Re^3: Number of times I've used goto in Perl

in reply to Re^2: Number of times I've used goto in Perl
in thread Number of times I've used goto in Perl

Hm ...

... is the goto version faster? Is this a way to have tail-recursion in Perl?

Cheers Rolf
_{(addicted to the Perl Programming Language :)

Wikisyntax for the Monastery
FootballPerl is like chess, only without the dice}

Comment on Re^3: Number of times I've used goto in Perl

Replies are listed 'Best First'.
Re^4: Number of times I've used goto in Perl by Eily (Monsignor) on Sep 26, 2018 at 15:04 UTC
I'm pretty sure there was a detailed explanation of what makes goto slower (in most cases?) than a plain `⊂` call. But while searching for it I did end up finding this post and this answer. I would be tempted to guess that the function call with goto was more expensive (because of the extra magic to clear the local scope and play with the call stack), but the return was more efficient because it didn't require going back through all the calling stack (ie, tail recursion done right). I wouldn't rely on the result of benchmarks from 2005 for current versions of perl though :P	[reply] [d/l]

Replies are listed 'Best First'.

Re^4: Number of times I've used goto in Perl
by Eily (Monsignor) on Sep 26, 2018 at 15:04 UTC

I'm pretty sure there was a detailed explanation of what makes goto slower (in most cases?) than a plain ⊂ call. But while searching for it I did end up finding this post and this answer. I would be tempted to guess that the function call with goto was more expensive (because of the extra magic to clear the local scope and play with the call stack), but the return was more efficient because it didn't require going back through all the calling stack (ie, tail recursion done right). I wouldn't rely on the result of benchmarks from 2005 for current versions of perl though :P

[reply]
[d/l]

In Section Past Polls