Boyer-Moore Search

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).
______________________

MAKEFILE
BM.H
BM.C
BM.TST
______________________

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.

______________________

MAKEFILE
TBM.H
TBM.C
______________________

Aho-Corasic Search

Aho-Corasic search algorithm.

Aho-Corasic algorithm for searching a text for several fixed substrings. These modules implement a simple “Finite State Automaton” (FSA) to locate all occurences of any of a number of keywords in a string of text.
______________________

MAKEFILE
AC.H
AC.C
______________________