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])'

        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

@GwtIncompatible // TreeRangeSet
public abstract class AbstractRangeSetTest extends TestCase {
  public static void testInvariants(RangeSet<?> rangeSet) {
    testInvariantsInternal(rangeSet);
    testInvariantsInternal(rangeSet.complement());
  }

  private static <C extends Comparable<?>> void testInvariantsInternal(RangeSet<C> rangeSet) {
    assertEquals(rangeSet.asRanges().isEmpty(), rangeSet.isEmpty());

Although the [Tutorial - User Guide](../tutorial/index.md){.internal-link target=_blank} and this **Advanced User Guide** are written as a guided tutorial (like a book) and should be enough for you to **learn FastAPI**, you might want to complement it with additional courses.

Or it might be the case that you just prefer to take other courses because they adapt better to your learning style.

//
// If operating in binary mode, this assumes strict GNU binary mode; which means
// that the first byte can only be either 0x80 or 0xff. Thus, the first byte is
// equivalent to the sign bit in two's complement form.
func fitsInBase256(n int, x int64) bool {
	binBits := uint(n-1) * 8
	return n >= 9 || (x >= -1<<binBits && x < 1<<binBits)
}

// parseNumeric parses the input as being encoded in either base-256 or octal.

// This pattern checks if an i8 arith::ConstantOp tensor has all values within
// the INT4 range, i.e. [-8,7] and converts it into i4 if so. This assumes that
// the input is sign-extended two's complement.
class CheckRangeAndConvertI8ToI4 : public OpRewritePattern<arith::ConstantOp> {
 public:
  using OpRewritePattern<arith::ConstantOp>::OpRewritePattern;

  LogicalResult matchAndRewrite(arith::ConstantOp op,

//   encoding: Positive values x are written as 2*x + 0, negative values
//   are written as 2*(^x) + 1; that is, negative numbers are complemented
//   and whether to complement is encoded in bit 0.
//
// Design note:
// At most 10 bytes are needed for 64-bit values. The encoding could
// be more dense: a full 64-bit value needs an extra byte just to hold bit 63.

[[sec:preferred-version]]
`prefer`::
This is a very soft version declaration.
It applies only if there is no stronger non dynamic opinion on a version for the module.
This term does not support dynamic versions.
+
Definition can complement `strictly` or `require`.
+
When defined, this overrides any previous `prefer` declaration and clears previous `reject`.

There is also an additional term outside of the level hierarchy:

[[sec:rejected-version]]