Home | History | Annotate | Download | only in util

Lines Matching refs:vec

181   int vec[kVecSize];
182 return re.DoMatchImpl(text, ANCHOR_BOTH, &consumed, args, n, vec, kVecSize);
224 int vec[kVecSize];
225 return re.DoMatchImpl(text, UNANCHORED, &consumed, args, n, vec, kVecSize);
267 int vec[kVecSize];
269 args, n, vec, kVecSize)) {
316 int vec[kVecSize];
318 args, n, vec, kVecSize)) {
329 int vec[kVecSize];
330 int matches = pattern.TryMatch(*str, 0, UNANCHORED, true, vec, kVecSize);
335 if (!pattern.Rewrite(&s, rewrite, *str, vec, matches))
338 assert(vec[0] >= 0);
339 assert(vec[1] >= 0);
340 str->replace(vec[0], vec[1] - vec[0], s);
348 int vec[kVecSize];
367 vec, kVecSize);
376 matches = pattern.TryMatch(*str, start, UNANCHORED, true, vec, kVecSize);
380 int matchstart = vec[0], matchend = vec[1];
385 pattern.Rewrite(&out, rewrite, *str, vec, matches);
404 int vec[kVecSize];
405 int matches = pattern.TryMatch(text, 0, UNANCHORED, true, vec, kVecSize);
409 return pattern.Rewrite(out, rewrite, text, vec, matches);
461 int *vec,
501 vec,
544 << ", vec=" << vec
558 int* vec,
561 int matches = TryMatch(text, 0, anchor, true, vec, vecsize);
566 *consumed = vec[1];
581 const int start = vec[2*(i+1)];
582 const int limit = vec[2*(i+1)+1];
600 int *vec = new int[vecsize];
601 bool b = DoMatchImpl(text, anchor, consumed, args, n, vec, vecsize);
602 delete[] vec;
607 const StringPiece &text, int *vec, int veclen) const {
626 int start = vec[2 * n];
628 out->append(text.data() + start, vec[2 * n + 1] - start);