- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 64 for worst (1.62 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) -
guava/src/com/google/common/collect/TopKSelector.java
* offering expected O(n + k log k) performance (worst case O(n log k)) for n calls to {@link * #offer} and a call to {@link #topK}, with O(k) memory. In comparison, quickselect has the same * asymptotics but requires O(n) memory, and a {@code PriorityQueue} implementation takes O(n log * k). In benchmarks, this implementation performs at least as well as either implementation, and * degrades more gracefully for worst-case input. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K 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/TopKSelector.java
* offering expected O(n + k log k) performance (worst case O(n log k)) for n calls to {@link * #offer} and a call to {@link #topK}, with O(k) memory. In comparison, quickselect has the same * asymptotics but requires O(n) memory, and a {@code PriorityQueue} implementation takes O(n log * k). In benchmarks, this implementation performs at least as well as either implementation, and * degrades more gracefully for worst-case input. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K 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) -
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} * @since 22.0
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Apr 11 08:42:51 UTC 2024 - 10.7K 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) -
pkg/config/validation/envoyfilter/envoyfilter.go
requiresTypedConfig = requiresTypedConfig || field.JSONName() == "typedConfig" // Note: it is possible there is some API that has typedConfig but has a non-deprecated alternative, // but I couldn't find any. Worst case, this is a warning, not an error, so a false positive is not so bad. // The one exception is configDiscovery (used for ECDS) if field.JSONName() == "typedConfig" && set { hasTypedConfig = true }
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Sat Mar 30 00:31:03 UTC 2024 - 12.2K 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) -
pkg/api/testing/defaulting_test.go
} if iter > 300 { t.Errorf("expected %s to trigger defaulting due to fuzzing", gvk) break } // if we expected defaulting, continue looping until the fuzzer gives us one // at worst, we will timeout } iter++ src, err := scheme.New(gvk) if err != nil { t.Fatal(err) } f.Fuzz(src) src.GetObjectKind().SetGroupVersionKind(schema.GroupVersionKind{})
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Mar 06 00:00:21 UTC 2024 - 20.3K bytes - Viewed (0)