- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 94 for half (0.03 sec)
-
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) -
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) -
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) -
guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
clock in a twinkling! Half-past one, time for dinner!' (`I only wish it was,' the March Hare said to itself in a whisper.) `That would be grand, certainly,' said Alice thoughtfully: `but then--I shouldn't be hungry for it, you know.' `Not at first, perhaps,' said the Hatter: `but you could keep it to half-past one as long as you liked.'
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Oct 29 21:35:03 UTC 2012 - 145.2K 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) -
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) -
guava/src/com/google/common/graph/EndpointPair.java
// return condition1 || condition2; if (nodeU().equals(other.nodeU())) { // check condition1 // Here's the tricky bit. We don't have to explicitly check for condition2 in this case. // Why? The second half of condition2 requires that nodeV equals other.nodeU. // We already know that nodeU equals other.nodeU. Combined with the earlier statement,
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 01 17:18:04 UTC 2021 - 8.1K 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) -
docs/changelogs/changelog_1x.md
## Version 1.2.0 _2013-08-11_ * New APIs on OkHttpClient to set default timeouts for connect and read. * Fix bug when caching SPDY responses. * Fix a bug with SPDY plus half-closed streams. (thanks kwuollett) * Fix a bug in `Content-Length` reporting for gzipped streams in the Apache HTTP client adapter. (thanks kwuollett) * Work around the Alcatel `getByInetAddress` bug (thanks k.kocel)
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Sun Feb 06 02:19:09 UTC 2022 - 6.4K bytes - Viewed (0)