Is boyer_moore_horspool faster then std::string::find?
The last blog post by Julien Jorge made me wonder if the string searchers could be faster here.
Is boyer_moore_horspool faster then std::string::find?
by Jens Weller
From the article:
On Wednesday I've read an interesting blog post by Julien Jorge on Effortful Performance Improvements, where it is shown how to improve an replace function which runs replacements on a string. Its part of a series on performance and improving a code base, you should go read all of them!
When reading the post, and seeing the two implementations, one short and simple and the other longer and more complicated - but faster - I wondered is there a faster way? Julien already has shown that his newer function beats his old function which uses std::string::find in performance. I've veryfied that, and then started to refactor a copy of that slower function with a different approach using the string search algorithm boyer_moore_horspool...