if (!iterator.hasNext()) {
      throw new IndexOutOfBoundsException(
          "position ("
              + position
              + ") must be less than the number of elements that remained ("
              + skipped
              + ")");
    }
    return iterator.next();
  }

  /**
   * Advances {@code iterator} {@code position + 1} times, returning the element at the {@code

        // Assert
        assertSame(mocked, ex.getCause(), "Mocked cause should be preserved");
        verifyNoInteractions(mocked);
    }

    // Reflection-based check: ensure serialVersionUID remains the declared constant
    @Test
    @DisplayName("serialVersionUID matches declared constant")
    void serialVersionUID_hasExpectedValue() throws Exception {
        // Arrange

        auth.handle(new Callback[] { nc, pc });

        // With empty strings for username and domain, results in "@"
        assertEquals("@", nc.getName());
        // Password is null, so callback is not set (remains null)
        assertNull(pc.getPassword());
    }

    @Test
    @DisplayName("handle: null password leaves PasswordCallback unset")
    void testHandleWithNullPasswordDoesNotSet() throws Exception {

  Note that the default stored version remained alpha in 1.34, and whoever enabled beta during 1.34 needed to run a storage migration yourself to ensure you don't depend on alpha data in etcd. ([#132821](https://github.com/kubernetes/kubernetes/pull/132821), [@cici37](https://github.com/cici37))...

      if (containsNaN(dataset)) {
        return NaN;
      }

      // Calculate the quotient and remainder in the integer division x = k * (N-1) / q, i.e.
      // index * (dataset.length - 1) / scale. If there is no remainder, we can just find the value
      // whose index in the sorted dataset equals the quotient; if there is a remainder, we
      // interpolate between that and the next value.

    assertThat(UnsignedLongs.remainder(14, 5)).isEqualTo(4);
    assertThat(UnsignedLongs.remainder(0, 50)).isEqualTo(0);
    assertThat(UnsignedLongs.remainder(0xfffffffffffffffeL, 0xfffffffffffffffdL)).isEqualTo(1);
    assertThat(UnsignedLongs.remainder(0xfffffffffffffffdL, 0xfffffffffffffffeL))
        .isEqualTo(0xfffffffffffffffdL);
    assertThat(UnsignedLongs.remainder(0xfffffffffffffffeL, 65535)).isEqualTo(65534L);

        if (length == 0) {
            return "";
        }
        final StringBuilder buffer = new StringBuilder((int) Math.ceil(length / 3d) * 4);
        final int remainder = length % 3;
        length -= remainder;
        int block;
        int i = 0;
        while (i < length) {
            block = (bytes[i++] & 0xff) << 16 | (bytes[i++] & 0xff) << 8 | bytes[i++] & 0xff;

        SmbComTransactionResponse r2 = (SmbComTransactionResponse) d.nextElement();
        assertSame(d, r2, "Subsequent calls still return same instance");
        assertFalse(d.getIsPrimary(), "isPrimary remains false after subsequent call");
    }

    @Test
    public void toString_doesNotThrow() {
        DummyResponse d = new DummyResponse();
        String s = d.toString();

    }

    // returns the minimum x such as x >= a && (x % b) == 0
    private static int ceilToMultiple(int a, int b) {
      int remainder = a % b;
      return remainder == 0 ? a : a + b - remainder;
    }

    void assertBytes(byte[] expected) {
      byte[] got = out.toByteArray();
      for (int i = 0; i < expected.length; i++) {
        assertEquals(expected[i], got[i]);

        Throwable cause = new RuntimeException("root cause");

        // Act
        SMBProtocolDowngradeException ex = new SMBProtocolDowngradeException(null, cause);

        // Assert - null message retained; cause preserved
        assertNull(ex.getMessage());
        assertSame(cause, ex.getCause());
        assertEquals(SMBProtocolDowngradeException.class.getName(), ex.toString());
    }

    @Test