[Haskell-cafe] Substring replacements
bulatz at HotPOP.com
Wed Dec 21 10:18:40 EST 2005
Wednesday, December 21, 2005, 5:20:18 PM, you wrote:
>> >BM> I've finally performed test on amd64 and result is a same as on intel.
>> >BM> KMP always wins. So KMP is best suited for non indexed strings
>> >BM> and I guess should be used in library as prefered search/replace
>> >BM> This test favors straightforward search.
>> >i'm 90% sure that straightforward method must be faster for one-time
DF> I'm far less sure of that. If you have a really short search-pattern, I think
DF> that probably straightforward search is indeed faster
sorry, i mean exactly that, answering proposition to add this to
library as a PREFFERED method. imho, typical usage of these routines
is for short enough patterns and searched strings
Bulat mailto:bulatz at HotPOP.com
More information about the Haskell-Cafe