HomeSort by relevance Sort by last modified time
    Searched refs:nsub_ (Results 1 - 5 of 5) sorted by null

  /external/regex-re2/re2/
walker-inl.h 186 if (re->nsub_ == 1)
188 else if (re->nsub_ > 1)
189 s->child_args = new T[re->nsub_];
193 if (re->nsub_ > 0) {
195 if (s->n < re->nsub_) {
207 if (re->nsub_ > 1)
simplify.cc 63 for (int i = 0; i < nsub_; i++)
202 for (int i = 0; i < re->nsub_; i++) {
211 for (int i = 0; i < re->nsub_; i++) {
219 nre->AllocSub(re->nsub_);
221 for (int i = 0; i <re->nsub_; i++)
regexp.h 313 int nsub() { return nsub_; }
319 if(nsub_ <= 1)
494 nsub_ = n;
534 uint16 nsub_; member in class:re2::Regexp
537 Regexp** submany_; // if nsub_ > 1
538 Regexp* subone_; // if nsub_ == 1
regexp.cc 21 nsub_(0),
33 if (nsub_ > 0)
55 if (nsub_ == 0) {
125 if (re->nsub_ > 0) {
127 for (int i = 0; i < re->nsub_; i++) {
140 if (re->nsub_ > 1)
142 re->nsub_ = 0;
620 while (i < nsub_ && sub[i]->op_ == kRegexpBeginText)
622 if (i == 0 || i >= nsub_)
665 if (i < nsub_) {
    [all...]
parse.cc 676 re->nsub_--;
677 memmove(sub, sub + 1, re->nsub_ * sizeof sub[0]);
776 re->nsub_--;
777 memmove(sub, sub + 1, re->nsub_ * sizeof sub[0]);
1006 n += sub->nsub_;
1024 for (int k = sub->nsub_ - 1; k >= 0; k--)
    [all...]

Completed in 572 milliseconds