- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 40 for worst (0.07 sec)
-
src/internal/trace/gc.go
acc.mmu = mu } acc.bound = acc.mmu if acc.nWorst == 0 { // If the minimum has reached zero, it can't go any // lower, so we can stop early. return mu == 0 } // Consider adding this window to the n worst. if len(acc.wHeap) < acc.nWorst || mu < acc.wHeap[0].MutatorUtil { // This window is lower than the K'th worst window. // // Check if there's any overlapping window
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 26K bytes - Viewed (0) -
staging/src/k8s.io/apiextensions-apiserver/pkg/apiserver/schema/cel/compilation.go
Error *apiservercel.Error // If true, the compiled expression contains a reference to the identifier "oldSelf". UsesOldSelf bool // Represents the worst-case cost of the compiled expression in terms of CEL's cost units, as used by cel.EstimateCost. MaxCost uint64 // MaxCardinality represents the worse case number of times this validation rule could be invoked if contained under an // unbounded map or list in an OpenAPIv3 schema. MaxCardinality uint64
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 16 20:13:14 UTC 2024 - 13.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Comparators.java
* .collect(least(2, comparingInt(String::length))) * // returns {"foo", "quux"} * }</pre> * * <p>This {@code Collector} uses O(k) memory and takes expected time O(n) (worst-case O(n log * k)), as opposed to e.g. {@code Stream.sorted(comparator).limit(k)}, which currently takes O(n * log n) time and O(n) space. * * @throws IllegalArgumentException if {@code k < 0}
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 10.1K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/cel/library/cost.go
return &checker.CallEstimate{CostEstimate: sz.MultiplyByCostFactor(2 * common.StringTraversalCostFactor), ResultSize: &size} } case "split": if target != nil { sz := l.sizeEstimate(*target) // Worst case size is where is that a separator of "" is used, and each char is returned as a list element. max := sz.Max if len(args) > 1 { if v := args[1].Expr().AsLiteral(); v != nil {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Apr 23 17:22:44 UTC 2024 - 20.6K bytes - Viewed (0) -
src/math/big/arith_ppc64x.s
BEQ tail // If R5 = 0, we can't use the loop // Process 4 elements per iteration. Unrolling this loop // means a performance trade-off: we will lose performance // for small values of z_len (0.90x in the worst case), but // gain significant performance as z_len increases (up to // 1.45x). PCALIGN $16 loop: MOVD 8(R8), R11 // R11 = x[i] MOVD 16(R8), R12 // R12 = x[i+1]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 18:17:17 UTC 2024 - 16.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
// Raising this number slows the worst-case contains behavior, speeds up hashFloodingDetected, // and reduces the false-positive probability. static final int MAX_RUN_MULTIPLIER = 13; /** * Checks the whole hash table for poor hash distribution. Takes O(n) in the worst case, O(n / * log n) on average. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 08 03:01:02 UTC 2024 - 35.3K bytes - Viewed (0) -
src/vendor/golang.org/x/net/nettest/conntest.go
c1.SetWriteDeadline(aLongTimeAgo) }() go func() { defer wg.Done() c1.LocalAddr() }() go func() { defer wg.Done() c1.RemoteAddr() }() } wg.Wait() // At worst, the deadline is set 10ms into the future resyncConn(t, c1) testRoundtrip(t, c1) } // checkForTimeoutError checks that the error satisfies the Error interface // and that Timeout returns true.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 12.2K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/storage/storagebackend/factory/etcd3.go
// Given that client is closed on shutdown we hold the lock for // the entire period of healthcheck call to ensure that client will // not be closed during healthcheck. // Given that healthchecks has a 2s timeout, worst case of blocking // shutdown for additional 2s seems acceptable. lock.RLock() defer lock.RUnlock() if clientErr != nil { return clientErr } if limiter.Allow() == false {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Apr 24 07:56:39 UTC 2024 - 15.1K bytes - Viewed (0) -
src/runtime/mbarrier.go
// performed the write barrier but before we perform the // memory copy. This safe because the write performed by that // other goroutine must also be accompanied by a write // barrier, so at worst we've unnecessarily greyed the old // pointer that was in src. memmove(dst, src, typ.Size_) if goexperiment.CgoCheck2 { cgoCheckMemmove2(typ, dst, src, 0, typ.Size_) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 15.7K bytes - Viewed (0) -
pilot/pkg/autoregistration/controller_test.go
c1.OnDisconnect(p1conn1) // stop processing the delayed close queue in c1, forces using periodic cleanup close(stop1) stopped1 = true // unfortunately, this retry at worst could be twice as long as the sweep interval retry.UntilSuccessOrFail(t, func() error { return checkNoEntry(store, wgA, p) }, retry.Timeout(time.Until(time.Now().Add(21*features.WorkloadEntryCleanupGracePeriod)))) })
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue Apr 16 00:00:36 UTC 2024 - 31.4K bytes - Viewed (0)