- Sort Score
- Result 10 results
- Languages All
Results 1501 - 1510 of 1,840 for info (0.02 sec)
-
cmd/api-headers.go
w.Header().Set(xhttp.AmzBucketRegion, region) } w.Header().Set(xhttp.AcceptRanges, "bytes") // Remove sensitive information crypto.RemoveSensitiveHeaders(w.Header()) } // Encodes the response headers into XML format. func encodeResponse(response any) []byte { var buf bytes.Buffer buf.WriteString(xml.Header) if err := xml.NewEncoder(&buf).Encode(response); err != nil { bugLogIf(GlobalContext, err) return nil }
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 8.6K bytes - Viewed (0) -
docs/throttle/README.md
If you have traditional spinning (hdd) drives, some applications with high concurrency might require MinIO cluster to be tuned such that to avoid random I/O on the drives. The way to convert high concurrent I/O into a sequential I/O is by reducing the number of concurrent operations allowed per cluster. This allows MinIO cluster to be operationally resilient to such workloads, while also making sure the drives are at optimal efficiency and responsive.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 16 08:43:49 UTC 2024 - 1.5K bytes - Viewed (1) -
android/guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java
return (int) Math.pow(a, 1.0 / concentration); } @AfterExperiment void tearDown() { double req = requests.get(); double hit = req - misses.get(); // Currently, this is going into /dev/null, but I'll fix that System.out.println("hit rate: " + hit / req); } // for proper distributions later: // import JSci.maths.statistics.ProbabilityDistribution;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 3.4K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/testers/MapForEachTester.java
// @Ignore affects the Android test runner, which respects JUnit 4 annotations on JUnit 3 tests. @SuppressWarnings("JUnit4ClassUsedInJUnit3") @IgnoreJRERequirement // We opt into library desugaring for our tests. public class MapForEachTester<K, V> extends AbstractMapTester<K, V> { @CollectionFeature.Require(KNOWN_ORDER) public void testForEachKnownOrder() {Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Oct 31 14:51:04 UTC 2024 - 3.4K bytes - Viewed (0) -
ci/official/containers/ml_build/setup.python.sh
$VERSION-dev $VERSION-venv EOF else cat >pythons.txt <<EOF $VERSION $VERSION-dev $VERSION-venv $VERSION-distutils EOF fi /setup.packages.sh pythons.txt # Re-link pyconfig.h from x86_64-linux-gnu into the devtoolset directory # for any Python version present pushd /usr/include/x86_64-linux-gnu for f in $(ls | grep python); do # set up symlink for devtoolset-9 rm -f /dt9/usr/include/x86_64-linux-gnu/$f
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Fri Aug 01 02:44:57 UTC 2025 - 2.8K bytes - Viewed (0) -
src/bytes/bytes.go
// A nil argument is equivalent to an empty slice. func Compare(a, b []byte) int { return bytealg.Compare(a, b) } // explode splits s into a slice of UTF-8 sequences, one per Unicode code point (still slices of bytes), // up to a maximum of n byte slices. Invalid UTF-8 sequences are chopped into individual bytes. func explode(s []byte, n int) [][]byte { if n <= 0 || n > len(s) { n = len(s) } a := make([][]byte, n) var size int
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Sep 03 14:04:47 UTC 2025 - 35.5K bytes - Viewed (0) -
.github/CONTRIBUTING.md
- OkHttp targets the intersection of RFC correct *and* widely implemented. Incorrect implementations that are very widely implemented e.g. a bug in Apache, Nginx, Google, Firefox should also be handled. Before your code can be accepted into the project you must also sign the [Individual Contributor License Agreement (CLA)][1].
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Sun Mar 17 04:16:26 UTC 2019 - 1.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedLists.java
return higherIndex; } }, /** * Return {@code ~insertionIndex}, where {@code insertionIndex} is defined as the point at which * the key would be inserted into the list: the index of the next higher element in the list, or * {@code list.size()} if there is no such element. * * <p>Note that the return value will be {@code >= 0} if and only if there is an element of theRegistered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 10.9K bytes - Viewed (0) -
src/main/java/jcifs/smb1/util/MD4.java
tail[padLen + i] = (byte) (count * 8 >>> 8 * i); } engineUpdate(tail, 0, tail.length); final byte[] result = new byte[16]; // cast this MD4's context (array of 4 ints) into an array of 16 bytes. for (int i = 0; i < 4; i++) { for (int j = 0; j < 4; j++) { result[i * 4 + j] = (byte) (context[i] >>> 8 * j); } }
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 9.6K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/CompressionInterceptor.kt
import okhttp3.internal.http.promisesBody import okio.BufferedSource import okio.GzipSource import okio.Source import okio.buffer /** * Transparent Compressed response support. * * The algorithm map will be turned into a heading such as "Accept-Encoding: br, gzip" * * If [algorithms] is empty this interceptor has no effect. To disable compression set * a specific "Accept-Encoding: identity" or similar. *
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Fri Aug 01 06:04:22 UTC 2025 - 3.2K bytes - Viewed (1)