- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 235 for Sauter (0.05 sec)
-
docs/config/README.md
In most setups this is sufficient to heal the content after drive replacements. Setting `max_sleep` to a *lower* value and setting `max_io` to a *higher* value would make heal go faster.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 18.1K bytes - Viewed (1) -
README.md
[conscrypt]: https://github.com/google/conscrypt/ [get_example]: https://raw.github.com/square/okhttp/master/samples/guide/src/main/java/okhttp3/guide/GetExample.java [kotlin]: https://kotlinlang.org/ [okhttp3_pro]: https://raw.githubusercontent.com/square/okhttp/master/okhttp/src/main/resources/META-INF/proguard/okhttp3.pro [okhttp]: https://square.github.io/okhttp/
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Mon Jul 28 07:33:49 UTC 2025 - 8.8K bytes - Viewed (0) -
docs/en/docs/advanced/middleware.md
## Other middlewares { #other-middlewares } There are many other ASGI middlewares. For example:
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:59:07 UTC 2025 - 4.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
hashFunctions[0] = Murmur3_128HashFunction.GOOD_FAST_HASH_128; int seed = GOOD_FAST_HASH_SEED; for (int i = 1; i < hashFunctionsNeeded; i++) { seed += 1500450271; // a prime; shouldn't matter hashFunctions[i] = murmur3_128(seed); } return new ConcatenatedHashFunction(hashFunctions); } /** * Used to randomize {@link #goodFastHash} instances, so that programs which persist anything
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Jul 17 15:26:41 UTC 2025 - 29.8K bytes - Viewed (0) -
docs/compression/README.md
Compression happens inflight, i.e objects are compressed before being written to disk(s). MinIO uses [`klauspost/compress/s2`](https://github.com/klauspost/compress/tree/master/s2) streaming compression due to its stability and performance. This algorithm is specifically optimized for machine generated content. Write throughput is typically at least 500MB/s per CPU core,
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 5.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/SequentialExecutorTest.java
assertEquals(1, numCalls.get()); } /* * Under Android, MyError propagates up and fails the test? * * TODO(b/218700094): Does this matter to prod users, or is it just a feature of our testing * environment? If the latter, maybe write a custom Executor that avoids failing the test when it * sees an Error? */ @AndroidIncompatible public void testTaskThrowsError() throws Exception {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Jul 11 18:52:30 UTC 2025 - 11.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractClosingFutureTest.java
final TestCloseable closeable2 = new TestCloseable("closeable2"); final TestCloseable closeable3 = new TestCloseable("closeable3"); final TestCloseable closeable4 = new TestCloseable("closeable4"); final Waiter waiter = new Waiter(); final CountDownLatch futureCancelled = new CountDownLatch(1); final Exception exception = new Exception(); final Closeable mockCloseable = Mockito.mock(Closeable.class); @Override
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Jul 11 18:52:30 UTC 2025 - 75.4K bytes - Viewed (0) -
ci/official/utilities/code_check_full.bats
# their dependencies. It's a rewritten version of the "smoke test", an older # Python script that was very difficult to understand. See # https://github.com/tensorflow/tensorflow/blob/master/tensorflow/tools/pip_package/pip_smoke_test.py @test "Pip package includes all required //tensorflow dependencies" { # grep patterns for packages whose dependencies can be ignored
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Wed Aug 06 20:43:08 UTC 2025 - 13.4K bytes - Viewed (0) -
guava/src/com/google/common/math/LongMath.java
* * <p>This differs from {@code Long.bitCount(x) == 1}, because {@code * Long.bitCount(Long.MIN_VALUE) == 1}, but {@link Long#MIN_VALUE} is not a power of two. */ // Whenever both tests are cheap and functional, it's faster to use &, | instead of &&, || @SuppressWarnings("ShortCircuitBoolean") public static boolean isPowerOfTwo(long x) { return x > 0 & (x & (x - 1)) == 0; } /**
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 29 16:20:07 UTC 2025 - 46.8K bytes - Viewed (0) -
guava/src/com/google/common/hash/Hashing.java
hashFunctions[0] = Murmur3_128HashFunction.GOOD_FAST_HASH_128; int seed = GOOD_FAST_HASH_SEED; for (int i = 1; i < hashFunctionsNeeded; i++) { seed += 1500450271; // a prime; shouldn't matter hashFunctions[i] = murmur3_128(seed); } return new ConcatenatedHashFunction(hashFunctions); } /** * Used to randomize {@link #goodFastHash} instances, so that programs which persist anything
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 22:06:57 UTC 2025 - 31.1K bytes - Viewed (0)