BUU has asked for the wisdom of the Perl Monks concerning the following question:
I've recently come upon a mildly interesting problem without much immediate relevance, so I've been considering it but I haven't gotten around to solving it. The situation is fairly simple, I have a list of around 40 to 100+ objects. Each object contains a 'regexp' value and a 'code' value. The idea is to execute each 'code' value that has its corresponding regexp match. Now, the obvious and simple way I've been using looks like this:
But this strikes me as slightly inefficient in a number of ways. Surely the regexp engine could optimize this if only it knew about all the matches I was intending to perform. There are a number of modules on CPAN that advertising combining lots of regexp to do a simple boolean check, but I couldn't see an easy way to then match this back to the appropiate 'code' value that's also in the datastructure. Also, each regexp might have one or more capturing fields I need to keep track of and pass to the code ref. Any thoughts?my $string; for( @regexes ) { if( @matches = $string =~ $_->{regexp} ) { $_->{code}->($string, @matches); } }
|
---|
Replies are listed 'Best First'. | |
---|---|
Re: Optimizing many many regex matches
by grinder (Bishop) on Oct 22, 2006 at 20:16 UTC | |
Re: Optimizing many many regex matches
by xdg (Monsignor) on Oct 22, 2006 at 22:25 UTC |
Back to
Seekers of Perl Wisdom