Can you first explain what your intended use is?
Using the regexp engine, you get Boyer-Moore when appropriate, automatically. And if for some reason you can't use the regexp engine, I would be surprised (though I haven't benchmarked) if a pure-Perl implementation of Boyer-Moore would beat Perl's native index (Update: which internally uses Boyer-Moore).
Dave
In reply to Re: Boyer Moore algorithm
by davido
in thread Boyer Moore algorithm
by kranthikumar
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |