- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 48 for mid2 (0.06 sec)
-
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",
Registered: Sun Nov 10 03:50:12 UTC 2024 - Last Modified: Sat Aug 01 21:40:30 UTC 2020 - 49K bytes - Viewed (0) -
src/main/java/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
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Fri Mar 22 20:39:42 UTC 2019 - 5.9K bytes - Viewed (0) -
fess-crawler-opensearch/src/test/java/org/codelibs/fess/crawler/service/impl/OpenSearchDataServiceTest.java
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);
Registered: Sun Nov 10 03:50:12 UTC 2024 - Last Modified: Thu Nov 07 04:44:10 UTC 2024 - 6.8K bytes - Viewed (0) -
buildscripts/verify-healing-empty-erasure-set.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))"
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Jul 12 20:51:54 UTC 2024 - 3.7K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/SmbException.java
while( max >= min ) { 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 Nov 03 00:10:13 UTC 2024 - Last Modified: Fri Mar 22 21:10:40 UTC 2019 - 5.5K bytes - Viewed (0) -
okhttp/src/main/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++
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 11.7K bytes - Viewed (0) -
cmd/bucket-replication-utils_test.go
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), }, },
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Aug 08 20:27:40 UTC 2023 - 9.3K bytes - Viewed (0) -
src/main/java/jcifs/dcerpc/DcerpcException.java
while ( max >= min ) { 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 ]; } }
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Sun May 17 09:02:44 UTC 2020 - 2.4K 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 Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Aug 19 16:21:24 UTC 2024 - 3.4K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb2/ServerMessageBlock2.java
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Sun Sep 30 10:47:31 UTC 2018 - 19.9K bytes - Viewed (0)