SmbRandomAccessFile raf = spy(newInstance("r", false, false, false));
        // For each 1-byte read, fill provided buffer with 0xFF/0x01
        doAnswer(inv -> {
            byte[] b = inv.getArgument(0);
            int off = inv.getArgument(1);
            b[off] = (byte) 0xFF;
            return 1;
        }).when(raf).read(any(byte[].class), anyInt(), eq(1));
        assertTrue(raf.readBoolean());

    for (Entry<K, V> entry : entries) {
      Entry<V, K> reversed = reverseEntry(entry);
      BiMap<V, K> inv = getMap().inverse();
      assertFalse(
          "Inverse should not contain entry " + reversed, inv.entrySet().contains(reversed));
      assertFalse(
          "Inverse should not contain key " + reversed.getKey(),
          inv.containsKey(reversed.getKey()));
      assertFalse(

    BiMap<V, K> inv = getMap().inverse();
    inv.keySet().clear();
    assertTrue(getMap().isEmpty());
    assertTrue(inv.isEmpty());
  }

  @MapFeature.Require(SUPPORTS_REMOVE)
  public void testClearInverseValuesClears() {
    BiMap<V, K> inv = getMap().inverse();
    inv.values().clear();
    assertTrue(getMap().isEmpty());
    assertTrue(inv.isEmpty());
  }

    BiMap<V, K> inv = getMap().inverse();
    inv.keySet().clear();
    assertTrue(getMap().isEmpty());
    assertTrue(inv.isEmpty());
  }

  @MapFeature.Require(SUPPORTS_REMOVE)
  public void testClearInverseValuesClears() {
    BiMap<V, K> inv = getMap().inverse();
    inv.values().clear();
    assertTrue(getMap().isEmpty());
    assertTrue(inv.isEmpty());
  }

        // send() answer that mutates the provided response
        when(tree.send(any(Trans2FindFirst2.class), any(Trans2FindFirst2Response.class))).thenAnswer((InvocationOnMock inv) -> {
            Trans2FindFirst2Response resp = inv.getArgument(1);
            // First response content
            FE[] res = java.util.Arrays.stream(batches.get(0)).map(FE::new).toArray(FE[]::new);

    for (Entry<K, V> entry : entries) {
      Entry<V, K> reversed = reverseEntry(entry);
      BiMap<V, K> inv = getMap().inverse();
      assertFalse(
          "Inverse should not contain entry " + reversed, inv.entrySet().contains(reversed));
      assertFalse(
          "Inverse should not contain key " + reversed.getKey(),
          inv.containsKey(reversed.getKey()));
      assertFalse(

        jcifs.SID[] in = new jcifs.SID[] { s1, s2 };

        // Stub sendrecv to emulate successful RPC response
        doAnswer(inv -> {
            // Capture the outgoing RPC and populate result fields as the server would
            Object msg = inv.getArgument(0);
            assertTrue(msg instanceof jcifs.dcerpc.msrpc.MsrpcLookupSids);

        // Mock both sends and return response
        when(tree.send(any(TransWaitNamedPipe.class), any(TransWaitNamedPipeResponse.class))).thenAnswer(inv -> inv.getArgument(1));
        when(tree.send(any(TransCallNamedPipe.class), any(TransCallNamedPipeResponse.class))).thenAnswer(inv -> inv.getArgument(1));

        int n = handle.sendrecv(new byte[3], 0, 3, new byte[8], 64);

        // Track query count to handle multiple queries properly
        final int[] queryCount = { 0 };

        // Mock send(create) to wire a query response with fe1, fe2
        doAnswer(inv -> {
            Object arg = inv.getArgument(0);
            if (arg instanceof Smb2CreateRequest) {
                Smb2CreateRequest create = (Smb2CreateRequest) arg;
                // Initialize response chain (also for chained query)

    void disconnect_flagCombinations(boolean hard, boolean inuse, boolean expected) throws Exception {
        when(transport.disconnect(anyBoolean(), anyBoolean())).thenAnswer(inv -> {
            boolean h = inv.getArgument(0);
            boolean u = inv.getArgument(1);
            // Arbitrary behavior mapping for test purposes
            return (h && !u) || (!h && u);
        });