- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 520 for measure (0.14 sec)
-
src/runtime/runtime_test.go
// confusing the benchmarking framework for small b.N. b.StopTimer() stop() }) } } // Measure the cost of counting goroutines b.Run("small-nil", run(func() bool { GoroutineProfile(nil) return true })) // Measure the cost with a small set of goroutines n := NumGoroutine() p := make([]StackRecord, 2*n+2*GOMAXPROCS(0)) b.Run("small", run(func() bool {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 11.7K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/cel/library/cost.go
// improvement here would be to somehow get a count the number of expressions in the regex or // how many states are in the regex state machine and use that to measure regex cost). // For now, we're making a guess that each expression in a regex is typically at least 4 chars // in length. regexCost := uint64(math.Ceil(float64(actualSize(args[1])) * common.RegexStringLengthCostFactor))
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/cmd/compile/internal/types2/signature.go
} } else if len(tparams) < len(recvTParams) { // Reporting an error here is a stop-gap measure to avoid crashes in the // compiler when a type parameter/argument cannot be inferred later. It // may lead to follow-on errors (see issues go.dev/issue/51339, go.dev/issue/51343). // TODO(gri) find a better solution got := measure(len(tparams), "type parameter")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 21:33:05 UTC 2024 - 12.6K bytes - Viewed (0) -
platforms/core-runtime/internal-instrumentation-processor/src/main/java/org/gradle/internal/instrumentation/processor/AbstractInstrumentationProcessor.java
.map(it -> (ExecutableElement) it) // Ensure that the elements have a stable order, as the annotation processing engine does not guarantee that for type elements. // The order in which the executable elements are listed should be the order in which they appear in the code but // we take an extra measure of care here and ensure the ordering between all elements.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue May 28 13:09:40 UTC 2024 - 10.3K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/admission/plugin/resourcequota/controller.go
// as a result, we need to measure the usage of this object for quota // on updates, we need to subtract the previous measured usage // if usage shows no change, just return since it has no impact on quota deltaUsage, err := evaluator.Usage(inputObject) if err != nil { return quotas, err }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 25.8K bytes - Viewed (0) -
pilot/pkg/xds/bench_test.go
}, { // Knative Gateway simulates a full Knative routing setup. There have been a variety of performance issues and optimizations // around Knative's somewhat abnormal usage, so its good to keep track and measure Name: "knative-gateway", Services: 100, ProxyType: model.Router, }, // Testing different port types { Name: "http", Services: 100, }, { Name: "tcp",
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Apr 22 18:13:40 UTC 2024 - 19.7K bytes - Viewed (0) -
src/math/rand/rand_test.go
p := make([]int, 30) for i := range p { p[i] = i } r.Shuffle(30, func(i, j int) { p[i], p[j] = p[j], p[i] }) } } // BenchmarkShuffleOverhead uses a minimal swap function // to measure just the shuffling overhead. func BenchmarkShuffleOverhead(b *testing.B) { r := New(NewSource(1)) for n := b.N; n > 0; n-- { r.Shuffle(52, func(i, j int) { if i < 0 || i >= 52 || j < 0 || j >= 52 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 16.9K bytes - Viewed (0) -
src/runtime/mgclimit.go
// Otherwise, it returns true. // // The caller must be non-preemptible until at least stop is called or this function // returns false. Because this is trying to measure "on-CPU" time of some event, getting // scheduled away during it can mean that whatever we're measuring isn't a reflection // of "on-CPU" time. The OS could deschedule us at any time, but we want to maintain as
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 22:07:41 UTC 2024 - 17.3K bytes - Viewed (0) -
src/runtime/metrics/doc.go
Estimated total CPU time spent performing GC tasks on spare CPU resources that the Go scheduler could not otherwise find a use for. This should be subtracted from the total GC CPU time to obtain a measure of compulsory GC CPU time. This metric is an overestimate, and not directly comparable to system CPU time measurements. Compare only with other /cpu/classes metrics. /cpu/classes/gc/pause:cpu-seconds
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:58:43 UTC 2024 - 20K bytes - Viewed (0) -
src/testing/benchmark.go
n = min(n, 1e9) b.runN(int(n)) } } b.result = BenchmarkResult{b.N, b.duration, b.bytes, b.netAllocs, b.netBytes, b.extra} } // Elapsed returns the measured elapsed time of the benchmark. // The duration reported by Elapsed matches the one measured by // [B.StartTimer], [B.StopTimer], and [B.ResetTimer]. func (b *B) Elapsed() time.Duration { d := b.duration if b.timerOn { d += highPrecisionTimeSince(b.start)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 23.9K bytes - Viewed (0)