On Sep 11, 2007, at 12:27 PM, Mikey wrote:
I don't know how long it will take to do this using RR's built-in
search function, but the most efficient algorithm in general is the
Boyer-Moore-Sunday algorithm for doing general text processing. The
problem you are going to have is that BMS assumes that it is searching
normal text space. However, you can use the concepts of BMS to write
a very fast search algorithm.
If you need help, please let me know.
I Googled to bone up on BMS and found the following site:
http://www-igm.univ-mlv.fr/~lecroq/string/
which has terrific step-by-steps and code snippets for us algorithm
fans.
t
--
Tereza Snyder
Califex Software, Inc.
_______________________________________________
use-revolution mailing list
use-revolution@lists.runrev.com
Please visit this url to subscribe, unsubscribe and manage your subscription
preferences:
http://lists.runrev.com/mailman/listinfo/use-revolution
