- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 27 for Approximates (0.5 sec)
-
analysis/analysis-api/src/org/jetbrains/kotlin/analysis/api/components/KtTypeProvider.kt
public interface KaTypeProviderMixIn : KaSessionMixIn { public val builtinTypes: KaBuiltinTypes get() = withValidityAssertion { analysisSession.typeProvider.builtinTypes } /** * Approximates [KaType] with a supertype which can be rendered in a source code * * Return `null` if the type do not need approximation and can be rendered as is
Registered: Wed Jun 12 09:53:16 UTC 2024 - Last Modified: Tue Jun 11 15:45:42 UTC 2024 - 11.4K bytes - Viewed (0) -
src/crypto/rsa/rsa.go
priv.E = 65537 if nprimes < 2 { return nil, errors.New("crypto/rsa: GenerateMultiPrimeKey: nprimes must be >= 2") } if bits < 64 { primeLimit := float64(uint64(1) << uint(bits/nprimes)) // pi approximates the number of primes less than primeLimit pi := primeLimit / (math.Log(primeLimit) - 1) // Generated primes start with 11 (in binary) so we can only // use a quarter of them. pi /= 4
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:11:18 UTC 2024 - 23.4K 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) -
analysis/analysis-api-fir/src/org/jetbrains/kotlin/analysis/api/fir/components/KtFirPsiTypeProvider.kt
} val needLocalTypeApproximation = needLocalTypeApproximation(visibilityForApproximation, isInlineFunction, session, useSitePosition) // TODO: can we approximate local types in type arguments *selectively* ? currentType = PublicTypeApproximator.approximateTypeToPublicDenotable(currentType, session, needLocalTypeApproximation) ?: currentType
Registered: Wed Jun 12 09:53:16 UTC 2024 - Last Modified: Wed May 29 20:26:34 UTC 2024 - 18.4K bytes - Viewed (0) -
guava/src/com/google/common/primitives/UnsignedLongs.java
} } // Optimization - use signed division if dividend < 2^63 if (dividend >= 0) { return dividend / divisor; } /* * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is * guaranteed to be either exact or one less than the correct value. This follows from fact that
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 17.6K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedLongs.java
} } // Optimization - use signed division if dividend < 2^63 if (dividend >= 0) { return dividend / divisor; } /* * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is * guaranteed to be either exact or one less than the correct value. This follows from fact that
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 17.6K bytes - Viewed (0) -
src/runtime/metrics/doc.go
math.MaxInt64. This value is set by the GOMEMLIMIT environment variable, and the runtime/debug.SetMemoryLimit function. /gc/heap/allocs-by-size:bytes 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. /gc/heap/allocs:bytes
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:58:43 UTC 2024 - 20K bytes - Viewed (0) -
src/cmd/gofmt/gofmt.go
// it from rlimit on platforms that support that system call. // // File descriptors opened from outside of this package are not tracked, // so this limit may be approximate. var fdSem = make(chan bool, 200) var ( rewrite func(*token.FileSet, *ast.File) *ast.File parserMode parser.Mode ) func usage() { fmt.Fprintf(os.Stderr, "usage: gofmt [flags] [path ...]\n")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 14 19:41:17 UTC 2024 - 15.1K 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)