Dear Friends,
In addition to recently starting a developer's directory over on unicon.org to
which you are cordially invited, I have been mulling over a problem that some
of you might be able to help with.
The find() function uses a wonderful but naive string search algorithm no
bigger than half-a-screen of C code.
How's about someone code up an alternative find() using Boyer-Moore (C code is
available at
https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm), and
then see how it compares? I would say to use loadfunc(), but find() is a
generator and many of our benchmarks for testing it might end up using its
generator-ness, so it might be good to do it directly in fstranl.r under an
#ifdef. But if you instead do it to find the first match using loadfunc() that
would still be a useful example.
In any case, it seems like we ought to be able to see fairly easily if we have
a cheap speedup available. What are your thoughts?
Cheers,
Clint
Boyer–Moore string search algorithm -
Wikipedia<https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm>
en.wikipedia.org
In computer science, the Boyer–Moore string search algorithm is an efficient
string searching algorithm that is the standard benchmark for practical string
search ...
------------------------------------------------------------------------------
Check out the vibrant tech community on one of the world's most
engaging tech sites, SlashDot.org! http://sdm.link/slashdot
_______________________________________________
Unicon-group mailing list
Unicon-group@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/unicon-group
