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

["manu at gcc dot gnu.org" <gcc-bugzilla at gcc dot gnu dot org>]

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

Manuel LÃpez-IbÃÃez <manu at gcc dot gnu.org> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
                 CC|                            |manu at gcc dot gnu.org

--- Comment #3 from Manuel LÃpez-IbÃÃez <manu at gcc dot gnu.org> ---
(In reply to Jim Michaels from comment #0)
> optimization of string searches using Nigel Horspool's Boyer-Moore-Horpool
> algorithm is what I would like to see. right now it's just a plain old, slow
> O(n) loop. in just about any OS, at least half of the funcrtions are string
> functions.

Thanks for the advice. But the best chances of seeing this ever implemented is
to take the challenge yourself. Join the mailing lists, submit patches and
benchmark results and prove your point. See https://gcc.gnu.org/contribute.html

> the C library should be modified as well, so should the same in objc and
> objc++ and whatever compiler in GNU compiler set you can put it in.

The C library is a separate project. http://www.gnu.org/software/libc/libc.html

Perhaps it would be easier to start contributing there. But the same thing
applies: Ideas abound, what is needed is people willing and able to put them in
practice.

> this could apply to <algorithm>'s std::find(), std::string.find()
> and you would not need to change the function signature.

Again, this will probably only ever happen if you implement it and show with
numbers that you are right.