- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 533 for precision (0.62 sec)
-
src/runtime/asm_386.s
TEXT runtime·breakpoint(SB),NOSPLIT,$0-0 INT $3 RET TEXT runtime·asminit(SB),NOSPLIT,$0-0 // Linux and MinGW start the FPU in extended double precision. // Other operating systems use double precision. // Change to double precision to match them, // and to match other hardware that only has double. FLDCW runtime·controlWord64(SB) RET TEXT runtime·mstart(SB),NOSPLIT|TOPFRAME,$0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 15 15:45:13 UTC 2024 - 43.1K bytes - Viewed (0) -
src/math/big/ratconv.go
func (x *Rat) RatString() string { if x.IsInt() { return x.a.String() } return x.String() } // FloatString returns a string representation of x in decimal form with prec // digits of precision after the radix point. The last digit is rounded to // nearest, with halves rounded away from zero. func (x *Rat) FloatString(prec int) string { var buf []byte if x.IsInt() { buf = x.a.Append(buf, 10)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 15 22:16:34 UTC 2023 - 12.3K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
* b) this iteration converges to floor(sqrt(x)). In fact, the number of correct digits doubles * with each iteration, so this algorithm takes O(log(digits)) iterations. * * We start out with a double-precision approximation, which may be higher or lower than the * true value. Therefore, we perform at least one Newton iteration to get a guess that's
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
src/fmt/scan.go
*v = uint32(s.scanUint(verb, 32)) case *uint64: *v = s.scanUint(verb, 64) case *uintptr: *v = uintptr(s.scanUint(verb, uintptrBits)) // Floats are tricky because you want to scan in the precision of the result, not // scan in high precision and convert, in order to preserve the correct error condition. case *float32: if s.okVerb(verb, floatVerbs, "float32") { s.SkipSpace() s.notEOF()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 21:56:20 UTC 2024 - 31.9K bytes - Viewed (0) -
guava/src/com/google/common/math/BigIntegerMath.java
* b) this iteration converges to floor(sqrt(x)). In fact, the number of correct digits doubles * with each iteration, so this algorithm takes O(log(digits)) iterations. * * We start out with a double-precision approximation, which may be higher or lower than the * true value. Therefore, we perform at least one Newton iteration to get a guess that's
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
src/internal/trace/traceviewer/emitter.go
// // "1":{"name":"main.main:30"}, // "10":{"name":"pkg.NewSession:173","parent":9}, // // The parent is omitted if 0. The trailing comma is omitted from the // last entry, but we don't need that much precision. const ( baseSize = len(`"`) + len(`":{"name":"`) + len(`"},`) // Don't count the trailing quote on the name, as that is // counted in baseSize. parentBaseSize = len(`,"parent":`) )
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 21:29:58 UTC 2023 - 20.4K bytes - Viewed (0) -
src/strconv/ftoaryu.go
package strconv import ( "math/bits" ) // binary to decimal conversion using the Ryū algorithm. // // See Ulf Adams, "Ryū: Fast Float-to-String Conversion" (doi:10.1145/3192366.3192369) // // Fixed precision formatting is a variant of the original paper's // algorithm, where a single multiplication by 10^k is required, // sharing the same rounding guarantees. // ryuFtoaFixed32 formats mant*(2^exp) with prec decimal digits.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 09 00:28:56 UTC 2022 - 15.7K bytes - Viewed (0) -
pkg/kubelet/status/status_manager.go
"pod", klog.KObj(pod), "statusDiff", cmp.Diff(podStatus, &status)) return true } // normalizeStatus normalizes nanosecond precision timestamps in podStatus // down to second precision (*RFC339NANO* -> *RFC3339*). This must be done // before comparing podStatus to the status returned by apiserver because // apiserver does not support RFC339NANO.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 02 16:27:19 UTC 2024 - 44.3K bytes - Viewed (0) -
guava/src/com/google/common/math/IntMath.java
*/ return sqrtFloor + lessThanBranchFree(halfSquare, x); default: throw new AssertionError(); } } private static int sqrtFloor(int x) { // There is no loss of precision in converting an int to a double, according to // http://java.sun.com/docs/books/jls/third_edition/html/conversions.html#5.1.2 return (int) Math.sqrt(x); } /**
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/big/natdiv.go
// Copyright 2009 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. /* Multi-precision division. Here be dragons. Given u and v, where u is n+m digits, and v is n digits (with no leading zeros), the goal is to return quo, rem such that u = quo*v + rem, where 0 ≤ rem < v. That is, quo = ⌊u/v⌋ where ⌊x⌋ denotes the floor (truncation to integer) of x,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K bytes - Viewed (0)