int x = 1 << exponent;
      intValues.add(x, x + 1, x - 1);
    }
    intValues.add(9999).add(10000).add(10001).add(1000000); // near powers of 10
    intValues.add(5792).add(5793); // sqrt(2^25) rounded up and down
    POSITIVE_INTEGER_CANDIDATES = intValues.build();
    NEGATIVE_INTEGER_CANDIDATES =
        ImmutableList.copyOf(
            Iterables.concat(

    toList.remove(0);
    assertEquals(asList(5, 9, 3), fromList);
    toList.add(7);
    assertEquals(asList(7, 5, 9, 3), fromList);
    toList.add(5);
    assertEquals(asList(5, 7, 5, 9, 3), fromList);
    toList.remove(Integer.valueOf(5));
    assertEquals(asList(5, 7, 9, 3), fromList);
    toList.set(1, 8);
    assertEquals(asList(5, 7, 8, 3), fromList);
    toList.clear();

* 👷 Refactor CI artifact upload/download for docs previews. PR [#5793](https://github.com/tiangolo/fastapi/pull/5793) by [@tiangolo](https://github.com/tiangolo).

  // TODO: Must not begin with a combining mark.
  // TODO: Each character must be 'valid' or 'deviation'. Not mapped.
  // TODO: CheckJoiners from IDNA 2008
  // TODO: CheckBidi from IDNA 2008, RFC 5893, Section 2.

  return Punycode.encode(decoded)

    X777,
    X778,
    X779,
    X780,
    X781,
    X782,
    X783,
    X784,
    X785,
    X786,
    X787,
    X788,
    X789,
    X790,
    X791,
    X792,
    X793,
    X794,
    X795,
    X796,
    X797,
    X798,
    X799,
    X800,
    X801,
    X802,
    X803,
    X804,
    X805,
    X806,
    X807,
    X808,
    X809,

x788, x789 = bits.Add64(x779, x776, uint64(p521Uint1(x787))) var x790 uint64 var x791 uint64 x790, x791 = bits.Add64(x777, x774, uint64(p521Uint1(x789))) var x792 uint64 var x793 uint64 x792, x793 = bits.Add64(x775, x772, uint64(p521Uint1(x791))) var x794 uint64 var x795 uint64 x794, x795 = bits.Add64(x773, x770, uint64(p521Uint1(x793))) var x796 uint64 var x797 uint64 x796, x797 = bits.Add64(x771, x768, uint64(p521Uint1(x795))) var x798 uint64 var x799 uint64 x798, x799 = bits.Add64(x769, x766, uint...