*            The array of character types.
     * @param low
     *            The lower bound of the character range (inclusive).
     * @param hi
     *            The upper bound of the character range (inclusive).
     */
    protected static void wordChars(final byte[] ctype2, int low, int hi) {
        if (low < 0) {
            low = 0;
        }
        if (hi >= ctype2.length) {

    private fun ByteString.binarySearch(
      labels: Array<ByteString>,
      labelIndex: Int,
    ): String? {
      var low = 0
      var high = size
      var match: String? = null
      while (low < high) {
        var mid = (low + high) / 2
        // Search for a '\n' that marks the start of a value. Don't go back past the start of the
        // array.

        buf[idx++] = 5; // totalParameterCount low byte
        buf[idx++] = 0; // totalParameterCount high byte -> value 5
        buf[idx++] = 3; // totalDataCount low
        buf[idx++] = 0; // totalDataCount high
        idx += 2; // 2-byte reserved field (not 4 as the code shows)
        buf[6] = 2; // parameterCount low
        buf[7] = 0; // high
        buf[8] = 4; // parameterOffset low
        buf[9] = 0; // high

        byte[] data = new byte[8];
        long low = filetime.longValue();
        long high = filetime.shiftRight(32).longValue();

        // write little-endian
        data[0] = (byte) (low);
        data[1] = (byte) (low >> 8);
        data[2] = (byte) (low >> 16);
        data[3] = (byte) (low >> 24);
        data[4] = (byte) (high);
        data[5] = (byte) (high >> 8);

   * returns the low 32 bits of the result.
   *
   * @since 14.0
   */
  public UnsignedInteger plus(UnsignedInteger val) {
    return fromIntBits(this.value + checkNotNull(val).value);
  }

  /**
   * Returns the result of subtracting this and {@code val}. If the result would be negative,
   * returns the low 32 bits of the result.
   *
   * @since 14.0
   */

        }

        for (int i = 1; i < versions.length; i++) {
            Comparable low = c[i - 1];
            for (int j = i; j < versions.length; j++) {
                Comparable high = c[j];
                assertTrue(low.compareTo(high) < 0, "expected " + low + " < " + high);
                assertTrue(high.compareTo(low) > 0, "expected " + high + " > " + low);
            }
        }
    }

   * returns the low 64 bits of the result.
   *
   * @since 14.0
   */
  public UnsignedLong plus(UnsignedLong val) {
    return fromLongBits(this.value + checkNotNull(val).value);
  }

  /**
   * Returns the result of subtracting this and {@code val}. If the result would have more than 64
   * bits, returns the low 64 bits of the result.
   *
   * @since 14.0
   */

     */
    public static long readTime(final byte[] src, final int srcIndex) {
        final int low = readInt4(src, srcIndex);
        final int hi = readInt4(src, srcIndex + 4);
        long t = (long) hi << 32L | low & 0xFFFFFFFFL;
        return t / 10000L - SmbConstants.MILLISECONDS_BETWEEN_1970_AND_1601;
    }

    /**

        testBuffer = new byte[100];
        testBuffer[0] = 0x00; // Allow ACE
        testBuffer[1] = 0x03; // FLAGS_OBJECT_INHERIT | FLAGS_CONTAINER_INHERIT
        testBuffer[2] = 0x20; // Size low byte (32)
        testBuffer[3] = 0x00; // Size high byte
        testBuffer[4] = (byte) 0xA9; // Access mask byte 0
        testBuffer[5] = 0x00; // Access mask byte 1
        testBuffer[6] = 0x12; // Access mask byte 2

- Modify directory listing operations for caching
- Update change notification handling

---

### Phase 5: RDMA (SMB Direct) Support
**Priority: LOW** | **Estimated Effort: 8-10 weeks**

RDMA provides high-speed, low-latency data transfer for supported network adapters.

#### 5.1 Core RDMA Infrastructure
```
Package: jcifs.internal.smb2.rdma