[Bug libstdc++/62318] optimization of string searches using Nigel Horspool's Boyer-Moore-Horpool algorithm

[joseph at codesourcery dot com]

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=62318

--- Comment #5 from joseph at codesourcery dot com <joseph at codesourcery dot com> ---
glibc's strstr already uses an asymptotically fast (i.e. O(m+n) instead of 
O(mn)) algorithm.  See string/str-two-way.h.