bb.putShort((short) 0); // pathConsumed (will be divided by 2)
            bb.putShort((short) 0); // numReferrals
            bb.putShort((short) 0); // tflags
            bb.putShort((short) 0); // tflags high bytes (skipped in decode)

            int bytesDecoded = buffer.decode(testBuffer, 0, testBuffer.length);

            assertEquals(8, bytesDecoded);
            assertEquals(0, buffer.getPathConsumed());

        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
        buf[10] = 6; // parameterDisplacement low

   *   <li>If the first character was a high surrogate value, then an attempt is made to read the
   *       next character.
   *       <ol>
   *         <li><b>If the end of the sequence was reached, the negated value of the trailing high
   *             surrogate is returned.</b>
   *         <li><b>If the next character was a valid low surrogate, the code point value of the
   *             high/low surrogate pair is returned.</b>

   *   <li>If the first character was a high surrogate value, then an attempt is made to read the
   *       next character.
   *       <ol>
   *         <li><b>If the end of the sequence was reached, the negated value of the trailing high
   *             surrogate is returned.</b>
   *         <li><b>If the next character was a valid low surrogate, the code point value of the
   *             high/low surrogate pair is returned.</b>

            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);
            }
        }
    }

    private void checkVersionsEqual(String v1, String v2) {

        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
        testBuffer[7] = 0x00; // Access mask byte 3

    assertThat(UnsignedLongs.compare(0xffffffffffffffffL, 0)).isGreaterThan(0);

    // both with high bit set
    assertThat(UnsignedLongs.compare(0xff1a618b7f65ea12L, 0xffffffffffffffffL)).isLessThan(0);
    assertThat(UnsignedLongs.compare(0xffffffffffffffffL, 0xff1a618b7f65ea12L)).isGreaterThan(0);

    // one with high bit set
    assertThat(UnsignedLongs.compare(0x5a4316b8c153ac4dL, 0xff1a618b7f65ea12L)).isLessThan(0);

## Implementation Phases

### Phase 1: SMB3 Lease Implementation (Foundation)
**Priority: HIGH** | **Estimated Effort: 3-4 weeks**

SMB3 leases replace the traditional oplock mechanism and are foundational for other features.

#### 1.1 Core Lease Infrastructure
```
Package: jcifs.internal.smb2.lease

    }

    /**
     * Enable or disable high performance mode for sensitive data masking
     *
     * In high performance mode, expensive regex operations are avoided by doing
     * fast string contains checks first. This significantly improves performance
     * for high-frequency logging scenarios.
     *
     * @param enable true to enable high performance mode
     */

        verify(mockQuestionName).writeWireFormat(dst, 0);
        assertEquals((byte) 0x00, dst[10]); // questionType high byte
        assertEquals((byte) NameServicePacket.NB, dst[11]); // questionType low byte
        assertEquals((byte) 0x00, dst[12]); // questionClass high byte
        assertEquals((byte) NameServicePacket.IN, dst[13]); // questionClass low byte
    }

    @Test