BoyerMoore Class |
The BoyerMoore class finds the first occurrence of a pattern string in a text string.
This implementation uses the Boyer-Moore algorithm (with the bad-character rule, but not the strong good suffix rule).
Namespace: Algs4Net
public class BoyerMoore
The BoyerMoore type exposes the following members.
Name | Description | |
---|---|---|
![]() | BoyerMoore(String) | Preprocesses the pattern string. |
![]() | BoyerMoore(Char, Int32) | Preprocesses the pattern string. |
Name | Description | |
---|---|---|
![]() ![]() | MainTest |
Takes a pattern string and an input string as command-line arguments;
searches for the pattern string in the text string; and prints
the first occurrence of the pattern string in the text string. |
![]() | Search(Char) |
Returns the index of the first occurrrence of the pattern string
in the text string. |
![]() | Search(String) |
Returns the index of the first occurrrence of the pattern string
in the text string. |
For additional documentation, see Section 5.3 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.
This class is a C# port from the original Java class BoyerMoore implementation by the respective authors.