*/
    public void setName(final String name) {
        this.name = name;
    }

    /**
     * Sets the maximum number of redirects to follow.
     * @param maxRedirectCount The maximum redirect count.
     */
    public void setMaxRedirectCount(final int maxRedirectCount) {
        this.maxRedirectCount = maxRedirectCount;
    }

            int res = in.readDirect(new byte[1024], 0, 256);
            assertEquals(-1, res);
        }

        @Test
        @DisplayName("LargeReadX splits count across maxCount/openTimeout")
        void largeReadXSetsRequestFields() throws Exception {
            when(mockTree.isSMB2()).thenReturn(false);

        long count = client.prepareSearch(TEST_INDEX)
                .setQuery(QueryBuilders.termQuery("field", "value1"))
                .execute()
                .actionGet()
                .getHits()
                .getTotalHits()
                .value();
        assertEquals(0, count);
    }

    @Test
    public void testDeleteByQueryWithNoMatches() {

| `minio_cluster_health_status`                     | Get current cluster health status              |
| `minio_cluster_health_erasure_set_healing_drives` | Count of healing drives in the erasure set     |
| `minio_cluster_health_erasure_set_online_drives`  | Count of online drives in the erasure set      |
| `minio_cluster_health_erasure_set_read_quorum`    | Get read quorum of the erasure set             |

        when(handle.getPipe()).thenReturn(pipe);
        when(tree.isSMB2()).thenReturn(smb2);
        return new SmbPipeInputStream(handle, tree);
    }

    @Test
    @DisplayName("available() on SMB2 returns peeked byte count and interacts with tree")
    void available_smb2_happyPath() throws Exception {
        // Verify SMB2 path: IOCTL peek result is returned and resources are closed
        SmbPipeInputStream stream = newStreamWithMinimalStubs(true);

		}
		sm.Queued.Avg.Bytes += peer.Queued.Avg.Bytes
		sm.Queued.Avg.Count += peer.Queued.Avg.Count
		sm.Queued.Curr.Bytes += peer.Queued.Curr.Bytes
		sm.Queued.Curr.Count += peer.Queued.Curr.Count
		if peer.Queued.Max.Count > sm.Queued.Max.Count {
			sm.Queued.Max.Bytes = peer.Queued.Max.Bytes
			sm.Queued.Max.Count = peer.Queued.Max.Count
		}
		sm.ReplicaCount += peer.ReplicaCount
		sm.ReplicaSize += peer.ReplicaSize

   *
   * <p><b>Java 8+ users:</b> In most cases, the {@code Stream} equivalent of this method is {@code
   * stream.filter(element::equals).count()}. If {@code element} might be null, use {@code
   * stream.filter(Predicate.isEqual(element)).count()} instead.
   *
   * @see java.util.Collections#frequency(Collection, Object) Collections.frequency(Collection,
   *     Object)
   */

// checkOld can be set to an expected value.
// If the worker count changed
func (p *ReplicationPool) ResizeLrgWorkers(n, checkOld int) {
	p.mu.Lock()
	defer p.mu.Unlock()

	if (checkOld > 0 && len(p.lrgworkers) != checkOld) || n == len(p.lrgworkers) || n < 1 {
		// Either already satisfied or worker count changed while we waited for the lock.
		return
	}
	for len(p.lrgworkers) < n {

    void testGenerateMultipleNoncesNoCollision() {
        // Given
        int count = 10000; // Test with larger number for collision detection
        Set<String> nonceSet = new HashSet<>();

        // When
        for (int i = 0; i < count; i++) {
            byte[] nonce = encryptionContext.generateNonce();
            String nonceHex = bytesToHex(nonce);

        // Update metrics
        totalKeyRotations.incrementAndGet();
        lastKeyRotationTime.set(System.currentTimeMillis());
    }

    /**
     * Get the current key rotation count
     *
     * @return number of times keys have been rotated
     */
    public int getKeyRotationCount() {
        return rotationCount;
    }

    /**
     * Set the key rotation bytes limit