|Main Archive Page > Month Archives > snort-devel archives|
I am working on pattern matching algorithms. I want to find the occurrence of a single pattern in a given text.
I found the Boyer-Moore Algorithm implementation in (src/mstring.c) Is this code valid? Or even for single pattern search do I have to use Aho-Corasick?
Here is my question about Boyer-Moore implementation:
- search function mSearch which is in (src/mstring.c) is called from
- mSearch takes as parameter Boyer-Moore skip and shift tables
How does it work? How the parameters can be computed after the function call?