- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 65 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) -
internal/dsync/drwmutex.go
// Tolerance is not set, defaults to half of the locker clients. tolerance := len(restClnts) / 2 // Quorum is effectively = total clients subtracted with tolerance limit quorum := len(restClnts) - tolerance if !isReadLock { // In situations for write locks, as a special case // to avoid split brains we make sure to acquire // quorum + 1 when tolerance is exactly half of the // total locker clients.
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Mon Sep 09 15:49:49 UTC 2024 - 20.4K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/MoreExecutors.java
* <li>awaits executor service termination for half of the specified timeout. * <li>if the timeout expires, it calls {@link ExecutorService#shutdownNow()}, cancelling * pending tasks and interrupting running tasks. * <li>awaits executor service termination for the other half of the specified timeout. * </ol> *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:51:36 UTC 2024 - 44.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) -
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) -
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) -
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/collect/RegularImmutableTable.java
static <R, C, V> RegularImmutableTable<R, C, V> forOrderedComponents( ImmutableList<Cell<R, C, V>> cellList, ImmutableSet<R> rowSpace, ImmutableSet<C> columnSpace) { // use a dense table if more than half of the cells have values // TODO(gak): tune this condition based on empirical evidence return (cellList.size() > (((long) rowSpace.size() * columnSpace.size()) / 2))
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 7.1K bytes - Viewed (0) -
android/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) -
cmd/leak-detect_test.go
// runtime stack of go routines will be listed with 2 blank spaces between each of them, so split on "\n\n" . for _, g := range strings.Split(string(buf), "\n\n") { // Again split on a new line, the first line of the second half contains the info about the go routine. sl := strings.SplitN(g, "\n", 2) if len(sl) != 2 { continue } stack := strings.TrimSpace(sl[1]) // ignore the testing go routine.
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Jan 18 07:03:17 UTC 2024 - 5.2K bytes - Viewed (0)