|author||Thomas Graf <email@example.com>||2005-06-23 20:58:37 -0700|
|committer||David S. Miller <firstname.lastname@example.org>||2005-06-23 20:58:37 -0700|
[LIB]: Knuth-Morris-Pratt textsearch algorithm
Implements a linear-time string-matching algorithm due to Knuth, Morris, and Pratt . Their algorithm avoids the explicit computation of the transition function DELTA altogether. Its matching time is O(n), for n being length(text), using just an auxiliary function PI[1..m], for m being length(pattern), precomputed from the pattern in time O(m). The array PI allows the transition function DELTA to be computed efficiently "on the fly" as needed. Roughly speaking, for any state "q" = 0,1,...,m and any character "a" in SIGMA, the value PI["q"] contains the information that is independent of "a" and is needed to compute DELTA("q", "a") . Since the array PI has only m entries, whereas DELTA has O(m|SIGMA|) entries, we save a factor of |SIGMA| in the preprocessing time by computing PI rather than DELTA.  Cormen, Leiserson, Rivest, Stein Introdcution to Algorithms, 2nd Edition, MIT Press  See finite automation theory Signed-off-by: Thomas Graf <email@example.com> Signed-off-by: David S. Miller <firstname.lastname@example.org>
Diffstat (limited to 'lib/Kconfig')
1 files changed, 10 insertions, 0 deletions
diff --git a/lib/Kconfig b/lib/Kconfig
index 5bc2d523e6d1..16b8fa2175e4 100644
@@ -70,4 +70,14 @@ config TEXTSEARCH
Say Y here if you want to provide a textsearch infrastructure
to other subsystems.
+ depends on TEXTSEARCH
+ tristate "Knuth-Morris-Pratt"
+ Say Y here if you want to be able to search text using the
+ Knuth-Morris-Pratt textsearch algorithm.
+ To compile this code as a module, choose M here: the
+ module will be called ts_kmp.