On Tue, Feb 17, 2015 at 10:50 PM, Anthony Walter <sys...@gmail.com> wrote:
> But if anyone wants to test my StrFindBuffer and StrFindBufferI to gauge > their performance against similar RTL library routines, I believe you'll > find they are significantly faster. As a consequence all other dependent > functions (IndexOf, Match, Replace, Split, and more) would > be significantly faster as well. > > Here are copies of the relevant code: > http://www.getlazarus.org/helpers/string/ > I see, you've implemented Boyer–Moore–Horspool algorithm for the string search. Why don't you take part in patch-fest then? http://bugs.freepascal.org/view.php?id=26864
_______________________________________________ fpc-pascal maillist - fpc-pascal@lists.freepascal.org http://lists.freepascal.org/cgi-bin/mailman/listinfo/fpc-pascal
