@Test
    void testSetMid() {
        long mid = 12345L;
        mockResponse.setMid(mid);

        // Verify that the method was called with the correct argument
        verify(mockResponse, times(1)).setMid(mid);
    }

    @Test
    void testGetMid() {
        long mid = 54321L;
        when(mockResponse.getMid()).thenReturn(mid);
        assertEquals(mid, mockResponse.getMid());

            while (max >= min) {
                final int mid = (min + max) / 2;

                if (errcode > NT_STATUS_CODES[mid]) {
                    min = mid + 1;
                } else if (errcode < NT_STATUS_CODES[mid]) {
                    max = mid - 1;
                } else {
                    return NT_STATUS_MESSAGES[mid];
                }
            }
        } else {
            int min = 0;

        while (max >= min) {
            final int mid = (min + max) / 2;

            if (errcode > DCERPC_FAULT_CODES[mid]) {
                min = mid + 1;
            } else if (errcode < DCERPC_FAULT_CODES[mid]) {
                max = mid - 1;
            } else {
                return DCERPC_FAULT_MESSAGES[mid];
            }
        }

        return "0x" + Hexdump.toHexString(errcode, 8);

    /*
     * We want each multiplication to have both sides with approximately the same number of digits.
     * Currently, we just divide the range in half.
     */
    int mid = (n1 + n2) >>> 1;
    return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2));
  }

  @Benchmark
  int slowFactorial(int reps) {
    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;

      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.
        while (mid > -1 && this[mid] != '\n'.code.toByte()) {
          mid--
        }
        mid++

        // Now look for the ending '\n'.
        var end = 1
        while (this[mid + end] != '\n'.code.toByte()) {
          end++

        while (max >= min) {
            final int mid = (min + max) / 2;

            if (errcode > DCERPC_FAULT_CODES[mid]) {
                min = mid + 1;
            } else if (errcode < DCERPC_FAULT_CODES[mid]) {
                max = mid - 1;
            } else {
                return DCERPC_FAULT_MESSAGES[mid];
            }
        }

        return "0x" + Hexdump.toHexString(errcode, 8);

        // Given
        long mid = 99999L;
        long asyncId = 88888L;
        int credits = 5;
        int treeId = 77;

        // When
        Smb2CancelRequest request = new Smb2CancelRequest(mockConfig, mid, asyncId);
        request.setRequestCredits(credits);
        request.setTid(treeId);

        // Then
        assertEquals(mid, request.getMid(), "MID should be set correctly");

    @Test
    void testEqualsAndHashCode() {
        ServerMessageBlock smb1 = new TestServerMessageBlock();
        smb1.mid = 100;

        ServerMessageBlock smb2 = new TestServerMessageBlock();
        smb2.mid = 100;

        ServerMessageBlock smb3 = new TestServerMessageBlock();
        smb3.mid = 200;

        assertEquals(smb1, smb2);
        assertNotEquals(smb1, smb3);

            this.response = (TestResponse) msg;
        }

        @Override
        public long getMid() {
            return mid;
        }

        @Override
        public void setMid(long mid) {
            this.mid = mid;
        }

        @Override
        public int getCommand() {
            return command;
        }

        @Override

                this.response = msg;
            }

            @Override
            public long getMid() {
                return mid;
            }

            @Override
            public void setMid(long mid) {
                this.mid = mid;
            }

            @Override
            public int getCommand() {
                return command;
            }