Boyer-Moore search algorithms.
Boyer-Moore algorithms for searching a text for a single substring.
These modules use a reverse (right->left), pattern scan with two predefined shift functions resulting in an average sub-linear performance: O(text-length/pattern-length).
Tuned Boyer-Moore search algorithm.
Tuned Boyer-Moore (BM) algorithm for fast string searching.
These modules implement a compact, portable and fast BM algorithm, ie. an unrolled variant of search forward for rightmost char in the pattern.