before a garbage collection delays that cycle. Less frequent cycles means
the CPU cost of the garbage collector is incurred less frequently.

This functionality in this package is mostly captured in the Arena type.
Arenas allocate large chunks of memory for Go values, so they're likely to
be inefficient for allocating only small amounts of small Go values. They're
best used in bulk, on the order of MiB of memory allocated on each use.

		}
		if stringsHasPrefixFold(key, ReservedMetadataPrefix) {
			return true
		}
	}
	return false
}

// isHTTPHeaderSizeTooLarge returns true if the provided
// header is larger than 8 KB or the user-defined metadata
// is larger than 2 KB.
func isHTTPHeaderSizeTooLarge(header http.Header) bool {
	var size, usersize int
	for key := range header {
		length := len(key) + len(header.Get(key))
		size += length

    @ValueSource(ints = { 1, 10, 100, 500, 1024 })
    void testReadDataWireFormatWithVariousSizes(int dataSize) throws SMBProtocolDecodingException {
        if (dataSize > outputBuffer.length) {
            return; // Skip sizes larger than buffer
        }

        byte[] sourceData = new byte[dataSize];
        for (int i = 0; i < dataSize; i++) {
            sourceData[i] = (byte) (i % 256);
        }

var errSignatureMismatch = errors.New("Signature does not match")

// When upload object size is greater than 5G in a single PUT/POST operation.
var errDataTooLarge = errors.New("Object size larger than allowed limit")

// When upload object size is less than what was expected.
var errDataTooSmall = errors.New("Object size smaller than expected")

// errServerNotInitialized - server not initialized.

   * range [0, k) and ignore the remaining elements.
   */
  private final @Nullable T[] buffer;
  private int bufferSize;

  /**
   * The largest of the lowest k elements we've seen so far relative to this comparator. If
   * bufferSize ≥ k, then we can ignore any elements greater than this value.
   */
  private @Nullable T threshold;

</p>

<p>
Reads of memory locations larger than a single machine word
are encouraged but not required to meet the same semantics
as word-sized memory locations,
observing a single allowed write <i>w</i>.
For performance reasons,
implementations may instead treat larger operations
as a set of individual machine-word-sized operations
in an unspecified order.

    } else if (table instanceof short[]) {
      ((short[]) table)[index] = (short) entry; // unsigned write
    } else {
      ((int[]) table)[index] = entry;
    }
  }

  /**
   * Returns a larger power of 2 hashtable size given the current mask.
   *
   * <p>For hashtable sizes less than or equal to 32, the returned power of 2 is 4x the current

        // Should return uncompressed data for small inputs
        assertArrayEquals(smallData, compressed);
    }

    @Test
    @DisplayName("Test large data compression")
    public void testLargeDataCompression() throws CIFSException {
        byte[] compressed = compressionService.compress(largeTestData, CompressionService.COMPRESSION_LZ77);

        .addEqualityGroup(isNull)
        .addEqualityGroup(Equivalence.identity().equivalentTo("1"))
        .testEquals();
  }

  /*
   * We use large numbers to avoid the integer cache. Normally, we'd accomplish that merely by using
   * `new Integer` (as we do) instead of `Integer.valueOf`. However, under J2KT, `new Integer`

        assertNotNull(suggestItem.getRoles());
    }

    @Test
    public void testToSuggestItemWithLargeBoost() {
        // Test toSuggestItem with large boost value
        String word = "large boost";
        float boost = Float.MAX_VALUE;
        List<String> readings = Arrays.asList("reading1");
        List<String> fields = Arrays.asList("field1");