rangeSet.add(range);

      TreeRangeSet<Integer> complement = TreeRangeSet.create();
      complement.add(Range.<Integer>all());
      complement.remove(range);

      assertEquals(complement, rangeSet.complement());
      assertThat(rangeSet.complement().asRanges())
          .containsExactlyElementsIn(complement.asRanges())
          .inOrder();
    }
  }

    }
  }

  @Override
  public ImmutableRangeSet<C> complement() {
    ImmutableRangeSet<C> result = complement;
    if (result != null) {
      return result;
    } else if (ranges.isEmpty()) {
      return complement = all();
    } else if (ranges.size() == 1 && ranges.get(0).equals(Range.all())) {
      return complement = of();
    } else {

        e.rejectedSelector instanceof InverseVersionSelector
        e.rejectedSelector.selector == complement
        !e.rejectAll

        where:
        strictVersion    | complement
        '1.0'            | '!(1.0)'
        '[1.0, 2.0]'     | '!([1.0, 2.0])'
        '[1.0, 2.0)'     | '!([1.0, 2.0))'
        '(, 2.0)'        | '!((, 2.0))'
        '(, 2.0]'        | '!((, 2.0])'

    } else {
      rangesByLowerBound.put(range.lowerBound, range);
    }
  }

  @LazyInit @CheckForNull private transient RangeSet<C> complement;

  @Override
  public RangeSet<C> complement() {
    RangeSet<C> result = complement;
    return (result == null) ? complement = new Complement() : result;
  }

  @VisibleForTesting
  static final class RangesByUpperBound<C extends Comparable<?>>

    } else {
      rangesByLowerBound.put(range.lowerBound, range);
    }
  }

  @LazyInit @CheckForNull private transient RangeSet<C> complement;

  @Override
  public RangeSet<C> complement() {
    RangeSet<C> result = complement;
    return (result == null) ? complement = new Complement() : result;
  }

  @VisibleForTesting
  static final class RangesByUpperBound<C extends Comparable<?>>

const MaxInt512 = (1<<256 - 1) * (1<<256 + 1)
const _ = MaxInt512 + 1  // ERROR "constant addition overflow"
const _ = MaxInt512 ^ -1 // ERROR "constant bitwise XOR overflow"

    }
  }

  @Override
  public ImmutableRangeSet<C> complement() {
    ImmutableRangeSet<C> result = complement;
    if (result != null) {
      return result;
    } else if (ranges.isEmpty()) {
      return complement = all();
    } else if (ranges.size() == 1 && ranges.get(0).equals(Range.all())) {
      return complement = of();
    } else {

        when:
        def reject = matcher.complementForRejection(normal)

        then:
        reject instanceof InverseVersionSelector
        reject.selector == complement

        where:
        selector         | complement
        '20'             | '!(20)'
        '[3,10]'         | '!([3,10])'
        '(,10)'          | '!((,10))'
        'latest.release' | '!(latest.release)'

    /**
     * Creates another version selector which complements the provided one, but also makes sense to use
     * in a rejection rule. It will therefore fail when computing a complement for this use case doesn't
     * make sense.
     * @param selector the selector to create a complement for
     * @return a selector that complements the provided one and can be used in a reject rule
     */
    VersionSelector complementForRejection(VersionSelector selector);

	_ = byte /* ERROR "overflows byte" */ (0) - byte(1)
	_ = ~ /* ERROR "cannot use ~ outside of interface or type constraint (use ^ for bitwise complement)" */ byte(0)

	// int
	i0 = 1
	i1 int = i0
	i2 = +1
	i3 = +i0
	i4 int = +1
	i5 int = +i4
	i6 = -1
	i7 = -i0
	i8 int = -1
	i9 int = -i4
	i10 = !i0 /* ERROR "not defined" */
	i11 = ^1