- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 31 for log_10 (0.34 sec)
-
src/go/doc/testdata/benchmark.go
} func max(x, y int) int { if x < y { return y } return x } // roundDown10 rounds a number down to the nearest power of 10. func roundDown10(n int) int { var tens = 0 // tens = floor(log_10(n)) for n > 10 { n = n / 10 tens++ } // result = 10^tens result := 1 for i := 0; i < tens; i++ { result *= 10 } return result }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Oct 02 02:28:27 UTC 2022 - 7.4K bytes - Viewed (0) -
src/math/log10.go
// license that can be found in the LICENSE file. package math // Log10 returns the decimal logarithm of x. // The special cases are the same as for [Log]. func Log10(x float64) float64 { if haveArchLog10 { return archLog10(x) } return log10(x) } func log10(x float64) float64 { return Log(x) * (1 / Ln10) } // Log2 returns the binary logarithm of x.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 873 bytes - Viewed (0) -
src/math/log1p.go
// // Special cases are: // // Log1p(+Inf) = +Inf // Log1p(±0) = ±0 // Log1p(-1) = -Inf // Log1p(x < -1) = NaN // Log1p(NaN) = NaN func Log1p(x float64) float64 { if haveArchLog1p { return archLog1p(x) } return log1p(x) } func log1p(x float64) float64 { const ( Sqrt2M1 = 4.142135623730950488017e-01 // Sqrt(2)-1 = 0x3fda827999fcef34
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 6.3K bytes - Viewed (0) -
src/math/cmplx/log.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 01 03:16:37 UTC 2020 - 2K bytes - Viewed (0) -
src/math/export_s390x_test.go
// license that can be found in the LICENSE file. package math // Export internal functions and variable for testing. var Log10NoVec = log10 var CosNoVec = cos var CoshNoVec = cosh var SinNoVec = sin var SinhNoVec = sinh var TanhNoVec = tanh var Log1pNovec = log1p var AtanhNovec = atanh var AcosNovec = acos var AcoshNovec = acosh var AsinNovec = asin var AsinhNovec = asinh var ErfNovec = erf
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 08 19:52:30 UTC 2017 - 732 bytes - Viewed (0) -
src/math/log1p_s390x.s
GLOBL ·log1ptab<> + 0(SB), RODATA, $128 // Log1p returns the natural logarithm of 1 plus its argument x. // It is more accurate than Log(1 + x) when x is near zero. // // Special cases are: // Log1p(+Inf) = +Inf // Log1p(±0) = ±0 // Log1p(-1) = -Inf // Log1p(x < -1) = NaN // Log1p(NaN) = NaN // The algorithm used is minimax polynomial approximation
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 16 15:34:41 UTC 2019 - 5.1K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/IntMathRoundingBenchmark.java
int j = i & ARRAY_MASK; tmp += IntMath.log2(positive[j], mode); } return tmp; } @Benchmark int log10(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += IntMath.log10(positive[j], mode); } return tmp; } @Benchmark int sqrt(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 2.6K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/BigIntegerMathRoundingBenchmark.java
int j = i & ARRAY_MASK; tmp += BigIntegerMath.log2(positive[j], mode); } return tmp; } @Benchmark int log10(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += BigIntegerMath.log10(positive[j], mode); } return tmp; } @Benchmark int sqrt(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jun 30 13:06:20 UTC 2020 - 2.8K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/BigIntegerMathRoundingBenchmark.java
int j = i & ARRAY_MASK; tmp += BigIntegerMath.log2(positive[j], mode); } return tmp; } @Benchmark int log10(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += BigIntegerMath.log10(positive[j], mode); } return tmp; } @Benchmark int sqrt(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jun 30 13:06:20 UTC 2020 - 2.8K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/LongMathRoundingBenchmark.java
int j = i & ARRAY_MASK; tmp += LongMath.log2(positive[j], mode); } return tmp; } @Benchmark int log10(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += LongMath.log10(positive[j], mode); } return tmp; } @Benchmark int sqrt(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 2.6K bytes - Viewed (0)