* @param padding an extra amount to "grow" the array by if growth is necessary
   * @throws IllegalArgumentException if {@code minLength} or {@code padding} is negative
   * @return an array containing the values of {@code array}, with guaranteed minimum length {@code
   *     minLength}
   */
  public static float[] ensureCapacity(float[] array, int minLength, int padding) {

   * is not guaranteed to return zero when the dataset consists of the same value multiple times,
   * due to numerical errors. However, it is guaranteed never to return a negative result.
   *
   * <h3>Non-finite values</h3>
   *
   * <p>If the dataset contains any non-finite values ({@link Double#POSITIVE_INFINITY}, {@link

        String result = scoreUpdater.execute();
        // NullPointerException message should be captured
        assertTrue(result.contains("null") || result.contains("NullPointer"));
    }

    // Test with negative priority
    public void test_addScoreBooster_negativePriority() {
        PriorityTrackingBooster booster1 = new PriorityTrackingBooster(-1, 100L);
        PriorityTrackingBooster booster2 = new PriorityTrackingBooster(0, 200L);

        assertEquals("EndOfFileInformation[endOfFile=12345]", str2);
    }

    @Test
    @DisplayName("Test toString with various values")
    void testToStringWithVariousValues() {
        // Test negative value
        FileEndOfFileInformation info1 = new FileEndOfFileInformation(-100L);
        assertEquals("EndOfFileInformation[endOfFile=-100]", info1.toString());

        // Test zero

      int hash2 = (int) (hash64 >>> 32);

      boolean bitsChanged = false;
      for (int i = 1; i <= numHashFunctions; i++) {
        int combinedHash = hash1 + (i * hash2);
        // Flip all the bits if it's negative (guaranteed positive number)
        if (combinedHash < 0) {
          combinedHash = ~combinedHash;
        }
        bitsChanged |= bits.set(combinedHash % bitSize);
      }
      return bitsChanged;
    }

   *     minValue()}
   */
  public abstract @Nullable C previous(C value);

  /**
   * Returns a signed value indicating how many nested invocations of {@link #next} (if positive) or
   * {@link #previous} (if negative) are needed to reach {@code end} starting from {@code start}.
   * For example, if {@code end = next(next(next(start)))}, then {@code distance(start, end) == 3}

		{seek: io.SeekStart, off: 0, n: 20, want: "0123456789"},
		{seek: io.SeekStart, off: 1, n: 1, want: "1"},
		{seek: io.SeekCurrent, off: 1, wantpos: 3, n: 2, want: "34"},
		{seek: io.SeekStart, off: -1, seekerr: "bytes.Reader.Seek: negative position"},
		{seek: io.SeekStart, off: 1 << 33, wantpos: 1 << 33, readerr: io.EOF},
		{seek: io.SeekCurrent, off: 1, wantpos: 1<<33 + 1, readerr: io.EOF},
		{seek: io.SeekStart, n: 5, want: "01234"},

    /**
     * Bind packet type - establishes context
     */
    int RPC_PT_BIND = 0x0B;
    /**
     * Bind acknowledgment packet type
     */
    int RPC_PT_BIND_ACK = 0x0C;
    /**
     * Bind negative acknowledgment packet type
     */
    int RPC_PT_BIND_NAK = 0x0D;
    /**
     * Alter context packet type
     */
    int RPC_PT_ALTER_CONTEXT = 0x0E;
    /**
     * Alter context response packet type

    try {
      long remainingNanos = unit.toNanos(timeout);
      long end = System.nanoTime() + remainingNanos;

      while (true) {
        try {
          // TimeUnit.timedJoin() treats negative timeouts just like zero.
          NANOSECONDS.timedJoin(thread, remainingNanos);
          return;
        } catch (InterruptedException e) {
          interrupted = true;

///

{* ../../docs_src/extra_models/tutorial003.py hl[1,14:15,18:20,33] *}

### `Union` no Python 3.10

Neste exemplo, passamos `Union[PlaneItem, CarItem]` como o valor do argumento `response_model`.