Lines Matching refs:vec
190 int vec[kVecSize];
191 return DoMatchImpl(text, ANCHOR_BOTH, &consumed, args, n, vec, kVecSize);
232 int vec[kVecSize];
233 return DoMatchImpl(text, UNANCHORED, &consumed, args, n, vec, kVecSize);
274 int vec[kVecSize];
276 args, n, vec, kVecSize)) {
322 int vec[kVecSize];
324 args, n, vec, kVecSize)) {
334 int vec[kVecSize];
335 int matches = TryMatch(*str, 0, UNANCHORED, true, vec, kVecSize);
340 if (!Rewrite(&s, rewrite, *str, vec, matches))
343 assert(vec[0] >= 0);
344 assert(vec[1] >= 0);
345 str->replace(vec[0], vec[1] - vec[0], s);
384 int vec[kVecSize];
402 matches = TryMatch(*str, start, ANCHOR_START, false, vec, kVecSize);
432 matches = TryMatch(*str, start, UNANCHORED, true, vec, kVecSize);
436 vec[0], matchend = vec[1];
440 Rewrite(&out, rewrite, *str, vec, matches);
458 int vec[kVecSize];
459 int matches = TryMatch(text, 0, UNANCHORED, true, vec, kVecSize);
463 return Rewrite(out, rewrite, text, vec, matches);
506 int *vec,
539 vec,
565 int* vec,
568 int matches = TryMatch(text, 0, anchor, true, vec, vecsize);
573 *consumed = vec[1];
589 const int start = vec[2*(i+1)];
590 const int limit = vec[2*(i+1)+1];
609 int* vec = vecsize <= 21 ? space : new int[vecsize];
610 bool retval = DoMatchImpl(text, anchor, consumed, args, n, vec, (int)vecsize);
611 if (vec != space) delete [] vec;
616 const StringPiece &text, int *vec, int veclen) const {
629 int start = vec[2 * n];
631 out->append(text.data() + start, vec[2 * n + 1] - start);
