/**
 * Some microbenchmarks for the {@link com.google.common.base.Objects} class.
 *
 * @author Ben L. Titzer
 */
@NullUnmarked
public class ObjectsBenchmark {

  private static final Integer I0 = -45;
  private static final Integer I1 = -1;
  private static final Integer I2 = 3;
  private static final String S0 = "3";
  private static final String S1 = "Ninety five";
  private static final String S2 = "44 one million";

            .concurrencyLevel(1)
            .maximumWeight(45)
            .weigher(intKeyWeigher())
            .build(loader);
    CacheTesting.warmUp(cache, 0, 10);
    Set<Integer> keySet = cache.asMap().keySet();
    assertThat(keySet).containsExactly(0, 1, 2, 3, 4, 5, 6, 7, 8, 9);

    // add an at-the-maximum-weight entry
    getAll(cache, asList(45));
    CacheTesting.drainRecencyQueues(cache);

        TransCallNamedPipeResponse response3 = new TransCallNamedPipeResponse(mockConfig, outputBuffer3);
        System.arraycopy(sourceData, 0, buffer, 45, sourceData.length);
        int result3 = response3.readDataWireFormat(buffer, 45, sourceData.length);
        assertEquals(sourceData.length, result3);
    }

    @Test
    void testConstructorWithNullBuffer() {

/**
 * Some microbenchmarks for the {@link com.google.common.base.Objects} class.
 *
 * @author Ben L. Titzer
 */
@NullUnmarked
public class ObjectsBenchmark {

  private static final Integer I0 = -45;
  private static final Integer I1 = -1;
  private static final Integer I2 = 3;
  private static final String S0 = "3";
  private static final String S1 = "Ninety five";
  private static final String S2 = "44 one million";

    assertTrue(rangeSet.intersects(Range.closed(3, 4)));
    assertTrue(rangeSet.intersects(Range.closedOpen(1, 5)));
    assertFalse(rangeSet.intersects(Range.closedOpen(4, 5)));
    assertTrue(rangeSet.intersects(Range.lessThan(1)));
    assertTrue(rangeSet.intersects(Range.greaterThan(1)));
    assertFalse(rangeSet.intersects(Range.greaterThan(3)));

  - [Downloads for v1.4.6](#downloads-for-v146)
    - [Client Binaries](#client-binaries-4)
    - [Server Binaries](#server-binaries-4)
  - [Changelog since v1.4.5](#changelog-since-v145)
    - [Other notable changes](#other-notable-changes-4)
- [v1.4.5](#v145)
  - [Downloads for v1.4.5](#downloads-for-v145)
    - [Client Binaries](#client-binaries-5)
    - [Server Binaries](#server-binaries-5)
  - [Changelog since v1.4.4](#changelog-since-v144)

        Duration later = MonotonicClock.elapsed();

        assertTrue(later.compareTo(initial) > 0, "Elapsed time should increase");
        assertTrue(
                later.minus(initial).toMillis() >= 45,
                "Elapsed time difference should be at least 45ms (accounting for some timing variance)");
    }

    @Test
    @DisplayName("MonotonicClock start time should remain constant")

- Update `SmbFile` caching logic to use leases
- Add lease break handling in `SmbTransport`

---

### Phase 2: Persistent Handles
**Priority: HIGH** | **Estimated Effort: 4-5 weeks**

Persistent handles allow connections to survive network interruptions and server failovers.

#### 2.1 Core Persistent Handle Infrastructure
```
Package: jcifs.internal.smb2.persistent

            (byte) 26, (byte) 18, (byte) 10, (byte) 2, (byte) 59, (byte) 51, (byte) 43, (byte) 35, (byte) 62, (byte) 54, (byte) 46,
            (byte) 38, (byte) 30, (byte) 22, (byte) 14, (byte) 6, (byte) 61, (byte) 53, (byte) 45, (byte) 37, (byte) 29, (byte) 21,
            (byte) 13, (byte) 5, (byte) 60, (byte) 52, (byte) 44, (byte) 36, (byte) 28, (byte) 20, (byte) 12, (byte) 4, (byte) 27,
            (byte) 19, (byte) 11, (byte) 3 };

 * for information on the behaviour of the algorithm.
 *
 * <p>On Intel Core2 2.66, on 1000 bytes, fingerprint2011 takes 0.9 microseconds compared to
 * fingerprint at 4.0 microseconds and md5 at 4.5 microseconds.
 *
 * <p>Note to maintainers: This implementation relies on signed arithmetic being bit-wise equivalent
 * to unsigned arithmetic in all cases except:
 *
 * <ul>