Summary

The boyer-moore vocabulary implements a Boyer-Moore string search algorithm with the so-called 'strong good suffix shift rule'. Since the algorithm is alphabet-independent, it is applicable to searching in any collection that implements the Sequence protocol.

Complexity

Let n and m be the lengths of the sequences being searched in and for respectively. Then searching runs in O(n) time worst-case, using additional O(m) space. The preprocessing phase runs in O(m) time.

The boyer-moore vocabulary implements a Boyer-Moore string search algorithm with the so-called 'strong good suffix shift rule'. Since the algorithm is alphabet-independent, it is applicable to searching in any collection that implements the Sequence protocol.

Complexity

Let n and m be the lengths of the sequences being searched in and for respectively. Then searching runs in O(n) time worst-case, using additional O(m) space. The preprocessing phase runs in O(m) time.

This documentation was generated offline from a
`load-all`

image. If you want, you can also
browse the documentation from within the UI developer tools. See
the Factor website
for more information.

Factor 0.100 x86.64 (2281, heads/master-6f60e824d3, Aug 11 2024 15:51:46)