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

  /external/regex-re2/re2/
regexp.h 245 int size() { return nrunes_; }
246 bool empty() { return nrunes_ == 0; }
247 bool full() { return nrunes_ == Runemax+1; }
261 int nrunes_; member in class:re2::CharClass
333 int nrunes() { DCHECK_EQ(op_, kRegexpLiteralString); return nrunes_; }
556 int nrunes_; member in struct:re2::Regexp::__anon17887::__anon17890
585 int size() { return nrunes_; }
586 bool empty() { return nrunes_ == 0; }
587 bool full() { return nrunes_ == Runemax+1; }
603 int nrunes_; member in class:re2::CharClassBuilder
    [all...]
regexp.cc 161 if (nrunes_ == 0) {
164 } else if (nrunes_ >= 8 && (nrunes_ & (nrunes_ - 1)) == 0) {
167 runes_ = new Rune[nrunes_ * 2];
168 for (int i = 0; i < nrunes_; i++)
173 runes_[nrunes_++] = r;
644 prefix->resize(re->nrunes_);
645 for (int j = 0; j < re->nrunes_; j++)
650 prefix->resize(re->nrunes_ * UTFmax)
    [all...]
parse.cc 700 *nrune = re->nrunes_;
729 if (n >= re->nrunes_) {
732 re->nrunes_ = 0;
734 } else if (n == re->nrunes_ - 1) {
735 Rune rune = re->runes_[re->nrunes_ - 1];
738 re->nrunes_ = 0;
742 re->nrunes_ -= n;
743 memmove(re->runes_, re->runes_ + n, re->nrunes_ * sizeof re->runes_[0]);
    [all...]

Completed in 70 milliseconds