- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 318 for rounds (0.11 sec)
-
guava/src/com/google/common/math/LongMath.java
checkNotNull(mode); long div = p / q; // throws if q == 0 long rem = p - q * div; // equals p % q if (rem == 0) { return div; } /* * Normal Java division rounds towards 0, consistently with RoundingMode.DOWN. We just have to * deal with the cases where rounding towards 0 is wrong, which typically depends on the sign of * p / q. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 44.6K bytes - Viewed (0) -
src/crypto/tls/cipher_suites.go
// // The only potential advantages of AES-256 are better multi-target // margins, and hypothetical post-quantum properties. Neither apply to // TLS, and AES-256 is slower due to its four extra rounds (which don't // contribute to the advantages above). // // - ECDSA comes before RSA // // The relative order of ECDSA and RSA cipher suites doesn't matter,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 25.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/magic.go
// What remains is to choose e. // Let m = 2^e/c + delta, 0 <= delta < 1 // ⎣x * (2^e/c + delta) / 2^e⎦ // ⎣x / c + x * delta / 2^e⎦ // We must have x * delta / 2^e < 1/c so that this // additional term never rounds differently than ⎣x / c⎦ does. // Rearranging, // 2^e > x * delta * c // x can be at most 2^n-1 and delta can be at most 1. // So it is sufficient to have 2^e >= 2^n*c. // So we'll choose e = n + s, with s = ⎡log2(c)⎤.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:25 UTC 2024 - 15.8K bytes - Viewed (0) -
guava/src/com/google/common/math/IntMath.java
} int div = p / q; int rem = p - q * div; // equal to p % q if (rem == 0) { return div; } /* * Normal Java division rounds towards 0, consistently with RoundingMode.DOWN. We just have to * deal with the cases where rounding towards 0 is wrong, which typically depends on the sign of * p / q. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
} int div = p / q; int rem = p - q * div; // equal to p % q if (rem == 0) { return div; } /* * Normal Java division rounds towards 0, consistently with RoundingMode.DOWN. We just have to * deal with the cases where rounding towards 0 is wrong, which typically depends on the sign of * p / q. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 23.5K bytes - Viewed (0) -
src/math/rand/rand.go
// to 1<<63 that the division rounds up to 1.0, and we've guaranteed // that the result is always less than 1.0. // // We tried to fix this by mapping 1.0 back to 0.0, but since float64 // values near 0 are much denser than near 1, mapping 1 to 0 caused // a theoretically significant overshoot in the probability of returning 0. // Instead of that, if we round up to 1, just try again.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:09:08 UTC 2024 - 16.9K bytes - Viewed (0) -
src/archive/tar/common.go
func alignSparseEntries(src []sparseEntry, size int64) []sparseEntry { dst := src[:0] for _, s := range src { pos, end := s.Offset, s.endOffset() pos += blockPadding(+pos) // Round-up to nearest blockSize if end != size { end -= blockPadding(-end) // Round-down to nearest blockSize } if pos < end { dst = append(dst, sparseEntry{Offset: pos, Length: end - pos}) } } return dst }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 15 16:01:50 UTC 2024 - 24.7K bytes - Viewed (0) -
src/runtime/proc_test.go
} go func() { e, i := runtime.LockOSCounts() if e != 0 || i != 0 { t.Errorf("want locked counts 0, 0; got %d, %d", e, i) return } runtime.LockOSThread() runtime.LockOSThread() runtime.UnlockOSThread() e, i = runtime.LockOSCounts() if e != 1 || i != 0 { t.Errorf("want locked counts 1, 0; got %d, %d", e, i) return } runtime.UnlockOSThread() e, i = runtime.LockOSCounts()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 14 00:03:57 UTC 2023 - 25.8K bytes - Viewed (0) -
src/runtime/stack.go
adjustframe(&u.frame, &adjinfo) } // free old stack if stackPoisonCopy != 0 { fillstack(old, 0xfc) } stackfree(old) } // round x up to a power of 2. func round2(x int32) int32 { s := uint(0) for 1<<s < x { s++ } return 1 << s } // Called from runtime·morestack when more stack is needed.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 41.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/genericOps.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 15:49:20 UTC 2024 - 42.6K bytes - Viewed (0)