// Starting with an 8k buffer, double the size of each successive buffer. Smaller buffers
    // quadruple in size until they reach 8k, to minimize the number of small reads for longer
    // streams. Buffers are retained in a deque so that there's no copying between buffers while
    // reading and so all of the bytes in each new allocated buffer are available for reading from
    // the stream.
    for (int bufSize = initialBufferSize;

    }
  }

  /**
   * Records the provided object in {@link #methodArgument} and sets {@link #methodCalled}. This
   * method is called reflectively by Subscriber during tests, and must remain public.
   *
   * @param arg argument to record.
   */
  @Subscribe
  public void recordingMethod(Object arg) {
    assertFalse(methodCalled);
    methodCalled = true;
    methodArgument = arg;
  }

        assertThat(graph.removeNode(nodeList.get(i))).isTrue();
      }

      assertThat(graph.nodes()).isEmpty();
      assertThat(graph.edges()).isEmpty(); // no edges can remain if there's no nodes
      AbstractGraphTest.validateGraph(graph);

      Collections.shuffle(nodeList, gen);
      for (Integer node : nodeList) {
        assertThat(graph.addNode(node)).isTrue();
      }

            final int idx = i;
            assertEquals(expected[i], dst[offset + i], () -> "byte index " + idx);
        }
        // The region before offset and after the payload must remain untouched.
        for (int i = 0; i < offset; i++) {
            final int idx = i;
            assertEquals(0, dst[i], () -> "pre-offset byte " + idx + " modified");
        }

        assertEquals("success", result, "Operation should return correct result");
        assertEquals(State.CLOSED, circuitBreaker.getState(), "State should remain CLOSED");
        assertEquals(0, circuitBreaker.getFailureCount(), "Failure count should remain 0");
    }

    @Test
    public void testFailureThresholdOpensCircuit() {
        // Fail 3 times to open circuit
        for (int i = 0; i < 3; i++) {

	if [[ $? -eq 0 ]]; then
		echo "Outputs are consistent."
		break
	fi

	remaining_attempts=$((max_wait_attempts - attempt))
	if ((attempt >= max_wait_attempts)); then
		echo "Outputs remain inconsistent after $max_wait_attempts attempts. Exiting with error."
		exit 1
	else
		echo "Outputs are inconsistent. Waiting for $wait_interval seconds (attempt $attempt/$max_wait_attempts)."
		sleep $wait_interval
	fi

    )

    @Throws(IOException::class)
    fun nextPart(): Part? {
      check(!closed) { "closed" }

      if (noMoreParts) return null

      // Read a boundary, skipping the remainder of the preceding part as necessary.
      if (partCount == 0 && source.rangeEquals(0L, dashDashBoundary)) {
        // This is the first part. Consume "--" followed by the boundary.

    void lookup_returns_empty_for_unknown_codes(int unknownCode) {
        // Invalid inputs: codes not present should yield no message
        // Guard to ensure test remains valid if constants change in future
        for (int c : WinError.WINERR_CODES) {
            assertNotEquals(unknownCode, c, "Chosen unknown code unexpectedly clashes with a known code");
        }

        Smb2LeaseKey key = new Smb2LeaseKey(originalBytes);
        byte[] retrievedKey = key.getKey();

        // Modify the retrieved key
        retrievedKey[0] = (byte) 0xFF;

        // Original key should remain unchanged
        assertEquals(0x01, key.getKey()[0]);
    }

    @Test
    @DisplayName("Should create readable string representation")
    void testToString() {

        assertEquals(8, result);
        assertEquals(3, response.getNumEntries());
        assertFalse(response.isEndOfSearch());
        assertEquals(0, response.getSid()); // sid should remain 0
    }