exit_1() {
	cleanup

	echo "minio1 ============"
	cat /tmp/minio1_1.log
	echo "minio2 ============"
	cat /tmp/minio2_1.log

	exit 1
}

cleanup() {
	echo -n "Cleaning up instances of MinIO ..."
	pkill -9 minio || sudo pkill -9 minio
	rm -rf /tmp/minio{1,2}
	echo "done"
}

# Function to convert number to corresponding alphabet
num_to_alpha() {
	local num=$1

            // Create a buffer with sample data
            byte[] buffer = new byte[100];
            // Fill with some test data
            for (int i = 0; i < buffer.length; i++) {
                buffer[i] = (byte) (i % 256);
            }

            int result = resp.readDataWireFormat(buffer, 0, 40);

    }

    /**
     * Test that buffer cache handles allocation when cache is full.
     */
    @Test
    public void testBufferAllocationWhenCacheFull() {
        // Given - Allocate many buffers to potentially fill the cache
        List<byte[]> buffers = new ArrayList<>();

        // Allocate more buffers than cache can hold
        for (int i = 0; i < 20; i++) {
            byte[] buffer = BufferCache.getBuffer();

        rDataLengthField.setAccessible(true);
        rDataLengthField.set(response, dataLength);

        // Number of names
        src[srcIndex] = (byte) numNames;

        // Fill in name entries
        for (int i = 0; i < numNames; i++) {
            String name = String.format("NAME%02d          ", i).substring(0, 16);

 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *

      distinctElements++;
    } else if (oldCount > 0 && count == 0) {
      distinctElements--;
    }
    return oldCount;
  }

  @Override
  public void clear() {
    Arrays.fill(counts, 0);
    size = 0;
    distinctElements = 0;
  }

  abstract class Itr<T> implements Iterator<T> {
    int index = 0;
    int toRemove = -1;

    abstract T output(int index);

      FakeTicker ticker,
      String keyPrefix,
      long ttl) {
    loader.setKeyPrefix(keyPrefix);

    int shift1 = 10 + VALUE_PREFIX;
    loader.setValuePrefix(shift1);
    // fill with initial data
    for (int i = 0; i < 10; i++) {
      assertThat(cache.getUnchecked(keyPrefix + i)).isEqualTo(i + shift1);
    }
    assertThat(CacheTesting.expirationQueueSize(cache)).isEqualTo(10);

      delegate.clear(); // invalidate any iterators left over!
      table = null;
      size = 0;
    } else {
      Arrays.fill(requireKeys(), 0, size, null);
      Arrays.fill(requireValues(), 0, size, null);
      CompactHashing.tableClear(requireTable());
      Arrays.fill(requireEntries(), 0, size, 0);
      this.size = 0;
    }
  }

  @J2ktIncompatible

    @DisplayName("Release stores buffer for reuse and zeroes its contents")
    void releaseStoresAndZeroesBuffer() {
        BufferCacheImpl impl = new BufferCacheImpl(2, 10);

        byte[] b = new byte[10];
        // Fill with non-zero to verify zeroing on release
        for (int i = 0; i < b.length; i++) {
            b[i] = (byte) (i + 1);
        }

        // Act: release should zero immediately to avoid leaks

        These advantages can take
        [many forms](https://github.com/google/guava/wiki/PhilosophyExplained#utility), but taking
        the time to discuss them in detail will make it much clearer why this feature should be
        added to Guava.


        Please fill out the following fields to give us a better understanding of your proposed
        feature and its potential value for other Guava users.

  - type: textarea
    attributes: