Lines Matching defs:length
39 // Bad-char shift table stored in the state. It's length is the alphabet size.
40 // For patterns below this length, the skip length of Boyer-Moore is too short
49 return String::IsOneByte(string.begin(), string.length());
61 start_(std::max(0, pattern.length() - kBMMaxShift)) {
68 int pattern_length = pattern_.length();
162 // Return biased pointer that maps the range [start_..pattern_.length()
170 // Return biased pointer that maps the range [start_..pattern_.length()
202 const int max_n = (subject.length() - pattern.length() + 1);
238 DCHECK_EQ(1, search->pattern_.length());
254 int length) {
255 DCHECK_GT(length, 0);
262 } while (pos < length);
272 DCHECK_GT(pattern.length(), 1);
273 int pattern_length = pattern.length();
275 int n = subject.length() - pattern_length;
300 int subject_length = subject.length();
301 int pattern_length = pattern.length();
346 int pattern_length = pattern_.length();
351 int length = pattern_length - start;
360 shift_table[i] = length;
377 if (shift_table[suffix] == length) {
386 if (shift_table[pattern_length] == length) {
400 if (shift_table[i] == length) {
419 int subject_length = subject.length();
420 int pattern_length = pattern.length();
466 int pattern_length = pattern_.length();
476 if (start == 0) { // All patterns less than kBMMaxShift in length.
501 int pattern_length = pattern.length();
509 for (int i = index, n = subject.length() - pattern_length; i <= n; i++) {