Are you aware that Perl has the Boyer-Moore algorithm built-in to both index and regex searching? As it is implemented in C, it will run much faster than any similar algorithm (Horspool is a simplification of Boyer-Moore) implemented in Perl.
You might consider reading about study in docs and using it in conjunction with your Perl pattern matching code and see if it improves the performance any.
In reply to Re: Guidance needed in perl program for fast pattern matching algorithm.
by BrowserUk
in thread Guidance needed in perl program for fast pattern matching algorithm.
by tweety
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |