nx_boyer_moore.nx

nx_boyer_moore.nx -- Boyer-Moore string search (bad-character heuristic). Find the first occurrence of `pattern` in `text`, returning the starting byte index or -1. Uses the bad-character rule (a.k.a. Horspool-simplified BM): preprocess pattern into a 256-entry skip table, then scan text right-to-left within each alignment; on mismatch jump ahead by the table. genealogy_id: boyer_moore_1977_cacm lineage_id: single_pattern_exact_string_search references: Boyer & Moore "A Fast String Searching Algorithm", CACM 20(10):762-772, October 1977. license: public_domain (1977 academic publication) complexity: best O(n/m), avg O(n+m), worst O(n*m) (this BM-bad-char variant; full Galil/Apostolico-Giancarlo gives O(n+m)).