Whatever code snippets you supply to benchmark, get wrapped internally into subs
That's true. That's why I usually do
$_ = "use strict; use warnings; for (1..10_000) { my \$x = '|0|0|0|0|0
+|0|'; $_ }";
to minimize the cost of that sub call.
Also, I'm not sure what the cost of use strict; and use warnings is, when they have already been loaded,
Zero. use is executed once, at compile-time. It doesn't generate any code in the tree.
>perl -MO=Concise -e"use strict; print 'a'"
6 <@> leave[1 ref] vKP/REFC ->(end)
1 <0> enter ->2
2 <;> nextstate(main 2 -e:1) v/2 ->3
5 <@> print vK ->6
3 <0> pushmark s ->4
4 <$> const[PV "a"] s ->5
-e syntax OK
| [reply] [d/l] [select] |
'purport'! You are suggesting that I'm not testing? Or is this one of those pond translation errors? Must be since I'm clearly posting results. Good point about strict and warnings They are an artifact of a 'new' file in my editor. Could you give an example of 'add a multiplier loop inside the subroutine'? While I still insist that I'm looking for better ways to pre-chop, learning about benchmarking is both fascinating and useful.
--hsm
"Never try to teach a pig to sing...it wastes your time and it annoys the pig."
| [reply] [d/l] [select] |
For an example of multiplier loops inside the subroutines, have a look at Re: Bug or WAD in lvalue substr? (again.).
If you call a sub in a loop, you are timing how long it takes to call the sub as well as the time it takes to execute the contents of the sub. Often this is not an issue since the contents of the sub take a lot longer than just calling the sub itself. If the loop is inside the sub instead, then you can focus more on the contents of the loop rather than the time it takes to call subs, which is important when you're timing something that's as fast as sub calls.
For more on benchmarking in general, have a look at the "Benchmarking Perl" chapter in Mastering Perl.
| [reply] |
If you call a sub in a loop, you are timing how long it takes to call the sub as well as the time it takes to execute the contents of the sub.
Note that Benchmark goes to some lengths to try to subtract out the time taken by the "calling the sub" part. Of course, these attempts can certainly be unsuccessful (to the point of Benchmark declaring defeat or just to the point of Benchmark producing meaningless results; though I think that interpretation is often valid even when one has worked around the issue as you described).
which is important when you're timing something that's as fast as sub calls
There is very little that I would characterize as "important" when trying to time something in Perl that is about as fast as a sub call. Well, other than the idea of "you are likely wasting your time". :)
| [reply] |
'purport'! You are suggesting that I'm not testing?
No. I should have said: "That your benchmark purports to be testing". (Where 'your' refered to ikegami). The point is that it looks like it's testing the right thing, but when you factor in the overhead of the tests, it serves to completely obscure the results.
Like others, I think this is a fairly fruitless test. If you are doing this once, then the method used will make very little difference. If you are doing it hundreds of thousands of times, then there are far more efficient ways of doing it. For example,
- if the idea is to chip off characters until you reach a particular character, then search for the character and then chop the lump off:
## Either
substr( $x, 0, index( $x, $char ), '');
## or
$x =~ s[(^/*$char)][];
- if the requirement is to remove and process the first N chars of a string, then chop off the lump then separate them:
for my $char ( unpack '(A1)*', substr $x, 0, 100, '' ) {
##
}
The only time the relative performance of these methods is likely to make a significant difference is if you were applying it once to each of a large number of strings, say a large array, much as you might with chop( @array ). And it would have to be in the order of 10e7 elements before it would have any significant effect upon an application. If it was a common requrement, then there would probably be a leading character equivalent of chop (chip()?:) built-in.
Could you give an example of 'add a multiplier loop inside the subroutine'?
This was how I constructed my variation:
use strict;
use warnings;
use Benchmark qw( cmpthese );
my %tests = (
subst => '$x =~ s/.//;',
substr_lval => 'substr($x,0,1) = "";',
substr_mod => 'substr($x,0,1,"");',
reverse => '$x = reverse $x; chop($x); $x = reverse($x);',
substr_copy => '$x = substr($x,1);',
);
our $loops ||= 1e4;
for (values %tests) {
$_ = <<EOT
my \$x = 'X' x $loops;
for( 1 .. $loops ) {
$_
}
EOT
}
cmpthese(-3, \%tests);
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.
| [reply] [d/l] [select] |
I agree that there is little to be gained in such an optimization. That said, I've made out like a bandit at the 'meta' level by posting the article itself. Not the least of which are the pieces you've posted. Much thanks. Please note that I did not start my usual rant about how optimization is always a good thing. Be grateful.
--hsm
"Never try to teach a pig to sing...it wastes your time and it annoys the pig."
| [reply] |