| Index: src/string-search.h
|
| diff --git a/src/string-search.h b/src/string-search.h
|
| index a65558007cb7534c81799afcf5a1cd1a06f227d5..748a9f8c7031440fcf614f6e666f184312d535ae 100644
|
| --- a/src/string-search.h
|
| +++ b/src/string-search.h
|
| @@ -185,15 +185,16 @@ static void BoyerMoorePopulateBadCharTable(RuntimeState* state,
|
| }
|
| for (int i = start; i < pattern.length() - 1; i++) {
|
| PatternChar c = pattern[i];
|
| - int bucket = (sizeof(PatternChar) ==1) ? c : c % RuntimeState::kBMAlphabetSize;
|
| + int bucket = (sizeof(PatternChar) ==1)
|
| + ? c : c % RuntimeState::kBMAlphabetSize;
|
| bad_char_occurrence[bucket] = i;
|
| }
|
| }
|
|
|
|
|
| template <typename PatternChar>
|
| -static void BoyerMoorePopulateGoodSuffixTable(RuntimeState* state,
|
| - Vector<const PatternChar> pattern) {
|
| +static void BoyerMoorePopulateGoodSuffixTable(
|
| + RuntimeState* state, Vector<const PatternChar> pattern) {
|
| RuntimeState::BMGoodSuffixBuffers& bmgs_buffers = *state->bmgs_buffers();
|
| int m = pattern.length();
|
| int start = m < RuntimeState::kBMMaxShift ? 0 : m - RuntimeState::kBMMaxShift;
|
|
|