note
chromatic
Looks like I'm wrong about being able to bless a s{}{} statement. That would be truly convenient. I'll change that in the tutorial.
<p>
In your benchmarking, lots of the time *is* taken up by the function call. Here's what I ran to prove that. (This has to be done in the Cleaner package, for obvious reasons.):
<code>timethese(1000000, {
'blessed' => sub { my $bar = $foo; $c->clean($foo); },
'normal' => sub { my $bar = $foo; $bar =~ s/^\s+|\s$//g; },
'super' => sub { my $bar = $foo; $bar =~ s/$c//g; },
});</code>
There's not nearly the performance penalty involved:
<code>Benchmark: timing 1000000 iterations of blessed, normal, super...
blessed: 10 wallclock secs ( 9.83 usr + 0.00 sys = 9.83 CPU)
normal: 4 wallclock secs ( 5.42 usr + 0.00 sys = 5.42 CPU)
super: 7 wallclock secs ( 6.71 usr + 0.00 sys = 6.71 CPU)</code>
I suspect that if the regex were more complicated (and $foo were much longer), the difference wouldn't be quite as intense.
8259
8314