- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 217 for midi (0.05 sec)
-
src/main/java/org/codelibs/fess/mylasta/action/FessLabels.java
/** The key of the message: AIF Audio */ public static final String LABELS_facet_filetype_aif = "{labels.facet_filetype_aif}"; /** The key of the message: MIDI Audio */ public static final String LABELS_facet_filetype_midi = "{labels.facet_filetype_midi}"; /** The key of the message: MPGA Audio */
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Jul 05 02:36:47 UTC 2025 - 146.4K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb2/ServerMessageBlock2Test.java
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() {
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 39.5K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/SmbException.java
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;
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 6K bytes - Viewed (0) -
src/main/webapp/css/admin/adminlte.min.css.map
.main-footer {\n margin-left: 0;\n}\n\nbody.sidebar-collapse:not(.sidebar-mini-xs):not(.sidebar-mini-md):not(.sidebar-mini) .content-wrapper, body.sidebar-collapse:not(.sidebar-mini-xs):not(.sidebar-mini-md):not(.sidebar-mini) .content-wrapper::before,\nbody.sidebar-collapse:not(.sidebar-mini-xs):not(.sidebar-mini-md):not(.sidebar-mini) .main-footer,\nbody.sidebar-collapse:not(.sidebar-mini-xs):not(.sidebar-mini-md):not(.sidebar-mini) .main-footer::before,\nbody.sidebar-collapse:not(.sidebar-mini-xs):...
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 3.7M bytes - Viewed (1) -
src/test/java/jcifs/util/transport/ResponseTest.java
@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());
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 6.5K bytes - Viewed (0) -
src/main/java/jcifs/dcerpc/DcerpcException.java
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);
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 2.9K bytes - Viewed (0) -
src/main/java/jcifs/smb1/dcerpc/DcerpcException.java
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);
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 3.2K bytes - Viewed (0) -
src/test/java/jcifs/internal/RequestTest.java
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
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 14.5K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
/* * 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;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 3.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
boolean midLessThanFrom = (array[mid] < array[from]); boolean toLessThanFrom = (array[to] < array[from]); if (toLessThanMid == midLessThanFrom) { // Either array[to] < array[mid] < array[from] or array[from] <= array[mid] <= array[to]. swap(array, mid, from); } else if (toLessThanMid != toLessThanFrom) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 30.1K bytes - Viewed (0)