Lines Matching defs:from
62 if (range.from() != 0) return false;
69 if (static_cast<base::uc32>(special_class[i + 1]) != range.from()) {
86 if (range.from() != static_cast<base::uc32>(special_class[i]) ||
136 // - Code points from the BMP representable by one code unit.
183 const base::uc32 from = std::max(kStarts[i], range.from());
185 if (from > to) continue;
186 kTargets[i]->emplace_back(CharacterRange::Range(from, to));
216 using UC16Range = uint32_t; // {from, to} packed into one uint32_t.
217 constexpr UC16Range ToUC16Range(base::uc16 from, base::uc16 to) {
218 return (static_cast<uint32_t>(from) << 16) | to;
277 base::uc32 from = non_bmp->at(i).from();
279 base::uc16 from_l = unibrow::Utf16::LeadSurrogate(from);
280 base::uc16 from_t = unibrow::Utf16::TrailSurrogate(from);
415 // nothing will match from there. We will have to advance again, consuming
437 set.add(ranges->at(i).from(), ranges->at(i).to());
1055 int from = kNoIndex;
1059 if (from == kNoIndex && t->IsAssertion()) {
1060 from = i; // Start a sequence.
1061 } else if (from != kNoIndex && !t->IsAssertion()) {
1063 if (i - from > 1) rewriter.Rewrite(from, i);
1064 from = kNoIndex;
1068 if (from != kNoIndex && terms->length() - from > 1) {
1069 rewriter.Rewrite(from, terms->length());
1078 void Rewrite(int from, int to) {
1079 DCHECK_GT(to, from + 1);
1086 for (int i = from; i < to; i++) {
1103 ReplaceSequenceWithFailure(from, to);
1107 void ReplaceSequenceWithFailure(int from, int to) {
1114 terms_->Set(from, cc);
1118 for (int i = from + 1; i < to; i++) terms_->Set(i, empty);
1253 base::uc32 from = range.from();
1254 if (from > kMaxUtf16CodeUnit) continue;
1257 if (from >= kLeadSurrogateStart && to <= kTrailSurrogateEnd) continue;
1259 if (from > kMaxOneByteCharCode) continue;
1262 others.add(from, to);
1274 // prevent 'ſ' from adding 's'), and once after calling closeOver
1275 // (to prevent 's' from adding 'ſ'). See regexp/special-case.h for
1285 UChar32 from = others.getRangeStart(i);
1287 if (from == to) {
1288 ranges->Add(CharacterRange::Singleton(from), zone);
1290 ranges->Add(CharacterRange::Range(from, to), zone);
1296 base::uc32 bottom = range.from();
1322 // that each entry in the result is incremented by the distance from the
1369 if (next_range.from() <= max + 1) return false;
1388 void MoveRanges(ZoneList<CharacterRange>* list, int from, int to, int count) {
1390 if (from < to) {
1392 list->at(to + i) = list->at(from + i);
1396 list->at(to + i) = list->at(from + i);
1404 // by from value and non-overlapping and non-adjacent, using at most
1408 base::uc32 from = insert.from();
1414 if (current.from() > to + 1) {
1416 } else if (current.to() + 1 < from) {
1426 // if start_pos < end_pos, the entire range from start_pos to end_pos
1440 int new_from = std::min(to_replace.from(), from);
1445 // Replace a number of existing ranges from start_pos to end_pos - 1.
1448 int new_from = std::min(list->at(start_pos).from(), from);
1476 if (current.from() <= max + 1) {
1509 base::uc32 from = 0;
1511 if (range_count > 0 && ranges->at(0).from() == 0) {
1512 from = ranges->at(0).to() + 1;
1517 negated_ranges->Add(CharacterRange::Range(from, range.from() - 1), zone);
1518 from = range.to() + 1;
1521 if (from < kMaxCodePoint) {
1522 negated_ranges->Add(CharacterRange::Range(from, kMaxCodePoint), zone);
1538 if (r.from() <= max_char) {
1610 // from step 2.1. If the min and max are small we can unroll a little in
1634 // Unroll the forced matches from 0 to min. This can cause chains of