@Test
    public void test_constructorWithThrowableCause_OutOfMemoryError() {
        // Test that constructor accepts Error as cause (verifies Throwable parameter change)
        String url = "http://example.com/large-dataset";
        String message = "Crawling failed due to memory exhaustion";
        OutOfMemoryError error = new OutOfMemoryError("Heap space exhausted");

field, [`Policies`](/pkg/crypto/x509/#Certificate.Policies), which supports
certificate policy OIDs with components larger than 31 bits. By default this
field is only used during parsing, when it is populated with policy OIDs, but
not used during marshaling. It can be used to marshal these larger OIDs, instead
of the existing PolicyIdentifiers field, by using the
[`x509usepolicies` setting](/pkg/crypto/x509/#CreateCertificate).

}

func (k *KMS) updateMetrics(err error, latency time.Duration) {
	// First, update the latency histogram
	// Therefore, find the first bucket that holds the counter for
	// requests with a latency at least as large as the given request
	// latency and update its and all subsequent counters.
	bucket := slices.IndexFunc(k.latencyBuckets, func(b time.Duration) bool { return latency < b })
	if bucket < 0 {

    InputStream in = newTestStream(0);
    byte[] b = ByteStreams.toByteArray(in);
    assertThat(b).isEmpty();
  }

  public void testToByteArray_largeStream() throws IOException {
    // well, large enough to require multiple buffers
    byte[] expected = newPreFilledByteArray(10000000);
    InputStream in = new ByteArrayInputStream(expected);
    byte[] b = ByteStreams.toByteArray(in);

	ANDW	$0x6006000060060, R27, R5                        // ERROR "cannot use REGTMP as source"
	STP	(R3, R4), 0x1234567(R27)                         // ERROR "REGTMP used in large offset store"
	LDP	0x1234567(R27), (R3, R4)                         // ERROR "REGTMP used in large offset load"
	STP	(R26, R27), 700(R2)                              // ERROR "cannot use REGTMP as source"

	if len(b) == 0 {
		return []byte{}
	}

	// Past a certain chunk size it is counterproductive to use
	// larger chunks as the source of the write, as when the source
	// is too large we are basically just thrashing the CPU D-cache.
	// So if the result length is larger than an empirically-found
	// limit (8KB), we stop growing the source string once the limit

        assertThrows(ArrayIndexOutOfBoundsException.class, () -> {
            netServerEnum2.writeParametersWireFormat(dst, 0);
        });
    }

    @Test
    @DisplayName("Test writeParametersWireFormat with large buffer succeeds")
    void testWriteParametersWireFormatLargeBuffer() {
        String domain = "DOMAIN";
        netServerEnum2 = new NetServerEnum2(realConfig, domain, NetServerEnum2.SV_TYPE_ALL);

        // When - initially should not need rotation
        assertFalse(context.needsKeyRotation(), "Should not need rotation initially");

        // Note: We can't directly test the byte limit without encrypting large amounts of data,
        // but we can verify the method exists and returns proper boolean
    }

    @Test
    @DisplayName("Should reset key rotation tracking")
    void testResetKeyRotationTracking() {

   * method is resilient to overflow.
   *
   * @since 14.0
   */
  public static long mean(long x, long y) {
    // Efficient method for computing the arithmetic mean.
    // The alternative (x + y) / 2 fails for large values.
    // The alternative (x + y) >>> 1 fails for negative values.
    return (x & y) + ((x ^ y) >> 1);
  }

  /*
   * This bitmask is used as an optimization for cheaply testing for divisibility by 2, 3, or 5.

        try {
            // Test with extreme status codes
            WebApiUtil.setError(-1, "Negative status code");
            WebApiUtil.setError(0, "Zero status code");
            WebApiUtil.setError(999, "Large status code");

            // Test with very long message
            StringBuilder longMessage = new StringBuilder();
            for (int i = 0; i < 1000; i++) {