- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 3,877 for measure (0.13 sec)
-
subprojects/core/src/main/java/org/gradle/internal/classpath/transforms/LambdaSerializationTransformer.java
// This limit is 255 arguments as of Java 20. Deserializing that many is not a problem for the current implementation. // The check is here as a future-proofing measure, in case the limit is relaxed or the generated code size grows. if (codeSizeSoFar == 0) { // This is the first lambda to process in this method, but it doesn't fit already - cannot proceed.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Oct 04 14:26:38 UTC 2023 - 15.6K bytes - Viewed (0) -
pkg/proxy/endpointschangetracker.go
// ensure that no further traffic for the Service gets delivered to them. DeletedUDPEndpoints []ServiceEndpoint // NewlyActiveUDPServices identifies UDP Services that have just gone from 0 to // non-0 endpoints. Existing conntrack entries caching the fact that these // services are black holes must be deleted to ensure that traffic can immediately // begin flowing to the new endpoints.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Dec 21 14:44:08 UTC 2023 - 13.2K bytes - Viewed (0) -
pkg/kubelet/eviction/helpers.go
result = append(result, volume.Name) } } return result } // containerUsage aggregates container disk usage and inode consumption for the specified stats to measure. func containerUsage(podStats statsapi.PodStats, statsToMeasure []fsStatsType) v1.ResourceList { disk := resource.Quantity{Format: resource.BinarySI} inodes := resource.Quantity{Format: resource.DecimalSI}
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Nov 01 18:46:33 UTC 2023 - 53.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* <p>A high-quality hash function strives for some subset of the following virtues: * * <ul> * <li><b>collision-resistant:</b> while the definition above requires making at least <i>some</i> * token attempt, one measure of the quality of a hash function is <i>how well</i> it succeeds * at this goal. Important note: it may be easy to achieve the theoretical minimum collision
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 25 18:22:59 UTC 2021 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/hash/HashFunction.java
* <p>A high-quality hash function strives for some subset of the following virtues: * * <ul> * <li><b>collision-resistant:</b> while the definition above requires making at least <i>some</i> * token attempt, one measure of the quality of a hash function is <i>how well</i> it succeeds * at this goal. Important note: it may be easy to achieve the theoretical minimum collision
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 25 18:22:59 UTC 2021 - 10.9K bytes - Viewed (0) -
src/runtime/mstats.go
// c-shared and c-archive build modes and other sources of stacks from // the OS (notably, any allocated by C code) are not currently measured. // Note this too may change in the future. StackSys uint64 // Off-heap memory statistics. // // The following statistics measure runtime-internal // structures that are not allocated from heap memory (usually // because they are part of implementing the heap). Unlike
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 08 21:03:13 UTC 2024 - 34.2K bytes - Viewed (0) -
testing/internal-integ-testing/src/main/groovy/org/gradle/integtests/fixtures/executer/OutputScrapingExecutionResult.java
if (!actualText.contains(expectedText)) { if (!expectedText.contains("\n")) { Arrays.stream(actualText.split("\n")) // Measure Levenshtein distance for each line .map(line -> new LineWithDistance(line, StringUtils.getLevenshteinDistance(line, expectedText)))
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 19K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/RateLimiter.java
RateLimiter rateLimiter = new SmoothWarmingUp(stopwatch, warmupPeriod, unit, coldFactor); rateLimiter.setRate(permitsPerSecond); return rateLimiter; } /** * The underlying timer; used both to measure elapsed time and sleep as necessary. A separate * object to facilitate testing. */ private final SleepingStopwatch stopwatch;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 04 09:45:04 UTC 2023 - 18.2K bytes - Viewed (0) -
src/cmd/vendor/rsc.io/markdown/html.go
end = j + 1 } if r > unicode.MaxRune || r == 0 { r = unicode.ReplacementChar } return &Plain{string(rune(r))}, start, end, true } // Max name in list is 32 bytes. Try for 64 for good measure. for j := i + 1; j < len(s) && j-i < 64; j++ { if s[j] == '&' { // Stop possible quadratic search on &&&&&&&. break } if s[j] == ';' { if r, ok := htmlEntity[s[i:j+1]]; ok {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 11.9K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* calling thread wait for that time. * * The simplest way to maintain a rate of QPS is to keep the timestamp of the last granted * request, and ensure that (1/QPS) seconds have elapsed since then. For example, for a rate of * QPS=5 (5 tokens per second), if we ensure that a request isn't granted earlier than 200ms after * the last one, then we achieve the intended rate. If a request comes and the last request was
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 04 09:45:04 UTC 2023 - 19.3K bytes - Viewed (0)