- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 3,163 for iterations (0.18 sec)
-
gradlew
# args, so each arg winds up back in the position where it started, but # possibly modified. # # NB: a `for` loop captures its iteration list before it begins, so # changing the positional parameters here affects neither the number of # iterations, nor the values presented in `arg`. shift # remove old arg set -- "$@" "$arg" # push replacement arg done fi
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed May 29 11:20:16 UTC 2024 - 8.6K bytes - Viewed (0) -
platforms/jvm/plugins-application/src/main/resources/org/gradle/api/internal/plugins/unixStartScript.txt
# args, so each arg winds up back in the position where it started, but # possibly modified. # # NB: a `for` loop captures its iteration list before it begins, so # changing the positional parameters here affects neither the number of # iterations, nor the values presented in `arg`. shift # remove old arg set -- "\$@" "\$arg" # push replacement arg done fi
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Apr 23 13:43:33 UTC 2024 - 11K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/tensorflow/python/py_function_lib.py
) -> rd.RepresentativeDataset: """Logs the sample number for calibration. If in debug logging level, the "sample number / total num samples" is logged for every 5 iterations. This is often useful when tracking the progress of the calibration step which is often slow and may look stale if there's no logs being printed. Args:
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 31 05:32:11 UTC 2024 - 27.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/AbstractStreamingHasherTest.java
* process()/processRemaining() invocations, due to alignment. */ @AndroidIncompatible // slow. TODO(cpovirk): Maybe just reduce iterations under Android. public void testExhaustive() throws Exception { Random random = new Random(0); // will iteratively make more debuggable, each time it breaks
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 8.5K bytes - Viewed (0) -
src/os/fifo_test.go
t.Skipf("can't open %q: %v", nonPollable, err) } t.Fatal(err) } f.Close() // On a Linux laptop, before the problem was fixed, // this test failed about 50% of the time with this // number of iterations. // It takes about 1/2 second when it passes. const attempts = 20000 start := make(chan bool) var wg sync.WaitGroup wg.Add(1) defer wg.Wait() go func() { defer wg.Done() close(start)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 19 11:47:23 UTC 2024 - 6.1K bytes - Viewed (0) -
src/math/big/int.go
default: a2 = 0 } // Since we are calculating with full words to avoid overflow, // we use 'even' to track the sign of the cosequences. // For even iterations: u0, v1 >= 0 && u1, v0 <= 0 // For odd iterations: u0, v1 <= 0 && u1, v0 >= 0 // The first iteration starts with k=1 (odd). even = false // variables to track the cosequences u0, u1, u2 = 0, 1, 0 v0, v1, v2 = 0, 0, 1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 33.1K bytes - Viewed (0) -
gradlew
# args, so each arg winds up back in the position where it started, but # possibly modified. # # NB: a `for` loop captures its iteration list before it begins, so # changing the positional parameters here affects neither the number of # iterations, nor the values presented in `arg`. shift # remove old arg set -- "$@" "$arg" # push replacement arg done fi
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Sun Dec 24 09:00:26 UTC 2023 - 8.5K bytes - Viewed (0) -
build-logic/performance-testing/src/main/groovy/gradlebuild/performance/tasks/PerformanceTest.groovy
void setWarmups(@Nullable String warmups) { this.warmups = warmups } @Option(option = "runs", description = "Number of iterations of measurements") void setRuns(@Nullable String runs) { this.runs = runs } @Option(option = "checks", description = "Tells which regressions to check. One of [none, speed, all]")
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Sat Dec 03 03:46:18 UTC 2022 - 12.7K bytes - Viewed (0) -
src/go/doc/testdata/testing.1.golden
func (b *B) trimOutput() // 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 - 8.4K bytes - Viewed (0) -
src/go/types/mono.go
pos token.Pos typ Type } func (check *Checker) monomorph() { // We detect unbounded instantiation cycles using a variant of // Bellman-Ford's algorithm. Namely, instead of always running |V| // iterations, we run until we either reach a fixed point or we've // found a path of length |V|. This allows us to terminate earlier // when there are no cycles, which should be the common case. again := true for again {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.2K bytes - Viewed (0)