Edit - Stack Overflow

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Do you know a way to combine Boyer-Moore's bad shift table with Two-Way? Glibc does a variant of this for long needles (>32 byte) but only checks the last byte. The problem is that Two-Way needs to search the right portion of the needle left-to-right, whereas Boyer-Moore's bad shift is most efficient when searching from right-to-left. I tried using it with left-to-right in Two-Way (advance by shift table or normal Two-Way right half mismatch, whichever is longer) but I got a 5-10% slowdown versus normal Two-Way in most cases and couldn't find any cases where it improved performance.

R.. GitHub STOP HELPING ICE
– R.. GitHub STOP HELPING ICE

2010-07-06 05:28:03 +00:00
Commented Jul 6, 2010 at 5:28

Add a comment |

Correct minor typos or mistakes
Clarify meaning without changing it
Add related resources or links
Always respect the author’s intent
Don’t use edits to reply to the author

create code fences with backticks ` or tildes ~
```
like so
```
add language identifier to highlight code
```python
def function(foo):
print(foo)
```
put returns between paragraphs
for linebreak add 2 spaces at end
_italic_ or **bold**
indent code by 4 spaces
backtick escapes `like _so_`
quote by placing > at start of line
to make links (use https whenever possible)

<https://example.com>

[example](https://example.com)

<a href="https://example.com">example</a>

formatting help »
answering help »

Collectives™ on Stack Overflow