Lines Matching refs:range
109 // Consider the range from last to ranges[i].
110 // We haven't got to the new range yet.
112 // New range is wholly inside last-ranges[i]. Note that new_range.to() is
1145 Interval range = static_cast<DeferredClearCaptures*>(this)->range();
1146 return range.Contains(that);
1189 Interval range = static_cast<DeferredClearCaptures*>(action)->range();
1190 for (int i = range.from(); i <= range.to(); i++)
1192 if (range.to() > max_register) max_register = range.to();
1502 ActionNode* ActionNode::ClearCaptures(Interval range,
1506 result->data_.u_clear_captures.range_from = range.from();
1507 result->data_.u_clear_captures.range_to = range.to();
1879 // Cut out the single range by rewriting the array. This creates a new
1880 // range that is a merger of the two ranges on either side of the one we
1924 // range with a single not-taken branch, speeding up this important
1925 // character range (even non-Latin1 charset-based text has spaces and
1958 // character is in the range between an even and an odd boundary (counting from
1960 // know that the character is in the range of min_char to max_char inclusive.
2135 CharacterRange& range = ranges->at(last_valid_range);
2136 if (range.from() <= max_char) {
2197 CharacterRange& range = ranges->at(i);
2198 if (range.from() == 0) {
2202 range_boundaries->Add(range.from(), zone);
2204 range_boundaries->Add(range.to() + 1, zone);
2626 CharacterRange range = ranges->at(first_range);
2627 uc16 from = range.from();
2628 uc16 to = range.to();
2642 CharacterRange range = ranges->at(i);
2643 uc16 from = range.from();
2644 uc16 to = range.to();
2648 // value. With each new range the mask becomes more sparse and
2773 static inline bool RangeContainsLatin1Equivalents(CharacterRange range) {
2775 return range.Contains(0x39c) ||
2776 range.Contains(0x3bc) || range.Contains(0x178);
2804 // are outside the Latin-1 range.
3649 // Find the longest range of lookahead that has the fewest number of different
3668 // Find the highest-points range between 0 and length_ where the character
3671 // of points as the product of width-of-the-range and
3709 // be outside the 0-kSize range.
3723 // occur in the subject string in the range between min_lookahead and
3726 // can safely skip forwards by the number of characters in the range.
4580 CharacterRange range = node->ranges(zone)->at(j);
4581 os_ << AsUC16(range.from()) << "-" << AsUC16(range.to());
4757 CharacterRange range = ranges->at(0);
4758 if (range.from() != 0) {
4762 if (special_class[i] != (range.to() + 1)) {
4765 range = ranges->at((i >> 1) + 1);
4766 if (special_class[i+1] != range.from()) {
4770 if (range.to() != 0xffff) {
4786 CharacterRange range = ranges->at(i >> 1);
4787 if (range.from() != special_class[i] ||
4788 range.to() != special_class[i + 1] - 1) {
5261 // This is not a character range as defined by the spec but a
5355 // If this is a range we expand the characters block by block,
5366 // and produce a range for each element. For instance for [c-f]
5368 // add a range if it is not already contained in the input, so [c-f]
5369 // will be skipped but [C-F] will be added. If this range is not
5371 // covered by the range (handling characters that is not in a block
5373 unibrow::uchar range[unibrow::Ecma262UnCanonicalize::kMaxWidth];
5376 int length = isolate->jsregexp_canonrange()->get(pos, '\0', range);
5382 block_end = range[0];
5385 length = isolate->jsregexp_uncanonicalize()->get(block_end, '\0', range);
5387 uc32 c = range[i];
5445 // Inserts a range into list[0..count[, which must be sorted
5448 // canonicalized ranges. Inserting a range may collapse existing ranges into
5449 // fewer ranges, so the return value can be anything in the range 1..count+1.
5464 // Inserted range overlaps, or is adjacent to, ranges at positions
5467 // If start_pos == end_pos, the range must be inserted before start_pos.
5468 // if start_pos < end_pos, the entire range from start_pos to end_pos
5469 // must be merged with the insert range.
5480 // Replace single existing range at position start_pos.
5523 // Canonical until the i'th range. If that's all of them, we are done.
5529 // Notice that inserting a range can reduce the number of ranges in the
5558 CharacterRange range = ranges->at(i);
5559 negated_ranges->Add(CharacterRange(from + 1, range.from() - 1), zone);
5560 from = range.to();
5623 // If this is the first range we just insert into the table.
5630 // First see if there is a range to the left of this one that
5635 // If we've found a range that overlaps with this one, and it
5638 // or after the start point of the range we're adding.
5640 // Snap the overlapping range in half around the start point of
5641 // the range we're adding.
5644 // The left part of the overlapping range doesn't overlap.
5649 // the range we're adding.
5663 // the range we're adding and where the overlapping range starts
5664 // then we have to add a range covering just that space.
5674 // If the overlapping range extends beyond the one we want to add
5685 // The overlapping range is now completely contained by the range
5687 // of the range we're adding just past it.
5696 // There is no overlap so we can just add the range
5898 CharacterRange& range = ranges->at(k);
5899 if (range.from() > max_char) continue;
5900 int to = Min(max_char, static_cast<int>(range.to()));
5901 bm->SetInterval(offset, Interval(range.from(), to));
5950 CharacterRange range(from, entry.to());
5951 constructor_->AddRange(range);
5987 CharacterRange range = ranges->at(i);
5988 if (last < range.from())
5989 AddRange(CharacterRange(last, range.from() - 1));
5990 if (range.to() >= last) {
5991 if (range.to() == String::kMaxUtf16CodeUnit) {
5994 last = range.to() + 1;