// Simulate setting info using reflection
        SmbInfoAllocation allocation = new SmbInfoAllocation();
        setInfoField(response, allocation);

        SmbInfoAllocation result = response.getInfo(SmbInfoAllocation.class);
        assertNotNull(result);
        assertSame(allocation, result);
    }

    @Test
    void testGetInfoWithClass_Incompatible() throws Exception {

        }

        // Check total memory allocation
        long totalSize = (long) size * (long) elementSize;
        long maxAllocation = 100 * 1024 * 1024; // 100MB max

        if (totalSize > maxAllocation) {
            failedValidations.incrementAndGet();
            log.warn("Array allocation too large: {} bytes", totalSize);
            throw new SmbException("Array allocation exceeds limit");
        }
    }

            buffer.order(ByteOrder.LITTLE_ENDIAN);
            buffer.putLong(1048576L); // Total allocation units (1M)
            buffer.putLong(524288L); // Caller available allocation units (512K)
            buffer.putLong(524288L); // Actual free allocation units (512K)
            buffer.putInt(8); // Sectors per allocation unit
            buffer.putInt(512); // Bytes per sector
            byte[] bufferArray = buffer.array();

            ByteBuffer buffer = ByteBuffer.allocate(24);
            buffer.order(ByteOrder.LITTLE_ENDIAN);
            buffer.putLong(1048576L); // Total allocation units (1M)
            buffer.putLong(524288L); // Free allocation units (512K)
            buffer.putInt(8); // Sectors per allocation unit
            buffer.putInt(512); // Bytes per sector
            byte[] bufferArray = buffer.array();

            // When

        double avgAllocTimeNs = totalAllocTime.get() / (double) allocations.get();
        double avgReleaseTimeNs = totalReleaseTime.get() / (double) releases.get();

        System.out.printf("Buffer Cache Performance: %d allocs, %d releases in %.2f ms%n", allocations.get(), releases.get(),
                overallTimeMs);
        System.out.printf("  Avg allocation time: %.2f ns%n", avgAllocTimeNs);

	}
}

// Buffer controls memory allocation by the Scanner.
// It sets the initial buffer to use when scanning
// and the maximum size of buffer that may be allocated during scanning.
// The contents of the buffer are ignored.
//
// The maximum token size must be less than the larger of max and cap(buf).
// If max <= cap(buf), [Scanner.Scan] will use this buffer only and do no allocation.
//

        if (log.isDebugEnabled() && holder.allocationStackTrace != null) {
            StringBuilder sb = new StringBuilder("Allocation stack trace:\n");
            for (StackTraceElement element : holder.allocationStackTrace) {
                sb.append("\tat ").append(element).append("\n");
            }
            log.debug(sb.toString());

        LockFreeBitArray lockFreeBitArray = (LockFreeBitArray) o;
        // TODO(lowasser): avoid allocation here
        return Arrays.equals(toPlainArray(data), toPlainArray(lockFreeBitArray.data));
      }
      return false;
    }

    @Override
    public int hashCode() {
      // TODO(lowasser): avoid allocation here
      return Arrays.hashCode(toPlainArray(data));
    }
  }

   * `allocations.size() < allocationLimit` then new streams can be created on this connection.
   */
  internal var allocationLimit = 1
    private set

  /** Current calls carried by this connection. */
  val calls = mutableListOf<Reference<RealCall>>()

  /** Timestamp when `allocations.size()` reached zero. Also assigned upon initial connection. */

- **Sequenced Collections** - Full support for Java 21 sequenced collections API with dedicated utility methods
- **Performance Focused** - Optimized implementations for better runtime performance with reduced memory allocation
- **Type Safe** - Comprehensive use of generics and modern Java type system features

### Additional Components