Boyer-Moore Search Implementation
(c)2006 Jeremy Collake / Bitsum Technologies (
version 1.12
Not made ready for public use. Support not available.

// This implementation is designed to handle binary phrases, which
// can include character arrays (strings), just be sure you
// realize a null-terminator should not be included in the phrase
// or total data size.
// Use:
// 1.) Initialize the search string table by passing to
// it the phrase you're planning to search for. See
// BoyerMooreBinBin_Init.
// 2.) Search with BoyerMooreBinBin
// 3.) De-initialize search table when done searching
// for that particular phrase.

Source code:

Test application: