continue
		}
		// for participating pools, total bytes to be rebalanced by this pool is given by,
		// pf_c = (f_i + x)/c_i,
		// pf_c - percentage free space across pools, f_i - ith pool's free space, c_i - ith pool's capacity
		// i.e. x = c_i*pfc -f_i
		totalBytesToRebal := float64(ps.InitCapacity)*meta.PercentFreeGoal - float64(ps.InitFreeSpace)
		elapsed := time.Since(ps.Info.StartTime)

            assertEquals(8L * 4096L * 512L, smbInfoAllocation.getCapacity());
            assertEquals(8L * 2048L * 512L, smbInfoAllocation.getFree());
        }

        @Test
        @DisplayName("Should calculate capacity correctly")
        void testCapacityCalculation() throws SMBProtocolDecodingException {
            byte[] buffer = new byte[24];
            buffer[4] = 0x04; // sectPerAlloc = 4
            buffer[8] = 0x00;

type rebalanceStats struct {
	InitFreeSpace uint64 `json:"initFreeSpace" msg:"ifs"` // Pool free space at the start of rebalance
	InitCapacity  uint64 `json:"initCapacity" msg:"ic"`   // Pool capacity at the start of rebalance

	Buckets           []string      `json:"buckets" msg:"bus"`           // buckets being rebalanced or to be rebalanced

        public String key;
        /** Number of buffers */
        public long count;
        /** Used memory in bytes */
        public long used;
        /** Total capacity in bytes */
        public long capacity;
    }

    /**
     * Data transfer object representing JVM garbage collection statistics.
     */
    public static class JvmGcObj {
        /**
         * Default constructor.

            assertEquals(2500L * 16 * 1024, fileFsSizeInfo.getFree());
        }
    }

    @Nested
    @DisplayName("Capacity and Free Space Calculation Tests")
    class CapacityCalculationTests {

        @Test
        @DisplayName("Should calculate capacity correctly")
        void shouldCalculateCapacityCorrectly() throws SMBProtocolDecodingException {
            // Given
            long alloc = 1024L;

// There is no minimum size.
var GetByteBuffer = func() []byte {
	b := *internalByteBuffer.Get()
	return b[:0]
}

// GetByteBufferCap returns a length 0 byte buffer with at least the given capacity.
func GetByteBufferCap(wantSz int) []byte {
	if wantSz < defaultBufferSize {
		b := GetByteBuffer()[:0]
		if cap(b) >= wantSz {
			return b
		}
		PutByteBuffer(b)
	}
	if wantSz <= maxBufferSize {

        while (i.hasNext()) {
          val asyncCall = i.next()

          if (runningAsyncCalls.size >= this.maxRequests) break // Max capacity.
          if (asyncCall.callsPerHost.get() >= this.maxRequestsPerHost) continue // Host max capacity.

          i.remove()

          asyncCall.callsPerHost.incrementAndGet()
          callsToExecute.add(asyncCall)
          runningAsyncCalls.add(asyncCall)

  /**
   * Creates a {@code CompactLinkedHashMap} instance, with a high enough "initial capacity" that it
   * <i>should</i> hold {@code expectedSize} elements without rebuilding internal data structures.
   *
   * @param expectedSize the number of elements you expect to add to the returned set
   * @return a new, empty {@code CompactLinkedHashMap} with enough capacity to hold {@code
   *     expectedSize} elements without resizing

  }

  /**
   * Creates a {@code CompactHashMap} instance, with a high enough "initial capacity" that it
   * <i>should</i> hold {@code expectedSize} elements without growth.
   *
   * @param expectedSize the number of elements you expect to add to the returned set
   * @return a new, empty {@code CompactHashMap} with enough capacity to hold {@code expectedSize}
   *     elements without resizing

    stopwatch.sleepMillis(1000); // max capacity reached
    stopwatch.sleepMillis(1000); // this makes no difference
    limiter.acquire(1); // R0.00, since it's the first request

    limiter.acquire(1); // R0.00, from capacity
    limiter.acquire(3); // R0.00, from capacity
    limiter.acquire(1); // R0.00, concluding a burst of 5 permits

    limiter.acquire(); // R0.20, capacity exhausted
    assertEvents(