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. _______________________________________________ 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
