- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 71 for mid2 (0.03 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
fess-crawler-lasta/src/main/resources/crawler/extractor.xml
"audio/pcmu-wb", "audio/pcmu", "audio/prs.sid", "audio/qcelp", "audio/red", "audio/rtp-enc-aescm128", "audio/rtp-midi", "audio/rtx", "audio/smv", "audio/smv0", "audio/smv-qcp", "audio/sp-midi", "audio/t140c", "audio/t38", "audio/telephone-event", "audio/tone", "audio/ulpfec", "audio/vdvi", "audio/vmr-wb",
Created: Sat Dec 20 11:21:39 GMT 2025 - Last Modified: Sun Nov 23 03:46:53 GMT 2025 - 50.1K bytes - Click Count (0) -
src/test/resources/jcifs/smb1/util/mime.map
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
Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 5.9K bytes - Click Count (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() {Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 39.5K bytes - Click Count (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;Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 6K bytes - Click Count (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);Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 2.9K bytes - Click Count (0) -
docs/bucket/replication/delete-replication.sh
./mc cp README.md myminio1/foobucket/dir/file versionId="$(./mc ls --json --versions myminio1/foobucket/dir/ | jq -r .versionId)" kill ${pid2} && wait ${pid2} || true aws s3api --endpoint-url http://localhost:9001 delete-object --bucket foobucket --key dir/file --version-id "$versionId" out="$(./mc ls myminio1/foobucket/dir/)" if [ "$out" != "" ]; thenCreated: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Sep 06 09:42:21 GMT 2024 - 3.9K bytes - Click Count (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);Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 3.2K bytes - Click Count (0) -
buildscripts/verify-healing.sh
pid1=$! disown ${pid1} "${MINIO[@]}" --address ":$((start_port + 2))" $args >"${WORK_DIR}/dist-minio-server2.log" 2>&1 & pid2=$! disown $pid2 "${MINIO[@]}" --address ":$((start_port + 3))" $args >"${WORK_DIR}/dist-minio-server3.log" 2>&1 & pid3=$! disown $pid3 export MC_HOST_myminio="http://minio:minio123@127.0.0.1:$((start_port + 1))"Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Jul 12 20:51:54 GMT 2024 - 4K bytes - Click Count (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; } @OverrideCreated: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 14.5K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/publicsuffix/PublicSuffixDatabase.kt
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++
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Mon Jul 28 07:33:49 GMT 2025 - 8.5K bytes - Click Count (0)