Lines Matching defs:pattern_length
89 int pattern_length = pattern_.length();
90 if (pattern_length < kBMMinPatternLength) {
91 if (pattern_length == 1) {
200 // Cache value of Max(0, pattern_length() - kBMMaxShift)
268 int pattern_length = pattern.length();
271 int n = subject.length() - pattern_length;
287 pattern_length - 1)) {
305 int pattern_length = pattern.length();
312 PatternChar last_char = pattern[pattern_length - 1];
315 while (index <= subject_length - pattern_length) {
316 int j = pattern_length - 1;
322 if (index > subject_length - pattern_length) {
332 index += pattern_length - 1
353 int pattern_length = pattern_.length();
356 // to pattern_length).
358 int length = pattern_length - start;
366 for (int i = start; i < pattern_length; i++) {
369 shift_table[pattern_length] = 1;
370 suffix_table[pattern_length] = pattern_length + 1;
372 if (pattern_length <= start) {
377 PatternChar last_char = pattern[pattern_length - 1];
378 int suffix = pattern_length + 1;
380 int i = pattern_length;
383 while (suffix <= pattern_length && c != pattern[suffix - 1]) {
390 if (suffix == pattern_length) {
393 if (shift_table[pattern_length] == length) {
394 shift_table[pattern_length] = pattern_length - i;
396 suffix_table[--i] = pattern_length;
405 if (suffix < pattern_length) {
406 for (int i = start; i <= pattern_length; i++) {
428 int pattern_length = pattern.length();
430 int badness = -pattern_length;
433 PatternChar last_char = pattern[pattern_length - 1];
434 int last_char_shift = pattern_length - 1 -
438 while (index <= subject_length - pattern_length) {
439 int j = pattern_length - 1;
446 if (index > subject_length - pattern_length) {
460 pattern_length - j) - last_char_shift;
474 int pattern_length = pattern_.length();
493 for (int i = start; i < pattern_length - 1; i++) {
512 int pattern_length = pattern.length();
516 int badness = -10 - (pattern_length << 2);
521 for (int i = index, n = subject.length() - pattern_length; i <= n; i++) {
542 } while (j < pattern_length);
543 if (j == pattern_length) {
