- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 3,147 for iterations (0.15 sec)
-
src/go/doc/testdata/testing.0.golden
func (b *B) StopTimer() // The results of a benchmark run. type BenchmarkResult struct { N int // The number of iterations. T time.Duration // The total time taken. Bytes int64 // Bytes processed in one iteration. } // Benchmark benchmarks a single function. Useful for creating ... func Benchmark(f func(b *B)) BenchmarkResult //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 13 18:45:54 UTC 2021 - 4.1K bytes - Viewed (0) -
pkg/controller/nodelifecycle/scheduler/rate_limited_queue_test.go
order = append(order, value.Value) return true, 0 }) if !reflect.DeepEqual(order, []string{"first", "third"}) { t.Fatalf("order was wrong: %v", order) } if count != 3 { t.Fatalf("unexpected iterations: %d", count) } } func TestTryRemovingWhileTry(t *testing.T) { evictor := NewRateLimitedTimedQueue(flowcontrol.NewFakeAlwaysRateLimiter()) evictor.Add("first", "11111") evictor.Add("second", "22222")
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Mar 07 17:40:33 UTC 2023 - 10K bytes - Viewed (0) -
src/internal/trace/testdata/testprog/cpu-profile.go
} } func cpuHogger(f func(x int) int, y *int, dur time.Duration) { // We only need to get one 100 Hz clock tick, so we've got // a large safety buffer. // But do at least 500 iterations (which should take about 100ms), // otherwise TestCPUProfileMultithreaded can fail if only one // thread is scheduled during the testing period. t0 := time.Now() accum := *y
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 3.8K bytes - Viewed (0) -
src/internal/runtime/atomic/atomic_test.go
} } } func TestBitwiseContended8(t *testing.T) { // Start with every bit in array set to 0. a := make([]uint8, 16) // Iterations to try. N := 1 << 16 if testing.Short() { N = 1 << 10 } // Set and then clear every bit in the array bit-by-bit in different goroutines. done := make(chan bool) for i := 0; i < 8; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 8.5K bytes - Viewed (0) -
cmd/erasure-decode_test.go
if disk == nil { continue } writers[i] = newBitrotWriter(disk, "", "testbucket", "object", erasure.ShardFileSize(length), DefaultBitrotAlgorithm, erasure.ShardSize()) } // 10000 iterations with random offsets and lengths. iterations := 10000 // Create a test file to read from. buffer := make([]byte, blockSize, 2*blockSize)
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Jan 30 20:43:25 UTC 2024 - 21.1K bytes - Viewed (0) -
src/go/types/termlist.go
// one iteration. for _, x := range xl { if x != nil { return false } } return true } // isAll reports whether the termlist xl represents the set of all types. func (xl termlist) isAll() bool { // If there's a 𝓤 term, the entire list is 𝓤. // If the termlist is in normal form, this requires at most // one iteration. for _, x := range xl {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 3.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tfrt/ir/mlrt/tf_ops.td
let summary = "Asynchronously execution of while op for tf_mlrt"; let description = [{ cond: The boolean to control whether the first iteration should be executed. arguments: The last $invariant_size elements are invariants between iterations. results: a list of futures. body_fn: input is [predicate_promise, arg0_future, arg0_promise, arg1_future, arg1_promise, ..., invariant_args] and has no returned results.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 22 21:35:32 UTC 2024 - 6.7K bytes - Viewed (0) -
tensorflow/compiler/aot/benchmark.cc
max_us = g.second; } } int max_digits = 1; while (max_us >= 10.0) { max_us /= 10.0; ++max_digits; } // Dump stats out. printf("Benchmark ran %zu iterations over %lld us\n", count_us, static_cast<long long>(stats.total_us)); // NOLINT for (const auto& g : groups) { printf(" %-*s %*.3f us\n", max_label_size, g.first.c_str(), max_digits + 4, g.second);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Sep 12 19:45:29 UTC 2023 - 4.5K bytes - Viewed (0) -
src/internal/chacha8rand/chacha8_arm64.s
VMOV V4.B16, V20.B16 VMOV V5.B16, V21.B16 VMOV V6.B16, V22.B16 VMOV V7.B16, V23.B16 VMOV V8.B16, V24.B16 VMOV V9.B16, V25.B16 VMOV V10.B16, V26.B16 VMOV V11.B16, V27.B16 // 4 iterations. Each iteration is 8 quarter-rounds. MOVD $4, R0 loop: QR(V0, V4, V8, V12) QR(V1, V5, V9, V13) QR(V2, V6, V10, V14) QR(V3, V7, V11, V15) QR(V0, V5, V10, V15) QR(V1, V6, V11, V12) QR(V2, V7, V8, V13)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 05 20:34:30 UTC 2023 - 3.2K bytes - Viewed (0) -
src/internal/types/testdata/fixedbugs/issue51229.go
g1(m) g2(m) g3(m) g4(m) g5(m) } // Worst-case scenario. // There are 10 unknown type parameters. In each iteration of // constraint type inference we infer one more, from right to left. // Each iteration looks repeatedly at all 11 type parameters, // requiring a total of 10*11 = 110 iterations with the current // implementation. Pathological case.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 17 19:54:27 UTC 2023 - 4.8K bytes - Viewed (0)