RdmaProvider provider = RdmaProviderFactory.selectBestProvider();

        try (RdmaBufferManager bufferManager = new RdmaBufferManager(provider)) {
            // Test basic buffer allocation
            RdmaMemoryRegion sendRegion = bufferManager.getSendRegion(4096);
            assertNotNull(sendRegion, "Send region should not be null");

     * The total length of this DCERPC message
     */
    protected int length = 0;
    /**
     * The call ID for matching requests and responses
     */
    protected int call_id = 0;
    /**
     * The allocation hint for buffer sizing
     */
    protected int alloc_hint = 0;
    /**
     * The result code of the DCERPC operation
     */
    protected int result = 0;

    /**

- **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

        void testDecodeSkipsActualFreeUnits() throws SMBProtocolDecodingException {
            byte[] buffer = new byte[32];
            // total allocation units (8 bytes)
            buffer[4] = 0x01;
            // caller available allocation units (8 bytes)
            buffer[12] = 0x01;
            // actual free units (8 bytes) - should be skipped
            buffer[20] = (byte) 0xFF;

    /*
     * TODO: cpovirk - Pre-size the HashMap based on the number of enum values? (But *not* based on
     * the number of entries in the map, as that makes it easy for hostile inputs to trigger lots of
     * allocation—not that any program should be deserializing hostile inputs to begin with!)
     */
    setDelegates(new EnumMap<>(keyTypeOrObjectUnderJ2cl), new HashMap<>());
    Serialization.populateMap(this, stream);
  }

 *   <li>Can be streamed without "breaking the chain": {@code foo.getBarInts().stream()...}.
 *   <li>Access to all collection-based utilities via {@link #asList} (though at the cost of
 *       allocating garbage).
 * </ul>
 *
 * <p>Disadvantages compared to {@code int[]}:
 *
 * <ul>
 *   <li>Memory footprint has a fixed overhead (about 24 bytes per instance).

 *   <li>Can be streamed without "breaking the chain": {@code foo.getBarLongs().stream()...}.
 *   <li>Access to all collection-based utilities via {@link #asList} (though at the cost of
 *       allocating garbage).
 * </ul>
 *
 * <p>Disadvantages compared to {@code long[]}:
 *
 * <ul>
 *   <li>Memory footprint has a fixed overhead (about 24 bytes per instance).

 *
 * <p>This class should not be assumed to be universally superior to {@code
 * java.util.LinkedHashMap}. Generally speaking, this class reduces object allocation and memory
 * consumption at the price of moderately increased constant factors of CPU. Only use this class
 * when there is a specific reason to prioritize memory over CPU.
 *
 * @author Louis Wasserman
 */

 * guarantees.
 *
 * <p>This class should not be assumed to be universally superior to {@code java.util.HashMap}.
 * Generally speaking, this class reduces object allocation and memory consumption at the price of
 * moderately increased constant factors of CPU. Only use this class when there is a specific reason
 * to prioritize memory over CPU.
 *
 * @author Louis Wasserman

   *
   * @see IntStream#findFirst()
   * @throws NullPointerException if the last element of the stream is null
   */
  public static OptionalInt findLast(IntStream stream) {
    // findLast(Stream) does some allocation, so we might as well box some more
    java.util.Optional<Integer> boxedLast = findLast(stream.boxed());
    return boxedLast.map(OptionalInt::of).orElse(OptionalInt.empty());
  }

  /**