On 11/29/06 5:07 PM, "J. Landman Gay" <[EMAIL PROTECTED]> wrote:
> if "dinosaur" is in tText and "dog" is in tText and "cat" is in tText > > and that would require 3 times the number of lookups over a single > matchtext. Plus, it would match paragraphs with "catastrophe", "doggedly", "muscat", etc., which you may also not want. > Also, the number of words can vary so I'd have to construct a > repeat loop to build the command itself, and use a "do" statement to > execute it -- and both of those are slow. But if I'm wrong, I'd like to > know. Has anyone done any speed tests on this stuff? > > Basically I need the fastest possible way to scan a large number of text > blocks for an indefinite number of words which occur in any portion of > the text. > > I'll try Ken's thing too -- thanks Ken. :-) Ken Ray Sons of Thunder Software, Inc. Web site: http://www.sonsothunder.com/ Email: [EMAIL PROTECTED] _______________________________________________ use-revolution mailing list [email protected] Please visit this url to subscribe, unsubscribe and manage your subscription preferences: http://lists.runrev.com/mailman/listinfo/use-revolution
