- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 98 for Approximates (0.54 sec)
-
src/cmd/vendor/golang.org/x/text/cases/info.go
// (e.g. [ALetter] [ExtendNumLet] [Katakana] [ExtendNumLet] [ALetter] and // [ALetter] [Numeric] [MidNum] [Numeric] [ALetter].) // // Note 2: the rule for Mid is very approximate, but works in most cases. To // improve, we could store the categories in the trie value and use a FA to // manage breaks. See TODO comment above. // // Note 3: according to the spec, it is possible for the Extend category to
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 2.9K bytes - Viewed (0) -
platforms/core-configuration/kotlin-dsl/src/test/kotlin/org/gradle/kotlin/dsl/resolver/SourcePathProviderTest.kt
/** * This unit test can't rely on `BuildSrcClassPathModeConfigurationAction` * it is testing the fallback behavior of [SourcePathProvider] */ @Test fun `given buildSrc folder, it will fallback to approximate buildSrc source roots`() { withFolders { "project" { "buildSrc/src/main" { +"foo" +"bar" } }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Dec 19 17:35:41 UTC 2023 - 7.1K bytes - Viewed (0) -
src/math/erf.go
// Remark: here we use the taylor series expansion at x=1. // erf(1+s) = erf(1) + s*Poly(s) // = 0.845.. + P1(s)/Q1(s) // That is, we use rational approximation to approximate // erf(1+s) - (c = (single)0.84506291151) // Note that |P1/Q1|< 0.078 for x in [0.84375,1.25] // where // P1(s) = degree 6 poly in s
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 11.5K bytes - Viewed (0) -
src/math/log.go
// Let s = f/(2+f) ; based on log(1+f) = log(1+s) - log(1-s) // = 2s + 2/3 s**3 + 2/5 s**5 + ....., // = 2s + s*R // We use a special Reme algorithm on [0,0.1716] to generate // a polynomial of degree 14 to approximate R. The maximum error // of this polynomial approximation is bounded by 2**-58.45. In // other words, // 2 4 6 8 10 12 14 // R(z) ~ L1*s +L2*s +L3*s +L4*s +L5*s +L6*s +L7*s
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 3.9K bytes - Viewed (0) -
platforms/core-execution/workers/src/main/java/org/gradle/workers/internal/WorkerDaemonExpiration.java
if (parsed != -1) { // From fork options return parsed; } // If we don't know what the max heap is, approximate it based on OS total memory // according to JVM documentation if (osTotalMemory != -1) { return new MaximumHeapHelper().getDefaultMaximumHeapSize(osTotalMemory); }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 09:36:27 UTC 2023 - 5.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/stablehlo/tests/composite-lowering.mlir
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Jun 06 18:45:51 UTC 2024 - 32.6K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/unsafeptr/unsafeptr.go
// p := unsafe.Pointer(x.Data) // because in the middle the garbage collector doesn't // see x.Data as a pointer and so x.Data may be dangling // by the time we get to the conversion at the end. // For now approximate by saying that *Header is okay // but Header is not. pt, ok := aliases.Unalias(info.Types[x.X].Type).(*types.Pointer) if ok && isReflectHeader(pt.Elem()) { return true } case *ast.CallExpr:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 4.7K bytes - Viewed (0) -
src/math/gamma.go
// returned in a global (extern) variable named signgam. // This variable is also filled in by the logarithmic gamma // function lgamma(). // // Arguments |x| <= 34 are reduced by recurrence and the function // approximated by a rational function of degree 6/7 in the // interval (2,3). Large arguments are handled by Stirling's // formula. Large negative arguments are made positive using // a reflection formula. // // ACCURACY: //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 5.5K bytes - Viewed (0) -
src/math/exp.go
// the interval [0,0.34658]: // Write // R(r**2) = r*(exp(r)+1)/(exp(r)-1) = 2 + r*r/6 - r**4/360 + ... // We use a special Remez algorithm on [0,0.34658] to generate // a polynomial of degree 5 to approximate R. The maximum error // of this polynomial approximation is bounded by 2**-59. In // other words, // R(z) ~ 2.0 + P1*z + P2*z**2 + P3*z**3 + P4*z**4 + P5*z**5
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 5.4K bytes - Viewed (0) -
src/runtime/metrics/description.go
"the runtime/debug.SetMemoryLimit function.", Kind: KindUint64, }, { Name: "/gc/heap/allocs-by-size:bytes", Description: "Distribution of heap allocations by approximate size. " + "Bucket counts increase monotonically. " + "Note that this does not include tiny objects as defined by " + "/gc/heap/tiny/allocs:objects, only tiny blocks.", Kind: KindFloat64Histogram,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Dec 06 17:59:12 UTC 2023 - 19.6K bytes - Viewed (0)