- Sort Score
- Num 10 results
- Language All
Results 1 - 5 of 5 for Fractional (0.07 seconds)
-
android/guava/src/com/google/common/math/DoubleUtils.java
long signifFloor = twiceSignifFloor >> 1; signifFloor &= SIGNIFICAND_MASK; // remove the implied bit /* * We round up if either the fractional part of signif is strictly greater than 0.5 (which is * true if the 0.5 bit is set and any lower bit is set), or if the fractional part of signif is * >= 0.5 and signifFloor is odd (which is true if both the 0.5 bit and the 1 bit are set). */ boolean increment =
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sat Dec 21 03:10:51 GMT 2024 - 5.1K bytes - Click Count (0) -
guava/src/com/google/common/math/DoubleUtils.java
long signifFloor = twiceSignifFloor >> 1; signifFloor &= SIGNIFICAND_MASK; // remove the implied bit /* * We round up if either the fractional part of signif is strictly greater than 0.5 (which is * true if the 0.5 bit is set and any lower bit is set), or if the fractional part of signif is * >= 0.5 and signifFloor is odd (which is true if both the 0.5 bit and the 1 bit are set). */ boolean increment =
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sat Dec 21 03:10:51 GMT 2024 - 5.1K bytes - Click Count (0) -
android/guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java
private int nextRandomKey() { int a = random.nextInt(max); /* * For example, if concentration=2.0, the following takes the square root of * the uniformly-distributed random integer, then truncates any fractional * part, so higher integers would appear (in this case linearly) more often * than lower ones. */ return (int) Math.pow(a, 1.0 / concentration); } @AfterExperiment
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 3.4K bytes - Click Count (0) -
guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java
private int nextRandomKey() { int a = random.nextInt(max); /* * For example, if concentration=2.0, the following takes the square root of * the uniformly-distributed random integer, then truncates any fractional * part, so higher integers would appear (in this case linearly) more often * than lower ones. */ return (int) Math.pow(a, 1.0 / concentration); } @AfterExperiment
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 3.4K bytes - Click Count (0) -
impl/maven-cli/src/main/java/org/apache/maven/cling/transfer/AbstractMavenTransferListener.java
long nanos = duration.toNanos(); if (nanos > 0) { double seconds = nanos / (double) TimeUnit.SECONDS.toNanos(1); // Convert to fractional seconds double bytesPerSecond = contentLength / seconds; message.append(" at "); format.formatRate(message, bytesPerSecond); } message.append(')').resetStyle();
Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Tue Apr 22 22:13:51 GMT 2025 - 4.3K bytes - Click Count (0)