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

    while (low <= high) {
      int mid = (low + high) >>> 1;
      int labelOffset = trieData.charAt(mid * NODE_SIZE);
      int cmp = compareLabel(label, labelOffset);

      if (cmp < 0) {
        high = mid - 1;
      } else if (cmp > 0) {
        low = mid + 1;
      } else {
        return mid;
      }
    }
    return -1;
  }

  /**

      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++

    /*
     * 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;

): Int {
  // Do the binary searching bit.
  var low = position
  var high = limit - 1
  while (low <= high) {
    val mid = (low + high) / 2
    val compareResult = compare(mid)
    when {
      compareResult < 0 -> high = mid - 1
      compareResult > 0 -> low = mid + 1
      else -> return mid // Match!
    }
  }

  return -low - 1 // insertionPoint is before the first element.

    /**
     * Gets the message ID.
     *
     * @return the message id
     */
    long getMid();

    /**
     * Sets the message ID.
     *
     * @param mid the message ID to set
     */
    void setMid(long mid);

    /**
     * Gets the SMB command.
     *
     * @return the command
     */
    int getCommand();

    /**
     * Sets the SMB command.
     *

    int getErrorCode();

    /**
     * Sets the message ID.
     *
     * @param k the message ID to set
     */
    void setMid(long k);

    /**
     * Gets the message ID.
     *
     * @return mid
     */
    long getMid();

    /**
     * Verifies the signature of this response.
     *
     * @param buffer the buffer containing the signature data
     * @param i the starting index in the buffer

application/zip                zip jar          # ZIP Compressed File
audio/basic                    au snd           # Audio Sound File
audio/x-aiff                   aif aiff aifc    # AIFF Sound File
audio/x-midi                   mid              # MIDI Sound File
audio/x-pn-realaudio           ra ram rm rpm    # REALAUDIO Sound File
audio/x-wav                    wav              # WAV Sound File
audio/x-mpegurl                mp3              # MP3 Sound File