Perl, array of matches for group of precompiled regexps - regex

Question

I have group of some regexps and want to match current line for each of them, if match succeeded call some function with matched groups as parameters.
my %regexps = (
"a" => qr/^(a)\s*(b)/o,
"b" => qr/^(c)\s*(d)/o,
"c" => qr/^(e)\s*(f)/o,
);
sub call_on_match {
my $actions = shift;
# ... some setup actions for $_
while (my ($regexp, $func) = each(%$actions) ) {
if (my #matches = /$regexp/){
$func->(#matches);
}
}
}
call_on_match({
$regexps{"a"} => \&some_funca,
$regexps{"b"} => \&some_funcb,
$regexps{"c"} => \&some_funcc,
})
The problem is in my #matches = /$regexp/ expression, it executes about 110k times and takes about 1 second total for compilation (Typical profiler output for this line: # spent 901ms making 107954 calls to main::CORE:regcomp, avg 8µs/call.
First guess was to remove additional regexp slashes, in case it makes perl thinks that it is new regexp and must be compiled. I used my #matches = ($_ =~ $regexp), but no success.
Is there another ways to make perl not to recompile qr'ed regexps in this context?
UPD: I replaced hash with array (like [$regexps{"a"}, \&some_funca]):
foreach my $group (#$actions){
my ($regexp, $func) = #$group;
if (my #matches = ($_ =~ $regexp)){
$func->(#matches);
}
}
Now it compiles faster but compilation doesn't disappear: # spent 51.7ms making 107954 calls to main::CORE:regcomp, avg 479ns/call

Answer 1

I suggest that you use the IDs as keys in both hashes, like this
use strict;
use warnings;
my %regexps = (
a => qr/^(a)\s*(b)/,
b => qr/^(c)\s*(d)/,
c => qr/^(e)\s*(f)/,
);
sub call_on_match {
my ($actions) = #_;
# ... some setup actions for $_
while (my ($regexp_id, $func) = each %$actions) {
if (my #matches = $_ =~ $regexps{$regexp_id}) {
$func->(#matches);
}
}
}
call_on_match(
{
a => \&some_funca,
b => \&some_funcb,
c => \&some_funcc,
}
);