Index: src/string-search.h |
diff --git a/src/string-search.h b/src/string-search.h |
index 86237f3aebcb385e510edd49fde2a274e8c9680c..bc685ffe5846d9c5336c271e6312a9ba841695ec 100644 |
--- a/src/string-search.h |
+++ b/src/string-search.h |
@@ -53,11 +53,7 @@ class StringSearchBase { |
// a potentially less efficient searching, but is a safe approximation. |
// For needles using only characters in the same Unicode 256-code point page, |
// there is no search speed degradation. |
-#ifndef ENABLE_LATIN_1 |
- static const int kAsciiAlphabetSize = 128; |
-#else |
static const int kAsciiAlphabetSize = 256; |
-#endif |
static const int kUC16AlphabetSize = Isolate::kUC16AlphabetSize; |
// Bad-char shift table stored in the state. It's length is the alphabet size. |
@@ -155,11 +151,7 @@ class StringSearch : private StringSearchBase { |
void PopulateBoyerMooreTable(); |
static inline bool exceedsOneByte(uint8_t c) { |
-#ifdef ENABLE_LATIN_1 |
return false; |
-#else |
- return c > String::kMaxOneByteCharCodeU; |
-#endif |
} |
static inline bool exceedsOneByte(uint16_t c) { |