|Copyright||(c) Bryan O'Sullivan 2009|
Fast substring search for
Text, based on work by Boyer, Moore, Horspool, Sunday, and Lundh.
O(n+m) Find the offsets of all non-overlapping indices of
haystack. The offsets returned represent uncorrected indices in the low-level "needle" array, to which its offset must be added.
In (unlikely) bad cases, this algorithm's complexity degrades towards O(n*m).
© The University of Glasgow and others
Licensed under a BSD-style license (see top of the page).