Lines Matching refs:subject
40 // independently of subject and pattern char size.
101 int Search(Vector<const SubjectChar> subject, int index) {
102 return strategy_(this, subject, index);
129 Vector<const SubjectChar> subject,
133 Vector<const SubjectChar> subject,
137 Vector<const SubjectChar> subject,
142 Vector<const SubjectChar> subject,
146 Vector<const SubjectChar> subject,
164 // Both pattern and subject are UC16. Reduce character to equivalence class.
212 Vector<const SubjectChar> subject,
219 memchr(subject.start() + i,
221 subject.length() - i));
223 return static_cast<int>(pos - subject.start());
231 int n = subject.length();
233 if (subject[i++] == search_char) return i - 1;
246 const SubjectChar* subject,
251 if (pattern[pos] != subject[pos]) {
264 Vector<const SubjectChar> subject,
271 int n = subject.length() - pattern_length;
275 memchr(subject.start() + i,
279 i = static_cast<int>(pos - subject.start()) + 1;
281 if (subject[i++] != pattern_first_char) continue;
286 subject.start() + i,
301 Vector<const SubjectChar> subject,
304 int subject_length = subject.length();
318 while (last_char != (c = subject[index + j])) {
326 while (j >= 0 && pattern[j] == (c = subject[index + j])) j--;
424 Vector<const SubjectChar> subject,
427 int subject_length = subject.length();
441 while (last_char != (subject_char = subject[index + j])) {
451 while (j >= 0 && pattern[j] == (subject[index + j])) j--;
464 return BoyerMooreSearch(search, subject, index);
505 // isn't found very early in the subject. Upgrades to BoyerMooreHorspool.
509 Vector<const SubjectChar> subject,
521 for (int i = index, n = subject.length() - pattern_length; i <= n; i++) {
526 memchr(subject.start() + i,
532 i = static_cast<int>(pos - subject.start());
534 if (subject[i] != pattern_first_char) continue;
538 if (pattern[j] != subject[i + j]) {
550 return BoyerMooreHorspoolSearch(search, subject, i);
563 Vector<const SubjectChar> subject,
567 return search.Search(subject, start_index);
