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

  /external/regex-re2/re2/
parse.cc 228 re = new Regexp(kRegexpLiteral, flags_ | FoldCase);
371 if ((flags_ & FoldCase) && CycleFoldRune(r) != r) {
372 Regexp* re = new Regexp(kRegexpCharClass, flags_ & ~FoldCase);
432 Regexp* re = new Regexp(kRegexpCharClass, flags_ & ~FoldCase);
555 AddLiteral(r3->ccb_, rune, r3->parse_flags_ & Regexp::FoldCase);
560 r1->parse_flags_ & Regexp::FoldCase);
693 *flags = static_cast<Regexp::ParseFlags>(re->parse_flags_ & Regexp::FoldCase);
    [all...]
tostring.cc 120 static void AppendLiteral(string *t, Rune r, bool foldcase) {
124 } else if (foldcase && 'a' <= r && r <= 'z') {
157 AppendLiteral(t_, re->rune(), re->parse_flags() & Regexp::FoldCase);
162 AppendLiteral(t_, re->runes()[i], re->parse_flags() & Regexp::FoldCase);
regexp.h 273 FoldCase = 1<<0, // Fold case during matching (case-insensitive).
290 // i - FoldCase
429 bool RequiredPrefix(string* prefix, bool *foldcase, Regexp** suffix);
513 // (Only FoldCase is used.)
regexp.cc 328 ((a->parse_flags() ^ b->parse_flags()) & Regexp::FoldCase) == 0;
332 ((a->parse_flags() ^ b->parse_flags()) & Regexp::FoldCase) == 0 &&
606 bool Regexp::RequiredPrefix(string *prefix, bool *foldcase, Regexp** suffix) {
612 *foldcase = false;
661 *foldcase = (sub[i]->parse_flags() & FoldCase);
compile.cc 173 Frag ByteRange(int lo, int hi, bool foldcase);
192 void AddRuneRange(Rune lo, Rune hi, bool foldcase);
193 void AddRuneRangeLatin1(Rune lo, Rune hi, bool foldcase);
194 void AddRuneRangeUTF8(Rune lo, Rune hi, bool foldcase);
198 int RuneByteSuffix(uint8 lo, uint8 hi, bool foldcase, int next);
199 int UncachedRuneByteSuffix(uint8 lo, uint8 hi, bool foldcase, int next);
208 Frag Literal(Rune r, bool foldcase);
391 Frag Compiler::ByteRange(int lo, int hi, bool foldcase) {
395 inst_[id].InitByteRange(lo, hi, foldcase, 0);
398 if (foldcase && lo <= 'z' && hi >= 'a')
    [all...]
re2.cc 133 flags |= Regexp::FoldCase;
    [all...]

Completed in 60 milliseconds