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

    class EqualsHashCodeTests {

        @Test
        @DisplayName("Should calculate hashCode from MID")
        void testHashCode() {
            testMessage.setMid(12345L);
            assertEquals(12345, testMessage.hashCode());
        }

        @Test
        @DisplayName("Should be equal when MIDs match")
        void testEquals() {

        accessResult2.setSessionId("id2");
        accessResult2.setStatus(200);
        accessResult2.setUrl("http://www.id2.com/");

        dataService.store(accessResult2);

        final OpenSearchAccessResult accessResult3 = dataService.getAccessResult("id1", "http://www.id1.com/");
        final OpenSearchAccessResult accessResult4 = dataService.getAccessResult("id2", "http://www.id2.com/");
        assertNotNull(accessResult3);

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

  <mime-type type="audio/l8"/>
  <mime-type type="audio/lpc"/>

  <mime-type type="audio/midi">
    <acronym>MIDI</acronym>
    <_comment>Musical Instrument Digital Interface</_comment>
    <magic priority ="20">
      <match type="string" value="MThd" offset="0"/>
    </magic>
    <glob pattern="*.mid"/>
    <glob pattern="*.midi"/>
    <glob pattern="*.kar"/>
    <glob pattern="*.rmi"/>
  </mime-type>

            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;

        String id1 = userInfoHelper.getId();
        String id2 = userInfoHelper.getId();

        assertNotNull(id1);
        assertNotNull(id2);
        assertNotSame(id1, id2);
        assertEquals(32, id1.length());
        assertEquals(32, id2.length());
        assertTrue(id1.matches("[0-9a-f]+"));
        assertTrue(id2.matches("[0-9a-f]+"));
    }

    public void test_storeQueryId() {

		expErr: nil,
		expDsc: ReplicateDecision{
			targetsMap: map[string]replicateTargetDecision{
				"arn:minio:replication::id:bucket":  newReplicateTargetDecision("arn:minio:replication::id:bucket", true, false),
				"arn:minio:replication::id2:bucket": newReplicateTargetDecision("arn:minio:replication::id2:bucket", false, true),
			},
		},

        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;