- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 98 for Approximates (0.61 sec)
-
src/math/rand/rand_test.go
for _, have := range counts { err := float64(have) - want χ2 += err * err } χ2 /= want samples[i] = χ2 } // Check that our samples approximate the appropriate normal distribution. dof := float64(nfact - 1) expected := &statsResults{mean: dof, stddev: math.Sqrt(2 * dof)} errorScale := max(1.0, expected.stddev)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 16.9K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/storage/value/encrypt/envelope/kmsv2/envelope.go
// DEK entries, but that cache has an aggressive TTL to keep the size under control. // with DEK/seed reuse and no storage migration, the number of entries in this cache // would be approximated by unique key IDs used by the KMS plugin // combined with the number of server restarts. If storage migration // is performed after key ID changes, and the number of restarts
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Oct 27 00:23:50 UTC 2023 - 18.7K bytes - Viewed (0) -
src/math/big/natconv.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 14.6K bytes - Viewed (0) -
src/go/constant/value.go
s = fmt.Sprintf("%g", x) } return s } // Out of float64 range. Do approximate manual to decimal // conversion to avoid precise but possibly slow Float // formatting. // f = mant * 2**exp var mant big.Float exp := f.MantExp(&mant) // 0.5 <= |mant| < 1.0 // approximate float64 mantissa m and decimal exponent d // f ~ m * 10**d
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:03 UTC 2023 - 34K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/magic.go
// integer arithmetic. Let's instead compute 2^e/c // for a value of e TBD (^ = exponentiation). Then // ⎣x / c⎦ = ⎣x * (2^e/c) / 2^e⎦. // Dividing by 2^e is easy. 2^e/c isn't an integer, unfortunately. // So we must approximate it. Let's call its approximation m. // We'll then compute // ⎣x * m / 2^e⎦ // Which we want to be equal to ⎣x / c⎦ for 0 <= x < 2^n-1 // where n is the word size. // Setting x = c gives us c * m >= 2^e.
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/hash/BloomFilter.java
import java.util.stream.Collector; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * A Bloom filter for instances of {@code T}. A Bloom filter offers an approximate containment test * with one-sided error: if it claims that an element is contained in it, this might be in error, * but if it claims that an element is <i>not</i> contained in it, then this is definitely true. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 26.3K bytes - Viewed (0) -
src/math/rand/v2/rand_test.go
for _, have := range counts { err := float64(have) - want χ2 += err * err } χ2 /= want samples[i] = χ2 } // Check that our samples approximate the appropriate normal distribution. dof := float64(nfact - 1) expected := &statsResults{mean: dof, stddev: math.Sqrt(2 * dof)} errorScale := max(1.0, expected.stddev)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 17.4K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
import java.math.RoundingMode; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * A Bloom filter for instances of {@code T}. A Bloom filter offers an approximate containment test * with one-sided error: if it claims that an element is contained in it, this might be in error, * but if it claims that an element is <i>not</i> contained in it, then this is definitely true. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 23.1K bytes - Viewed (0) -
staging/src/k8s.io/cli-runtime/pkg/resource/visitor.go
if err != nil { if !ignoreError { return err } } else { i.ResourceVersion = version } i.Object = obj return nil } // ObjectName returns an approximate form of the resource's kind/name. func (i *Info) ObjectName() string { if i.Mapping != nil { return fmt.Sprintf("%s/%s", i.Mapping.Resource.Resource, i.Name) } gvk := i.Object.GetObjectKind().GroupVersionKind()
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Jul 03 10:17:56 UTC 2023 - 21.3K bytes - Viewed (0) -
src/runtime/extern.go
This increases tracer overhead, but could be helpful as a workaround or for debugging unexpected regressions caused by frame pointer unwinding. traceadvanceperiod: the approximate period in nanoseconds between trace generations. Only applies if a program is built with GOEXPERIMENT=exectracer2. Used primarily for testing and debugging the execution tracer.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:52:17 UTC 2024 - 18.9K bytes - Viewed (0)