- Sort Score
- Result 10 results
- Languages All
Results 121 - 130 of 3,877 for measure (0.26 sec)
-
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/unicode/letter_test.go
// Find the point where binary search wins by more than 10%. // The 10% bias gives linear search an edge when they're close, // because on predominantly ASCII inputs linear search is even // better than our benchmarks measure. n := sort.Search(64, func(n int) bool { tab := fakeTable(n) blinear := func(b *testing.B) { tab := tab max := n*5 + 20 for i := 0; i < b.N; i++ { for j := 0; j <= max; j++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Sep 09 01:46:03 UTC 2023 - 14.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* calling thread wait for that time. * * The simplest way to maintain a rate of QPS is to keep the timestamp of the last granted * request, and ensure that (1/QPS) seconds have elapsed since then. For example, for a rate of * QPS=5 (5 tokens per second), if we ensure that a request isn't granted earlier than 200ms after * the last one, then we achieve the intended rate. If a request comes and the last request was
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 04 09:45:04 UTC 2023 - 19.3K bytes - Viewed (0) -
src/debug/dwarf/entry_test.go
// The input above is malformed; the goal here it just to make sure // that we don't get a panic or other bad behavior while trying to // construct a dwarf.Data object from the input. For good measure, // test to make sure we can handle the case where the input is // truncated as well. for i := 0; i <= len(info); i++ { truncated := info[:i] dw, err := New(abbrev, aranges, frame, truncated, nil, nil, nil, nil)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 18 20:34:36 UTC 2023 - 16.1K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/internal/language/parse.go
varIDBuf := [4]uint8{} variantBuf := [4][]byte{} varID := varIDBuf[:0] variant := variantBuf[:0] last := -1 needSort := false for ; len(scan.token) >= 4; scan.scan() { // TODO: measure the impact of needing this conversion and redesign // the data structure if there is an issue. v, ok := variantIndex[string(scan.token)] if !ok { // unknown variant // TODO: allow user-defined variants?
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 14.9K 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) -
pkg/kubelet/eviction/eviction_manager.go
nodeConditionsLastObservedAt nodeConditionsObservedAt // nodeRef is a reference to the node nodeRef *v1.ObjectReference // used to record events about the node recorder record.EventRecorder // used to measure usage stats on system summaryProvider stats.SummaryProvider // records when a threshold was first observed thresholdsFirstObservedAt thresholdsObservedAt
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Mar 27 18:55:56 UTC 2024 - 24.6K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/RateLimiter.java
RateLimiter rateLimiter = new SmoothWarmingUp(stopwatch, warmupPeriod, unit, coldFactor); rateLimiter.setRate(permitsPerSecond); return rateLimiter; } /** * The underlying timer; used both to measure elapsed time and sleep as necessary. A separate * object to facilitate testing. */ private final SleepingStopwatch stopwatch;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 04 09:45:04 UTC 2023 - 21.5K 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/description.go
"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.", Kind: KindFloat64,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Dec 06 17:59:12 UTC 2023 - 19.6K bytes - Viewed (0)