Good stuff!
Only one question for you: for your app, do you distribute the target texts, or are they supplied by the user, and are they reused?
What I'm getting at- the one last optimization tweak you could make would be to "combine" the generated array and write it out as an index for the text. Then the next time running the application, you could just load the index instead of re-generating it.
Of course, it looks like it's pretty speedy as-is, although you have a pretty hefty machine running it =).
- Brian
It made sense to start using real data: a 120,000-word target file, and a list of 915 search strings. Those are now available with the updated projects here: http://www.yav.com/speed.html Another new feature is that I divided the task into 3 segments (Load Data, Check Matches, Display Data). The latest results follow. Revolution is currently running this particular task THREE TIMES FASTER than RealBasic, and more than TWELVE TIMES FASTER than SuperCard.
Chris Yavelow
Revolution (2.2) -- Total = 1,118 ms Load data = 19 ms Check Matches = 821 ms Display All = 278 ms
RealBasic (5.5.1) -- Total = 3,189 ms Load data = 608 ms Check Matches = 833 ms Display All = 1748 ms
SuperCard (4.1.2) -- Total = 13,472 ms Load data = 0 ms Check Matches = 11952 ms Display All = 1520 ms _______________________________________________ use-revolution mailing list [EMAIL PROTECTED] http://lists.runrev.com/mailman/listinfo/use-revolution
_______________________________________________ use-revolution mailing list [EMAIL PROTECTED] http://lists.runrev.com/mailman/listinfo/use-revolution
