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

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

[jmichae3 at yahoo dot com]

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

            Bug ID: 62317
           Summary: optimization of string searches using Nigel Horspool's
                    Boyer-Moore-Horpool algorithm
           Product: gcc
           Version: 4.9.0
            Status: UNCONFIRMED
          Severity: normal
          Priority: P3
         Component: libstdc++
          Assignee: unassigned at gcc dot gnu.org
          Reporter: jmichae3 at yahoo dot com

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.

this could be sped WAY up using this algorithm. google Nigrel Horspool and see
if you can get permission to use his algorithm.
this could apply to <algorithm>'s std::find(), std::string.find()
and you would not need to change the function signature.

there are probably other uses for this algorithm I am not thinking of right
now, but if you put your thinking cap on to see where this could fit, I am sure
you could find some choice places for it.

"1980 Practical Fast Searching in Strings" under Publications
http://webhome.cs.uvic.ca/~nigelh/

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

[schwab@linux-m68k.org]

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

Andreas Schwab <schwab@linux-m68k.org> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
             Status|UNCONFIRMED                 |RESOLVED
         Resolution|---                         |DUPLICATE

--- Comment #1 from Andreas Schwab <schwab@linux-m68k.org> ---
.

*** This bug has been marked as a duplicate of bug 62318 ***