- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 31 for half (0.02 sec)
-
mockwebserver/src/main/kotlin/mockwebserver3/SocketPolicy.kt
*/ object DisconnectAfterRequest : SocketPolicy /** * Half close connection (InputStream for client) after reading the request but before * writing the response. Use this to simulate late connection pool failures. */ object HalfCloseAfterRequest : SocketPolicy /** Close connection after reading half of the request body (if present). */ object DisconnectDuringRequestBody : SocketPolicy
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Tue Jan 23 14:31:42 UTC 2024 - 4.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/SipHashFunction.java
private final long k1; /** * @param c the number of compression rounds (must be positive) * @param d the number of finalization rounds (must be positive) * @param k0 the first half of the key * @param k1 the second half of the key */ SipHashFunction(int c, int d, long k0, long k1) { checkArgument( c > 0, "The number of SipRound iterations (c=%s) during Compression must be positive.", c);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Apr 20 18:43:59 UTC 2021 - 5.3K bytes - Viewed (0) -
guava/src/com/google/common/hash/SipHashFunction.java
private final long k1; /** * @param c the number of compression rounds (must be positive) * @param d the number of finalization rounds (must be positive) * @param k0 the first half of the key * @param k1 the second half of the key */ SipHashFunction(int c, int d, long k0, long k1) { checkArgument( c > 0, "The number of SipRound iterations (c=%s) during Compression must be positive.", c);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Apr 20 18:43:59 UTC 2021 - 5.3K bytes - Viewed (0) -
docs/erasure/README.md
MinIO protects data against hardware failures and silent data corruption using erasure code and checksums. With the highest level of redundancy, you may lose up to half (N/2) of the total drives and still be able to recover the data. ## What is Erasure Code?
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Sep 29 04:28:45 UTC 2022 - 4.1K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
} return BigInteger.valueOf(result); } /* * 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;
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Aug 19 16:21:24 UTC 2024 - 3.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MapRetrievalCache.java
return entry.value; } entry = cacheEntry2; if (entry != null && entry.key == key) { // Promote second cache entry to first so the access pattern // [K1, K2, K1, K3, K1, K4...] still hits the cache half the time. addToCache(entry); return entry.value; } return null; } @Override void clearCache() { super.clearCache(); cacheEntry1 = null; cacheEntry2 = null; }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 3.2K bytes - Viewed (0) -
native-image-tests/src/main/kotlin/okhttp3/TestRegistration.kt
access.registerAsUsed(testClass) registerTest(access, testClass) } } catch (e: Exception) { // If you throw an exception here then native image building fails half way through // silently without rewriting the binary. So we report noisily, but keep going and prefer // running most tests still. e.printStackTrace() } } }
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 3.7K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/primitives/UnsignedLongsBenchmark.java
} private static long random() { return RANDOM_SOURCE.nextLong(); } // A random value that cannot be 0 and that is unsigned-less-than or equal // to the given dividend, so that we don't have half of our divisions being // trivial because the divisor is bigger than the dividend. // Using remainder here does not give us a uniform distribution but it should // not have a big impact on the measurement.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 4.3K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/primitives/UnsignedLongsBenchmark.java
} private static long random() { return RANDOM_SOURCE.nextLong(); } // A random value that cannot be 0 and that is unsigned-less-than or equal // to the given dividend, so that we don't have half of our divisions being // trivial because the divisor is bigger than the dividend. // Using remainder here does not give us a uniform distribution but it should // not have a big impact on the measurement.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 4.3K bytes - Viewed (0) -
guava/src/com/google/common/math/ToDoubleRounder.java
return roundFloorAsDouble; } else if (diff > 0) { // closer to ceiling return roundCeilingAsDouble; } // halfway between the representable values; do the half-whatever logic switch (mode) { case HALF_EVEN: // roundFloorAsDouble and roundCeilingAsDouble are neighbors, so precisely // one of them should have an even long representation
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 5.8K bytes - Viewed (0)