// transition to and from NotExist when GOMAXPROCS changes. We can emit
	// events for this to clearly delineate GOMAXPROCS changes.

	if viewerEv.Name != "" {
		ctx.Instant(viewerEv)
	}
}

func (g *procGenerator) Finish(ctx *traceContext) {
	ctx.SetResourceType("PROCS")

	// Finish off ranges first. It doesn't really matter for the global ranges,
	// but the proc ranges need to either be a subset of a goroutine slice or

        0      | Fruit.apples  | 0      | Fruit.oranges | 0       | Fruit.apples
        0      | Fruit.apples  | 12     | Fruit.oranges | 12      | Fruit.oranges
        0.7    | Fruit.apples  | 0      | Fruit.oranges | 0.7     | Fruit.apples
        1      | Fruit.apples  | 2      | Fruit.oranges | 7       | Fruit.apples
        3      | Fruit.oranges | 4      | Fruit.oranges | 7       | Fruit.oranges

    DEPRECATION      text ranges: [(302,320)]
      PSI: KtNameReferenceExpression at (71,21-39)
  for PSI element of type KtNameReferenceExpression at (72,21-39)
    DEPRECATION      text ranges: [(352,370)]
      PSI: KtNameReferenceExpression at (72,21-39)
  for PSI element of type KtNameReferenceExpression at (74,21-40)
    DEPRECATION      text ranges: [(396,415)]
      PSI: KtNameReferenceExpression at (74,21-40)

  }

  @Override
  @CheckForNull
  public abstract Range<C> rangeContaining(C value);

  @Override
  public boolean isEmpty() {
    return asRanges().isEmpty();
  }

  @Override
  public void add(Range<C> range) {
    throw new UnsupportedOperationException();
  }

  @Override
  public void remove(Range<C> range) {
    throw new UnsupportedOperationException();
  }

  @Override

    ABSTRACT_CLASS_MEMBER_NOT_IMPLEMENTED      text ranges: [(62,69)]
      PSI: KtClass at (6,1-11)
  for PSI element of type KtNamedFunction at (4,3-21)
    ABSTRACT_FUNCTION_IN_NON_ABSTRACT_CLASS      text ranges: [(41,49)]
      PSI: KtNamedFunction at (4,3-21)
  for PSI element of type KtTypeReference at (6,10-11)
    FINAL_SUPERTYPE      text ranges: [(71,72)]
      PSI: KtTypeReference at (6,10-11)

			ranges[0] = singleRange{first: 0}
			first = false
		}

		i := 0
		for _, r := range setText {
			if first {
				// lower bound in a new range
				ranges[i] = singleRange{first: r}
				first = false
			} else {
				ranges[i].last = r - 1
				i++
				first = true
			}
		}
	}

	return len(ranges)
}

type singleRange struct {
	first rune
	last  rune

    }

    internal
    fun erase(ranges: List<IntRange>): ProgramText =
        if (ranges.isEmpty()) this
        else ProgramText(text.erase(ranges))

    fun preserve(vararg ranges: IntRange): ProgramText =
        erase(complementOf(ranges))

    internal
    fun preserve(ranges: List<IntRange>): ProgramText =
        preserve(*ranges.toTypedArray())

    fun subText(range: IntRange): ProgramText =

  }
  return @ranges;
}

sub PrintClass($$@) {
  my ($cname, $name, @ranges) = @_;
  print "var code$cname = []rune{  /* $name */\n";
  for (my $i=0; $i<@ranges; $i++) {
    my @a = @{$ranges[$i]};
    printf "\t0x%x, 0x%x,\n", $a[0], $a[1];
  }
  print "}\n\n";
  my $n = @ranges;
  my $negname = $name;
  if ($negname =~ /:/) {
    $negname =~ s/:/:^/;
  } else {
    $negname =~ y/a-z/A-Z/;
  }

// The # is a signal to New but not part of the key used in $GODEBUG.
//
// Note that almost all settings should arrange to call [IncNonDefault] precisely
// when program behavior is changing from the default due to the setting
// (not just when the setting is different, but when program behavior changes).
// See the [internal/godebug] package comment for more.
func New(name string) *Setting {
	return &Setting{name: name}
}

	nfkcData = newNfkcTrie(0)
)

// lookup determines the type of block n and looks up the value for b.
// For n < t.cutoff, the block is a simple lookup table. Otherwise, the block
// is a list of ranges with an accompanying value. Given a matching range r,
// the value for b is by r.value + (b - r.lo) * stride.
func (t *sparseBlocks) lookup(n uint32, b byte) uint16 {
	offset := t.offset[n]
	header := t.values[offset]
	lo := offset + 1