Lines Matching defs:range
297 Interval range = static_cast<DeferredClearCaptures*>(this)->range();
298 return range.Contains(that);
367 Interval range = static_cast<DeferredClearCaptures*>(action)->range();
368 for (int i = range.from(); i <= range.to(); i++)
370 if (range.to() > max_register) max_register = range.to();
664 ActionNode* ActionNode::ClearCaptures(Interval range, RegExpNode* on_success) {
667 result->data_.u_clear_captures.range_from = range.from();
668 result->data_.u_clear_captures.range_to = range.to();
1027 // Cut out the single range by rewriting the array. This creates a new
1028 // range that is a merger of the two ranges on either side of the one we
1068 // range with a single not-taken branch, speeding up this important
1069 // character range (even non-Latin1 charset-based text has spaces and
1101 // character is in the range between an even and an odd boundary (counting from
1103 // know that the character is in the range of min_char to max_char inclusive.
1264 // For large range sets, emit a more compact instruction sequence to avoid
1280 // Generate a flat list of range boundaries for consumption by
1289 CharacterRange& range = ranges->at(i);
1290 if (range.from() == 0) {
1294 range_boundaries->Add(range.from(), zone);
1298 range_boundaries->Add(range.to() + 1, zone);
1684 CharacterRange range = ranges->at(first_range);
1685 const base::uc32 first_from = range.from();
1687 (range.to() > char_mask) ? char_mask : range.to();
1698 range = ranges->at(i);
1699 const base::uc32 from = range.from();
1702 (range.to() > char_mask) ? char_mask : range.to();
1704 // value. With each new range the mask becomes more sparse and
1851 bool RangeContainsLatin1Equivalents(CharacterRange range) {
1853 return range.Contains(0x039C) || range.Contains(0x03BC) ||
1854 range.Contains(0x0178);
2712 // Consider the range from last to ranges[i].
2713 // We haven't got to the new range yet.
2715 // New range is wholly inside last-ranges[i]. Note that new_range.to() is
2791 // Find the longest range of lookahead that has the fewest number of different
2808 // Find the highest-points range between 0 and length_ where the character
2811 // of points as the product of width-of-the-range and
2853 // be outside the 0-kSize range.
2866 // occur in the subject string in the range between min_lookahead and
2869 // can safely skip forwards by the number of characters in the range.
3866 CharacterRange& range = ranges->at(k);
3867 if (static_cast<int>(range.from()) > max_char) continue;
3868 int to = std::min(max_char, static_cast<int>(range.to()));
3869 bm->SetInterval(offset, Interval(range.from(), to));