- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 22 for worst (0.08 sec)
-
src/runtime/mgcpacer.go
// heuristic anyway. Furthermore, no part of the heuristic depends on // the two assist ratio values being exact reciprocals of one another, since // the two values are used to convert values from different sources. // // The worst case result of this raciness is that we may miss a larger shift // in the ratio (say, if we decide to pace more aggressively against the // hard heap goal) but even this "hard goal" is best-effort (see #40460).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 55.4K bytes - Viewed (0) -
src/net/url/url_test.go
&URL{ Scheme: "mysql", Host: "a,b,c", Path: "/bar", }, "", }, // worst case host, still round trips { "scheme://!$&'()*+,;=hello!:1/path", &URL{ Scheme: "scheme", Host: "!$&'()*+,;=hello!:1", Path: "/path", }, "", }, // worst case path, still round trips { "http://host/!$&'()*+,;=:@[hello]", &URL{ Scheme: "http",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:52:38 UTC 2024 - 52.1K bytes - Viewed (0) -
src/runtime/malloc.go
// Current setting is 16 bytes, which relates to 2x worst case memory // wastage (when all but one subobjects are unreachable). // 8 bytes would result in no wastage at all, but provides less // opportunities for combining. // 32 bytes provides more opportunities for combining, // but can lead to 4x worst case wastage. // The best case winning is 8x regardless of block size. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 59.6K bytes - Viewed (0) -
android/guava/src/com/google/common/base/CharMatcher.java
* negation is cheaper to precompute than the matcher itself; it tries to build small hash tables * for matchers that only match a few characters, and so on. In the worst-case scenario, it * constructs an eight-kilobyte bit array and queries that. In many situations this produces a * matcher which is faster to query than the original. */ @GwtIncompatible // SmallCharMatcher
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:49:48 UTC 2024 - 53.7K bytes - Viewed (0) -
guava/src/com/google/common/base/CharMatcher.java
* negation is cheaper to precompute than the matcher itself; it tries to build small hash tables * for matchers that only match a few characters, and so on. In the worst-case scenario, it * constructs an eight-kilobyte bit array and queries that. In many situations this produces a * matcher which is faster to query than the original. */ @GwtIncompatible // SmallCharMatcher
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:49:48 UTC 2024 - 53.8K bytes - Viewed (0) -
src/cmd/link/internal/ld/xcoff.go
// for File Header, Auxiliary Header, and Section Headers. // May waste some. XCOFFHDRRESERVE = FILHSZ_64 + AOUTHSZ_EXEC64 + SCNHSZ_64*23 // base on dump -o, then rounded from 32B to 64B to // match worst case elf text section alignment on ppc64. XCOFFSECTALIGN int64 = 64 // XCOFF binaries should normally have all its sections position-independent.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Dec 01 19:58:23 UTC 2023 - 51.8K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/storage/cacher/cacher.go
// to determine whether a given feature is supported, // we may receive a positive response even if the feature is not supported. // // In this very rare scenario, the worst case will be that this // request will wait for 3 seconds before it fails. if etcdfeature.DefaultFeatureSupportChecker.Supports(storage.RequestWatchProgress) && c.watchCache.notFresh(requestedWatchRV) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 10:12:02 UTC 2024 - 51.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
} } } /** * Marks the given node as 'deleted' (null waiter) and then scans the list to unlink all deleted * nodes. This is an O(n) operation in the common case (and O(n^2) in the worst), but we are saved * by two things. * * <ul> * <li>This is only called when a waiting thread times out or is interrupted. Both of which * should be rare.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 63.1K bytes - Viewed (1) -
guava/src/com/google/common/util/concurrent/AbstractFuture.java
} } } /** * Marks the given node as 'deleted' (null waiter) and then scans the list to unlink all deleted * nodes. This is an O(n) operation in the common case (and O(n^2) in the worst), but we are saved * by two things. * * <ul> * <li>This is only called when a waiting thread times out or is interrupted. Both of which * should be rare.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 62.8K bytes - Viewed (1) -
src/runtime/mgcscavenge.go
// scavenging throughput. // // The current value is chosen assuming a cost of ~10µs/physical page // (this is somewhat pessimistic), which implies a worst-case latency of // about 160µs for 4 KiB physical pages. The current value is biased // toward latency over throughput. const scavengeQuantum = 64 << 10 // Accumulate the amount of time spent scavenging.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:48:45 UTC 2024 - 52.3K bytes - Viewed (0)