note
perlmonkey
This was a cool article. Dont know how useful, but very interesting.<BR>
I am sure I will find a use for it somewhere.<BR>
<BR>
I tried to play with blessing RegEx's and ran into trouble.<BR>
You mention that you might be able to bless a s{}{}, but I<BR>
couldn't figure it out.<BR>
<BR>
I wanted an object that would do "s/^\s+|\s+$/g" for me.<BR>
It would not compile if i did somethine like<BR>
$self = s{^\s+|\s+$}{}; so I ended up using qr{} instead,<BR>
putting the s/// in the member function:
<CODE>
package Cleaner;
sub new
{
my $class = shift;
$class = ref($class) || $class;
my $self = qr{^\s+|\s+$};
return bless($self, $class);
}
sub clean
{
$_[1] =~ s/$_[0]//g;
}
package main;
$c = new Cleaner;
$foo = "\t\tFOO\t\t";
$c->clean($foo);
print $foo, "\n";
</CODE>
So this works, but I dont know it is the most optimized<BR>
routine. I did some benchmarks:
<CODE>
package main;
$c = new Cleaner;
$foo = "\t\tFOO\t\t";
use Benchmark;
timethese(1000000, {
'blessed' => sub { my $bar = $foo; $c->clean($bar) },
'normal' => sub { my $bar = $foo; $bar =~ s/^\s+|\s$//g },
});
</CODE>
And got these results:
<CODE>
Benchmark: timing 1000000 iterations of blessed, normal...
blessed: 43 wallclock secs (36.50 usr + 0.14 sys = 36.64 CPU)
normal: 28 wallclock secs (24.19 usr + 0.08 sys = 24.27 CPU)
</CODE>
I guess the difference is just the function call, but thought
maybe there is a faster way. Any Ideas?
8259
8259