}

	// Fetch buffer for I/O, returns from the pool if not allocates a new one and returns.
	var buffer []byte
	switch size := data.Size(); {
	case size == 0:
		buffer = make([]byte, 1) // Allocate at least a byte to reach EOF
	case size >= fi.Erasure.BlockSize || size == -1:
		if int64(globalBytePoolCap.Load().Width()) < fi.Erasure.BlockSize {
			buffer = make([]byte, fi.Erasure.BlockSize, 2*fi.Erasure.BlockSize)

        }

        public void setTestResponse(TestServerMessageBlock2Response response) {
            this.testResponse = response;
        }

        public void setTestSize(int size) {
            this.testSize = size;
        }

        public void setTestLength(int length) {
            this.testEncodedLength = length;
        }

        @Override

        listen  [::]:9000;
        server_name  localhost;

        # To allow special characters in headers
        ignore_invalid_headers off;
        # Allow any size file to be uploaded.
        # Set to a value such as 1000m; to restrict file size to a specific value
        client_max_body_size 0;
        # To disable buffering
        proxy_buffering off;
        proxy_request_buffering off;

        location / {

    }

    @Test
    @DisplayName("Test size calculation")
    void testSize() {
        // Given
        Smb2CancelRequest request = new Smb2CancelRequest(mockConfig, 1L, 0L);

        // When
        int size = request.size();

        // Then
        // Size should be aligned to 8 bytes: SMB2_HEADER_LENGTH + 4 bytes for cancel structure

            assertEquals(2, merged.processedPoms().size(), "Should merge all processed POMs");
            assertEquals(1, merged.modifiedPoms().size(), "Should only include successfully modified POMs");
            assertEquals(1, merged.errorPoms().size(), "Should include error POMs");
            assertTrue(merged.errorPoms().contains(pom2), "Should contain failed POM");
        }

  }

  private static <K, V> ImmutableMap<K, V> fromEntryList(
      boolean throwIfDuplicateKeys, Collection<? extends Entry<? extends K, ? extends V>> entries) {
    int size = entries.size();
    switch (size) {
      case 0:
        return of();
      case 1:
        Entry<? extends K, ? extends V> entry = getOnlyElement(entries);
        return of((K) entry.getKey(), (V) entry.getValue());

        searchBody.put("size", 100);
        searchBody.put("q", NAME_PREFIX + "*");

        String response = checkMethodBase(searchBody).get(SEARCHLIST_API_PATH + "/docs").asString();
        List<Map<String, Object>> docs = JsonPath.from(response).getList("response.docs");

        logger.info("Created documents: {}", docs);
        assertEquals(5, docs.size(), "Should have created 5 documents");

        count,
        getMultiset().count(element));

    int size = 0;
    for (Multiset.Entry<E> entry : getMultiset().entrySet()) {
      size += entry.getCount();
    }
    assertEquals(
        "multiset.size() should be the sum of the counts of all entries",
        size,
        getMultiset().size());
  }

  /** Call the {@code setCount()} method under test, and check its return value. */

  }

  public void test() {
    for (int groupNumber = 0; groupNumber < groups.size(); groupNumber++) {
      ImmutableList<T> group = groups.get(groupNumber);
      for (int itemNumber = 0; itemNumber < group.size(); itemNumber++) {
        // check related items in same group
        for (int relatedItemNumber = 0; relatedItemNumber < group.size(); relatedItemNumber++) {
          if (itemNumber != relatedItemNumber) {

     * @return estimated compression ratio (0.0 to 1.0, where 0.5 means 50% size reduction)
     */
    double estimateCompressionRatio(byte[] data, int algorithm);

    /**
     * Gets the minimum data size threshold for compression.
     * Data smaller than this threshold should not be compressed.
     *
     * @return minimum size in bytes for compression to be beneficial
     */
    int getMinCompressionSize();