94       : pattern_(pattern), start_(0) {  in StringSearch()
99     size_t pattern_length = pattern_.length();  in StringSearch()
173   Vector pattern_;  variable
296   CHECK_EQ(1, pattern_.length());  in SingleCharSearch()
297   return FindFirstCharacter(pattern_, subject, index);  in SingleCharSearch()
309   CHECK_GT(pattern_.length(), 1);  in LinearSearch()
310   const size_t n = subject.length() - pattern_.length();  in LinearSearch()
312     i = FindFirstCharacter(pattern_, subject, i);  in LinearSearch()
318     for (size_t j = 1; j < pattern_.length(); j++) {  in LinearSearch()
319       if (pattern_[j] != subject[i + j]) {  in LinearSearch()
340   const size_t pattern_length = pattern_.length();  in BoyerMooreSearch()
347   Char last_char = pattern_[pattern_length - 1];  in BoyerMooreSearch()
360     while (pattern_[j] == (c = subject[index + j])) {  in BoyerMooreSearch()
387   const size_t pattern_length = pattern_.length();  in PopulateBoyerMooreTable()
410   Char last_char = pattern_[pattern_length - 1];  in PopulateBoyerMooreTable()
415       Char c = pattern_[i - 1];  in PopulateBoyerMooreTable()
416       while (suffix <= pattern_length && c != pattern_[suffix - 1]) {  in PopulateBoyerMooreTable()
425         while ((i > start) && (pattern_[i - 1] != last_char)) {  in PopulateBoyerMooreTable()
459   const size_t pattern_length = pattern_.length();  in BoyerMooreHorspoolSearch()
464   Char last_char = pattern_[pattern_length - 1];  in BoyerMooreHorspoolSearch()
484     while (pattern_[j] == (subject[index + j])) {  in BoyerMooreHorspoolSearch()
507   const size_t pattern_length = pattern_.length();  in PopulateBoyerMooreHorspoolTable()
526     Char c = pattern_[i];  in PopulateBoyerMooreHorspoolTable()
542   const size_t pattern_length = pattern_.length();  in InitialSearch()
553       i = FindFirstCharacter(pattern_, subject, i);  in InitialSearch()
559         if (pattern_[j] != subject[i + j]) {  in InitialSearch()