- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 191 for worst (0.04 sec)
-
guava/src/com/google/common/collect/CompactHashMap.java
* simply switch over to use the JDK implementation wholesale if probable hash flooding is * detected, sacrificing the compactness guarantee in very rare cases in exchange for much * more reliable worst-case behavior. * <li>null, if no entries have yet been added to the map * </ul> */ @CheckForNull private transient Object table; /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 39.7K bytes - Viewed (0) -
src/debug/dwarf/entry.go
// is not covered by any unit, SeekPC returns [ErrUnknownPC] and the // position of the reader is undefined. // // Because compilation units can describe multiple regions of the // executable, in the worst case SeekPC must search through all the // ranges in all the compilation units. Each call to SeekPC starts the // search at the compilation unit of the last call, so in general
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 18 19:33:30 UTC 2023 - 30.7K 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/collect/CompactHashMap.java
* simply switch over to use the JDK implementation wholesale if probable hash flooding is * detected, sacrificing the compactness guarantee in very rare cases in exchange for much * more reliable worst-case behavior. * <li>null, if no entries have yet been added to the map * </ul> */ @CheckForNull private transient Object table; /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 35.8K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/labels/selector.go
func (r *Requirement) String() string { var sb strings.Builder sb.Grow( // length of r.key len(r.key) + // length of 'r.operator' + 2 spaces for the worst case ('in' and 'notin') len(r.operator) + 2 + // length of 'r.strValues' slice times. Heuristically 5 chars per word +5*len(r.strValues)) if r.operator == selection.DoesNotExist { sb.WriteString("!") }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Dec 18 04:27:38 UTC 2022 - 31.8K bytes - Viewed (0) -
src/runtime/mgcsweep.go
// also sweep pages (e.g., for a large allocation), it can pass a // non-zero callerSweepPages to leave that many pages unswept. // // deductSweepCredit makes a worst-case assumption that all spanBytes // bytes of the ultimately allocated span will be available for object // allocation. // // deductSweepCredit is the core of the "proportional sweep" system.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:52:18 UTC 2024 - 32.9K bytes - Viewed (0) -
src/strings/strings.go
// according to the mapping function. If mapping returns a negative value, the character is // dropped from the string with no replacement. func Map(mapping func(rune) rune, s string) string { // In the worst case, the string can grow when mapped, making // things unpleasant. But it's so rare we barge in assuming it's // fine. It could also shrink but that falls out naturally.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 16:48:16 UTC 2024 - 31.2K bytes - Viewed (0) -
pkg/scheduler/internal/queue/scheduling_queue_test.go
// never gets executed. // - in worst case, make both ends (of the intersection) a big number,i.e., // M intersected with N instead of M with 1 (or 1 with N) // - in random case, each pod failed by a random plugin, and also the moveEvent // is randomized. if tt.name == "baseline" { podInfo = q.newQueuedPodInfo(p) } else if tt.name == "worst" { // Each pod failed by all plugins.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 13:26:09 UTC 2024 - 146.9K bytes - Viewed (0) -
src/math/big/natdiv.go
That's the entirety of long division: scale the inputs, and then loop over each output position, guessing, checking, and correcting the next output digit. For a 2n-digit number divided by an n-digit number (the worst size-n case for division complexity), this algorithm uses n+1 iterations, each of which must do at least the 1-by-n-digit multiplication q̂·v. That's O(n) iterations of O(n) time each, so O(n²) time overall.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K 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)