Searched refs:nrunes_ (Results 1 – 3 of 3) sorted by relevance
173 if (nrunes_ == 0) { in AddRuneToString()176 } else if (nrunes_ >= 8 && (nrunes_ & (nrunes_ - 1)) == 0) { in AddRuneToString()179 runes_ = new Rune[nrunes_ * 2]; in AddRuneToString()180 for (int i = 0; i < nrunes_; i++) in AddRuneToString()185 runes_[nrunes_++] = r; in AddRuneToString()710 int nrunes = re->op_ == kRegexpLiteral ? 1 : re->nrunes_; in RequiredPrefix()732 int nrunes = re->op_ == kRegexpLiteral ? 1 : re->nrunes_; in RequiredPrefixForAccel()745 nrunes_ = 0; in CharClassBuilder()783 nrunes_ -= it->hi - it->lo + 1; in AddRange()794 nrunes_ -= it->hi - it->lo + 1; in AddRange()[all …]
250 int size() { return nrunes_; } in size()251 bool empty() { return nrunes_ == 0; } in empty()252 bool full() { return nrunes_ == Runemax+1; } in full()266 int nrunes_; variable341 int nrunes() { DCHECK_EQ(op_, kRegexpLiteralString); return nrunes_; } in nrunes()577 int nrunes_; member607 int size() { return nrunes_; } in size()608 bool empty() { return nrunes_ == 0; } in empty()609 bool full() { return nrunes_ == Runemax+1; } in full()625 int nrunes_; variable
788 *nrune = re->nrunes_; in LeadingString()817 if (n >= re->nrunes_) { in RemoveLeadingString()820 re->nrunes_ = 0; in RemoveLeadingString()822 } else if (n == re->nrunes_ - 1) { in RemoveLeadingString()823 Rune rune = re->runes_[re->nrunes_ - 1]; in RemoveLeadingString()826 re->nrunes_ = 0; in RemoveLeadingString()830 re->nrunes_ -= n; in RemoveLeadingString()831 memmove(re->runes_, re->runes_ + n, re->nrunes_ * sizeof re->runes_[0]); in RemoveLeadingString()1293 re2->nrunes_ = 0; in MaybeConcatString()1302 for (int i = 0; i < re1->nrunes_; i++) in MaybeConcatString()[all …]