Lines Matching refs:lo
220 Rune r = re->ccb_->begin()->lo;
225 Rune r = re->ccb_->begin()->lo;
242 // If there isn't one, returns the CaseFold* with smallest f->lo bigger than r.
250 if (f[m].lo <= r && r <= f[m].hi)
252 if (r < f[m].lo) {
278 if ((r - f->lo) % 2)
287 if ((r - f->lo) % 2)
309 if (f == NULL || r < f->lo)
314 // Add lo-hi to the class, along with their fold-equivalent characters.
315 // If lo-hi is already in the class, assume that the fold-equivalent
317 static void AddFoldedRange(CharClassBuilder* cc, Rune lo, Rune hi, int depth) {
327 if (!cc->AddRange(lo, hi)) // lo-hi was already there? we're done
330 while (lo <= hi) {
331 CaseFold* f = LookupCaseFold(unicode_casefold, num_unicode_casefold, lo);
332 if (f == NULL) // lo has no fold, nor does anything above lo
334 if (lo < f->lo) { // lo has no fold; next rune with a fold is f->lo
335 lo = f->lo;
339 // Add in the result of folding the range lo - f->hi
341 Rune lo1 = lo;
364 lo = f->hi + 1;
959 ccb.AddRange(it->lo, it->hi);
1144 // Sets *lo and *hi to the given range.
1151 static bool MaybeParseRepetition(StringPiece* sp, int* lo, int* hi) {
1156 if (!ParseInteger(&s, lo))
1174 *hi = *lo;
1386 Rune lo, Rune hi, Regexp::ParseFlags parse_flags) {
1391 if (cutnl && lo <= '\n' && '\n' <= hi) {
1392 if (lo < '\n')
1393 AddRangeFlags(lo, '\n' - 1, parse_flags);
1401 AddFoldedRange(this, lo, hi, 0);
1403 AddRange(lo, hi);
1443 cc->AddRangeFlags(g->r16[i].lo, g->r16[i].hi, parse_flags);
1446 cc->AddRangeFlags(g->r32[i].lo, g->r32[i].hi, parse_flags);
1463 if (next < g->r16[i].lo)
1464 cc->AddRangeFlags(next, g->r16[i].lo - 1, parse_flags);
1468 if (next < g->r32[i].lo)
1469 cc->AddRangeFlags(next, g->r32[i].lo - 1, parse_flags);
1628 lo == rr->hi.
1635 if (!ParseCCCharacter(s, &rr->lo, whole_class, status))
1642 if (rr->hi < rr->lo) {
1648 rr->hi = rr->lo;
1746 re->ccb_->AddRangeFlags(rr.lo, rr.hi, flags_ | Regexp::ClassNL);
2080 int lo, hi;
2082 if (!MaybeParseRepetition(&t, &lo, &hi)) {
2104 if (!ps.PushRepetition(lo, hi, opstr, nongreedy))
