Commit b37b9af1 authored by erik.corry@gmail.com's avatar erik.corry@gmail.com

Spolling.

Review URL: http://codereview.chromium.org/42327

git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@1543 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
parent 2c84d84d
...@@ -1780,10 +1780,10 @@ static inline int CharOccurrence(int char_code) { ...@@ -1780,10 +1780,10 @@ static inline int CharOccurrence(int char_code) {
// Uses only the bad-shift table of Boyer-Moore and only uses it // Uses only the bad-shift table of Boyer-Moore and only uses it
// for the character compared to the last character of the needle. // for the character compared to the last character of the needle.
template <typename schar, typename pchar> template <typename schar, typename pchar>
static int BoyerMooreHorsepool(Vector<const schar> subject, static int BoyerMooreHorspool(Vector<const schar> subject,
Vector<const pchar> pattern, Vector<const pchar> pattern,
int start_index, int start_index,
bool* complete) { bool* complete) {
int n = subject.length(); int n = subject.length();
int m = pattern.length(); int m = pattern.length();
// Only preprocess at most kBMMaxShift last characters of pattern. // Only preprocess at most kBMMaxShift last characters of pattern.
...@@ -1983,7 +1983,7 @@ static int StringMatchStrategy(Vector<const schar> sub, ...@@ -1983,7 +1983,7 @@ static int StringMatchStrategy(Vector<const schar> sub,
bool complete; bool complete;
int idx = SimpleIndexOf(sub, pat, start_index, &complete); int idx = SimpleIndexOf(sub, pat, start_index, &complete);
if (complete) return idx; if (complete) return idx;
idx = BoyerMooreHorsepool(sub, pat, idx, &complete); idx = BoyerMooreHorspool(sub, pat, idx, &complete);
if (complete) return idx; if (complete) return idx;
return BoyerMooreIndexOf(sub, pat, idx); return BoyerMooreIndexOf(sub, pat, idx);
} }
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment