#include <subsearch.hpp>
Implements "Knuth-Morris-Pratt" algorithm for searching a sub-string within a string.
While the well known "Boyer-Moore-Algorithm" is even faster in the average case, for uni-code characters its implementation would be efficient only with very long haystack strings.
For convenience, the following alias type names are available:
| TChar | The character type of the haystack and needle strings. |
| TSensitivity | The letter case sensitivity of the search.. |
Definition at line 33 of file subsearch.hpp.
Public Methods | |
| TSubstringSearch (const TString< TChar > &pNeedle=nullptr) | |
| ALIB_API | ~TSubstringSearch () |
| ALIB_API void | Compile (const TString< TChar > &needle) |
| ALIB_API integer | Search (const TString< TChar > &haystack, integer startIdx=0) |
Protected Fields | |
| integer * | kmpTable = nullptr |
| integer | kmpTableLength = 0 |
| TAString< TChar > | needle |
|
inline |
Constructor. Passes the optional parameters to method Compile.
| pNeedle | The string to search. Defaults to NullString() to allow parameterless construction with later invocation of Compile. |
Definition at line 53 of file subsearch.hpp.
| template ALIB_API ~TSubstringSearch | ( | ) |
Resets this object to use the given string as the needle to search.
| needle | The needle to search. |
Definition at line 27 of file subsearch.cpp.
Searches for the needle in haystack starting at startIdx.
| haystack | The string to search in. |
| startIdx | The start of the search. Defaults to 0. |
-1 if not found. Definition at line 61 of file subsearch.cpp.
|
protected |
The Knuth-Morris-Pratt prefix length table.
Definition at line 40 of file subsearch.hpp.
|
protected |
Length of kmpTable.
Definition at line 43 of file subsearch.hpp.
|
protected |
The needle set Knuth-Morris-Pratt prefix length table.
Definition at line 37 of file subsearch.hpp.