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,
172 // Both pattern and subject are UC16. Reduce character to equivalence class.
220 Vector<const SubjectChar> subject,
227 memchr(subject.start() + i,
229 subject.length() - i));
231 return static_cast<int>(pos - subject.start());
239 int n = subject.length();
241 if (subject[i++] == search_char) return i - 1;
254 const SubjectChar* subject,
259 if (pattern[pos] != subject[pos]) {
272 Vector<const SubjectChar> subject,
279 int n = subject.length() - pattern_length;
283 memchr(subject.start() + i,
287 i = static_cast<int>(pos - subject.start()) + 1;
289 if (subject[i++] != pattern_first_char) continue;
294 subject.start() + i,
309 Vector<const SubjectChar> subject,
312 int subject_length = subject.length();
326 while (last_char != (c = subject[index + j])) {
334 while (j >= 0 && pattern[j] == (c = subject[index + j])) j--;
432 Vector<const SubjectChar> subject,
435 int subject_length = subject.length();
449 while (last_char != (subject_char = subject[index + j])) {
459 while (j >= 0 && pattern[j] == (subject[index + j])) j--;
472 return BoyerMooreSearch(search, subject, index);
513 // isn't found very early in the subject. Upgrades to BoyerMooreHorspool.
517 Vector<const SubjectChar> subject,
529 for (int i = index, n = subject.length() - pattern_length; i <= n; i++) {
534 memchr(subject.start() + i,
540 i = static_cast<int>(pos - subject.start());
542 if (subject[i] != pattern_first_char) continue;
546 if (pattern[j] != subject[i + j]) {
558 return BoyerMooreHorspoolSearch(search, subject, i);
571 Vector<const SubjectChar> subject,
575 return search.Search(subject, start_index);
