for (Range<C> range : other) {
      if (!encloses(range)) {
        return false;
      }
    }
    return true;
  }

  /** Returns {@code true} if this range set contains no ranges. */
  boolean isEmpty();

  /**
   * Returns the minimal range which {@linkplain Range#encloses(Range) encloses} all ranges in this
   * range set.
   *

}

// PutBasedRanges writes a range table to sym. All addresses in ranges are
// relative to some base address, which must be arranged by the caller
// (e.g., with a DW_AT_low_pc attribute, or in a BASE-prefixed range).
func PutBasedRanges(ctxt Context, sym Sym, ranges []Range) {
	ps := ctxt.PtrSize()
	// Write ranges.
	for _, r := range ranges {
		ctxt.AddInt(sym, ps, r.Start)
		ctxt.AddInt(sym, ps, r.End)

		if !ranges[i].Equals(want[i]) {
			t.Errorf("range %d: got [0x%x, 0x%x), want [0x%x, 0x%x)", i,
				ranges[i].Base(), ranges[i].Limit(),
				want[i].Base(), want[i].Limit(),
			)
		}
		if i != 0 {
			// Ensure the ranges are sorted.
			if ranges[i-1].Base() >= ranges[i].Base() {
				t.Errorf("ranges %d and %d are out of sorted order", i-1, i)
			}
			// Check for a failure to coalesce.
			if ranges[i-1].Limit() == ranges[i].Base() {

deveshkandpal1224 <******@****.***> 1717646003 -0700

Antoine Pelisse <******@****.***> 1581019688 -0800

    NONE_APPLICABLE      text ranges: [(89,92)]
      PSI: KtNameReferenceExpression at (6,5-8)
  for PSI element of type KtNameReferenceExpression at (7,5-8)
    NONE_APPLICABLE      text ranges: [(100,103)]
      PSI: KtNameReferenceExpression at (7,5-8)
  for PSI element of type KtNameReferenceExpression at (8,5-8)
    NONE_APPLICABLE      text ranges: [(115,118)]
      PSI: KtNameReferenceExpression at (8,5-8)

          rangesBuffer.writeByte(range.b2)
          rangesBuffer.writeByte('-'.code)
        }
        is MappedRange.Inline2 -> {
          rangesBuffer.writeByte(range.b1)
          rangesBuffer.writeByte(range.b2)
          rangesBuffer.writeByte(range.b3)
        }
        is MappedRange.InlineDelta -> {
          rangesBuffer.writeByte(range.b1)
          rangesBuffer.writeByte(range.b2)

	ranges, ok := v.ranges[r]
	return ok && slices.Contains(ranges, name)
}

func (v *Validator) addRange(r trace.ResourceID, name string) {
	ranges, _ := v.ranges[r]
	ranges = append(ranges, name)
	v.ranges[r] = ranges
}

func (v *Validator) hasAnyRange(r trace.ResourceID) bool {
	ranges, ok := v.ranges[r]
	return ok && len(ranges) != 0
}

    TYPE_MISMATCH      text ranges: [(97,159)]
      PSI: KtCallExpression at (23,20) - (26,2)
  for PSI element of type KtLambdaExpression at (23,24) - (26,2)
    TYPE_MISMATCH      text ranges: [(101,159)]
      PSI: KtLambdaExpression at (23,24) - (26,2)
  for PSI element of type KtNameReferenceExpression at (24,5-17)
    UNRESOLVED_REFERENCE      text ranges: [(107,119)]
      PSI: KtNameReferenceExpression at (24,5-17)

// It expects ev to be one such event.
func (g *procRangeGenerator) ProcRange(ctx *traceContext, ev *trace.Event) {
	if g.ranges == nil {
		g.ranges = make(map[trace.Range]activeRange)
	}
	r := ev.Range()
	switch ev.Kind() {
	case trace.EventRangeBegin:
		g.ranges[r] = activeRange{ev.Time(), ev.Stack()}
	case trace.EventRangeActive:
		// If we've seen a Sync event, then Active events are always redundant.