> Do you have any performance test results for this?
I describe the worst case in first message (search 'aaa..aab' in
'aa..aa', "complete" N^2). It works some msec instead of several sec
(in current version).
Patch intends for artificial language (for example DNA, or
language with small alphabet, or regular language) only.
In natural language, KMP(and other search algo) haven't notable
advantages (+-5% time execution).
----
Ajtkulov Pavel
ajtkulov@acm.org
