- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 180 for arithmetic (0.26 sec)
-
src/math/sincos.go
if j&1 == 1 { // map zeros to origin j++ y++ } j &= 7 // octant modulo 2Pi radians (360 degrees) z = ((x - y*PI4A) - y*PI4B) - y*PI4C // Extended precision modular arithmetic } if j > 3 { // reflect in x axis j -= 4 sinSign, cosSign = !sinSign, !cosSign } if j > 1 { cosSign = !cosSign } zz := z * z
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 1.8K bytes - Viewed (0) -
guava/src/com/google/common/hash/Fingerprint2011.java
* fingerprint at 4.0 microseconds and md5 at 4.5 microseconds. * * <p>Note to maintainers: This implementation relies on signed arithmetic being bit-wise equivalent * to unsigned arithmetic in all cases except: * * <ul> * <li>comparisons (signed values can be negative) * <li>division (avoided here) * <li>shifting (right shift must be unsigned) * </ul> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Dec 28 17:50:25 UTC 2021 - 6.5K bytes - Viewed (0) -
src/strconv/ftoaryu.go
d.dp -= q } // mulByLog2Log10 returns math.Floor(x * log(2)/log(10)) for an integer x in // the range -1600 <= x && x <= +1600. // // The range restriction lets us work in faster integer arithmetic instead of // slower floating point arithmetic. Correctness is verified by unit tests. func mulByLog2Log10(x int) int { // log(2)/log(10) ≈ 0.30102999566 ≈ 78913 / 2^18 return (x * 78913) >> 18 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 09 00:28:56 UTC 2022 - 15.7K bytes - Viewed (0) -
guava/src/com/google/common/math/LongMath.java
return (int) x == x; } /** * Returns the arithmetic mean of {@code x} and {@code y}, rounded toward negative infinity. This * method is resilient to overflow. * * @since 14.0 */ public static long mean(long x, long y) { // Efficient method for computing the arithmetic mean. // The alternative (x + y) / 2 fails for large values.
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/math/remainder.go
// is preserved. // ==================================================== // // __ieee754_remainder(x,y) // Return : // returns x REM y = x - [x/y]*y as if in infinite // precision arithmetic, where [x/y] is the (infinite bit) // integer nearest x/y (in half way cases, choose the even one). // Method : // Based on Mod() returning x - [x/y]chopped * y exactly.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
return (int) x == x; } /** * Returns the arithmetic mean of {@code x} and {@code y}, rounded toward negative infinity. This * method is resilient to overflow. * * @since 14.0 */ public static long mean(long x, long y) { // Efficient method for computing the arithmetic mean. // The alternative (x + y) / 2 fails for large values.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 44.6K bytes - Viewed (0) -
test/escape_unsafe.go
func convert(p *float64) *uint64 { // ERROR "leaking param: p to result ~r0 level=0$" return (*uint64)(unsafe.Pointer(p)) } // (3) Conversion of a Pointer to a uintptr and back, with arithmetic. func arithAdd() unsafe.Pointer { var x [2]byte // ERROR "moved to heap: x" return unsafe.Pointer(uintptr(unsafe.Pointer(&x[0])) + 1) } func arithSub() unsafe.Pointer {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Sep 07 17:25:59 UTC 2022 - 2.2K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Fingerprint2011.java
* fingerprint at 4.0 microseconds and md5 at 4.5 microseconds. * * <p>Note to maintainers: This implementation relies on signed arithmetic being bit-wise equivalent * to unsigned arithmetic in all cases except: * * <ul> * <li>comparisons (signed values can be negative) * <li>division (avoided here) * <li>shifting (right shift must be unsigned) * </ul> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Dec 28 17:50:25 UTC 2021 - 6.5K bytes - Viewed (0) -
src/cmd/compile/internal/test/testdata/gen/arithBoundaryGen.go
// Copyright 2015 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // This program generates a test to verify that the standard arithmetic // operators properly handle some special cases. The test file should be // generated with a known working version of go. // launch with `go run arithBoundaryGen.go` a file called arithBoundary.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 20 02:13:02 UTC 2022 - 5.5K bytes - Viewed (0) -
src/math/cmplx/pow.go
// // Raises complex A to the complex Zth power. // Definition is per AMS55 # 4.2.8, // analytically equivalent to cpow(a,z) = cexp(z clog(a)). // // ACCURACY: // // Relative error: // arithmetic domain # trials peak rms // IEEE -10,+10 30000 9.4e-15 1.5e-15 // Pow returns x**y, the base-x exponential of y. // For generalized compatibility with [math.Pow]: //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 2.3K bytes - Viewed (0)