- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 82 for Approximates (0.29 sec)
-
okhttp/src/main/kotlin/okhttp3/Headers.kt
fun values(name: String): List<String> = commonValues(name) /** * Returns the number of bytes required to encode these headers using HTTP/1.1. This is also the * approximate size of HTTP/2 headers before they are compressed with HPACK. This value is * intended to be used as a metric: smaller headers are more efficient to encode and transmit. */ fun byteCount(): Long {
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
* that minimizes the need for remapping as {@code buckets} grows. That is, {@code * consistentHash(h, n)} equals: * * <ul> * <li>{@code n - 1}, with approximate probability {@code 1/n} * <li>{@code consistentHash(h, n - 1)}, otherwise (probability {@code 1 - 1/n}) * </ul> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 09 00:37:15 UTC 2024 - 29.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/analysis/side_effect_analysis.h
// Converts from read/write state that relates ops with the same parallel id // to a set of last accesses for use with other parallel ids. Reads/writes // between parallel ids are conservatively approximated as writes. absl::flat_hash_set<Operation*> GetLastWrites(ResourceId resource_id); // Sets the read/write state for ops within the same parallel id. void SetLastWrites(ResourceId resource_id,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 15 09:04:13 UTC 2024 - 14.8K bytes - Viewed (0) -
guava/src/com/google/common/hash/Hashing.java
* that minimizes the need for remapping as {@code buckets} grows. That is, {@code * consistentHash(h, n)} equals: * * <ul> * <li>{@code n - 1}, with approximate probability {@code 1/n} * <li>{@code consistentHash(h, n - 1)}, otherwise (probability {@code 1 - 1/n}) * </ul> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 09 00:37:15 UTC 2024 - 32.3K bytes - Viewed (0) -
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)