- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 78 for mid2 (0.01 sec)
-
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 Sep 07 19:28:11 UTC 2025 - Last Modified: Wed Apr 09 14:28:39 UTC 2025 - 9.3K 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) -
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) -
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++
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Mon Jul 28 07:33:49 UTC 2025 - 8.5K bytes - Viewed (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" != "" ]; then
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Sep 06 09:42:21 UTC 2024 - 3.9K bytes - Viewed (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))"
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Jul 12 20:51:54 UTC 2024 - 4K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb2/Smb2CancelRequestTest.java
// Given long mid = 99999L; long asyncId = 88888L; int credits = 5; int treeId = 77; // When Smb2CancelRequest request = new Smb2CancelRequest(mockConfig, mid, asyncId); request.setRequestCredits(credits); request.setTid(treeId); // Then assertEquals(mid, request.getMid(), "MID should be set correctly");
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 9.8K bytes - Viewed (0) -
src/test/java/jcifs/smb1/smb1/ServerMessageBlockTest.java
@Test void testEqualsAndHashCode() { ServerMessageBlock smb1 = new TestServerMessageBlock(); smb1.mid = 100; ServerMessageBlock smb2 = new TestServerMessageBlock(); smb2.mid = 100; ServerMessageBlock smb3 = new TestServerMessageBlock(); smb3.mid = 200; assertEquals(smb1, smb2); assertNotEquals(smb1, smb3);
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 9.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)