Home
last modified time | relevance | path

Searched refs:kBMMaxShift (Results 1 - 3 of 3) sorted by relevance

/third_party/node/src/
H A Dstring_search.h62 static const int kBMMaxShift = 250; member in node::stringsearch::StringSearchBase
82 int good_suffix_shift_table_[kBMMaxShift + 1];
85 int suffix_table_[kBMMaxShift + 1];
95 if (pattern.length() >= kBMMaxShift) { in StringSearch()
96 start_ = pattern.length() - kBMMaxShift; in StringSearch()
175 // Cache value of Max(0, pattern_length() - kBMMaxShift)
341 // Only preprocess at most kBMMaxShift last characters of pattern. in BoyerMooreSearch()
388 // Only look at the last kBMMaxShift characters of pattern (from start_ in PopulateBoyerMooreTable()
511 // Only preprocess at most kBMMaxShift last characters of pattern. in PopulateBoyerMooreHorspoolTable()
518 // All patterns less than kBMMaxShift i in PopulateBoyerMooreHorspoolTable()
[all...]
/third_party/node/deps/v8/src/strings/
H A Dstring-search.h27 static const int kBMMaxShift = Isolate::kBMMaxShift; member in v8::internal::StringSearchBase
61 start_(std::max(0, pattern.length() - kBMMaxShift)) { in StringSearch()
156 // Return a table covering the last kBMMaxShift+1 positions of
180 // Cache value of max(0, pattern_length() - kBMMaxShift)
302 // Only preprocess at most kBMMaxShift last characters of pattern. in BoyerMooreSearch()
348 // Only look at the last kBMMaxShift characters of pattern (from start_ in PopulateBoyerMooreTable()
470 // Only preprocess at most kBMMaxShift last characters of pattern. in PopulateBoyerMooreHorspoolTable()
476 if (start == 0) { // All patterns less than kBMMaxShift in length. in PopulateBoyerMooreHorspoolTable()
/third_party/node/deps/v8/src/execution/
H A Disolate.h454 V(int, good_suffix_shift_table, (kBMMaxShift + 1)) \
455 V(int, suffix_table, (kBMMaxShift + 1)) \
1060 static const int kBMMaxShift = 250; // See StringSearchBase. member in v8::internal::final

Completed in 10 milliseconds