Lines Matching refs:idx
2182 int idx; // No matches found prior to this index.
2186 for (idx = start_index; idx <= n - m;) {
2189 while (last_char != (c = subject[idx + j])) {
2192 idx += shift;
2194 if (idx > n - m) {
2200 while (j >= 0 && pattern[j] == (subject[idx + j])) j--;
2203 return idx;
2205 idx += last_char_shift;
2213 return idx;
2225 int idx) {
2235 while (idx <= n - m) {
2238 while (last_char != (c = subject[idx + j])) {
2240 idx += shift;
2241 if (idx > n - m) {
2245 while (j >= 0 && pattern[j] == (c = subject[idx + j])) j--;
2247 return idx;
2251 idx += m - 1 - CharOccurrence<schar, pchar>(last_char);
2259 idx += shift;
2302 int idx,
2312 for (int i = idx, n = subject.length() - pattern.length(); i <= n; i++) {
2340 int idx) {
2342 for (int i = idx, n = subject.length() - pattern.length(); i <= n; i++) {
2385 int idx = SimpleIndexOf(sub, pat, start_index, &complete);
2386 if (complete) return idx;
2387 idx = BoyerMooreHorspool(sub, pat, idx, &complete);
2388 if (complete) return idx;
2389 return BoyerMooreIndexOf(sub, pat, idx);
2475 int idx) {
2477 ASSERT(idx + pat.length() <= sub.length());
2489 for (int i = idx; i >= 0; i--) {
