*/
  public void testBuilder_bruteForce() {
    for (int i = 0; i < reduceIterationsIfGwt(100); i++) {
      ImmutableDoubleArray.Builder builder = ImmutableDoubleArray.builder(random.nextInt(20));
      AtomicInteger counter = new AtomicInteger(0);
      while (counter.get() < 1000) {
        BuilderOp op = BuilderOp.randomOp();
        op.doIt(builder, counter);
      }

		}
	}

	testCasesFailure := []struct {
		totalSize int64
		partSize  int64
		partIndex int
		err       error
	}{
		// partSize is 0, returns error.
		{10, 0, 1, errPartSizeZero},
		// partIndex is 0, returns error.
		{10, 1, 0, errPartSizeIndex},
		// Total size is -1, returns error.
		{-2, 10, 1, errInvalidArgument},
	}

            final DocumentBuilder builder = factory.newDocumentBuilder();

            final Document doc = builder.parse(is);

            final StringBuilder buf = new StringBuilder(1000);
            buf.append(getResultDataHeader());
            for (final Map.Entry<String, String> entry : fieldRuleMap.entrySet()) {
                final List<String> nodeStrList = new ArrayList<>();
                try {

     * The maximum amount of time after the client calls [close] to wait for a graceful shutdown. If
     * the server doesn't respond the web socket will be canceled.
     */
    const val CANCEL_AFTER_CLOSE_MILLIS = 60L * 1000

    /**
     * The smallest message that will be compressed. We use 1024 because smaller messages already
     * fit comfortably within a single ethernet packet (1500 bytes) even with framing overhead.
     *

    testRotate(new int[] {1, 2, 3, 4, 5}, 6, new int[] {5, 1, 2, 3, 4});
  }

  public void testRotateIndexed() {
    testRotate(new int[] {}, 0, 0, 0, new int[] {});

    testRotate(new int[] {1}, 0, 0, 1, new int[] {1});
    testRotate(new int[] {1}, 1, 0, 1, new int[] {1});
    testRotate(new int[] {1}, 1, 1, 1, new int[] {1});

    // Rotate the central 5 elements, leaving the ends as-is

                log.warn("Connection attempt {} failed: {}", attempt, e.getMessage());

                if (attempt < maxRetries) {
                    // Wait before retry
                    Thread.sleep(1000 * attempt);
                    // Create fresh context for retry
                    listContext = createFreshContext();
                } else {
                    // Final attempt failed

        val chainB = chainA.withConnectTimeout(100, TimeUnit.MILLISECONDS)
        assertThat(chainB.connectTimeoutMillis()).isEqualTo(100)
        chainB.proceed(chainA.request())
      }
    val interceptor2 =
      Interceptor { chain: Interceptor.Chain ->
        assertThat(chain.connectTimeoutMillis()).isEqualTo(100)
        chain.proceed(chain.request())
      }
    client =
      client

        saltBuffer.order(java.nio.ByteOrder.LITTLE_ENDIAN);
        saltBuffer.putInt(rotationCount); // Rotation counter
        saltBuffer.putInt((int) (System.currentTimeMillis() / 1000)); // Timestamp for additional uniqueness

        // Derive new keys using SMB3 KDF with rotation-specific input
        final int dialectInt = dialect.getDialect();

        suggester.refresh();

        long oldWordsCount = suggester.getAllWordsNum();
        assertTrue(oldWordsCount > 0);

        // Minimal sleep to ensure timestamp separation (reduced from 2000ms to 100ms total)
        Thread.sleep(50);
        ZonedDateTime threshold = ZonedDateTime.now();
        Thread.sleep(50);

        // Index new data after threshold
        document = new HashMap<>();

                break;
        }
    }
}
```

## 10. Performance Considerations

### 10.1 Handle Caching Strategy
```java
public class HandleCache {
    private final int maxHandles = 1000;
    private final LinkedHashMap<String, HandleInfo> lruCache;
    
    public HandleCache() {
        this.lruCache = new LinkedHashMap<String, HandleInfo>(maxHandles, 0.75f, true) {
            @Override