- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 1,572 for iterations (0.28 sec)
-
src/internal/chacha8rand/chacha8_generic.go
// the first register with the N copies of const1, the second // with N copies of const2, and so on, and then running the operations. // // Each iteration of ChaCha8Rand operates over 32 bytes of input and // produces 992 bytes of RNG output, plus 32 bytes of input for the next // iteration. // // The 32 bytes of input are used as a ChaCha8 key, with a zero nonce, to
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 05 20:32:54 UTC 2023 - 6.3K bytes - Viewed (0) -
android/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) -
tensorflow/cc/ops/while_loop.cc
// defining the frame) and that they are executed once per loop iteration. // // TODO(skyewm): the control dep will be added to all nodes in the cond graph. // This is at best unnecessary, and at worst may prevent different parts of // different loop iterations from executing in parallel. Scope cond_scope = scope.NewSubScope("cond").WithControlDependencies(inputs[0]);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Feb 26 01:01:21 UTC 2024 - 9.5K 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: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed May 29 11:20:16 UTC 2024 - 8.6K 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) -
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) -
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) -
src/cmd/compile/internal/types2/mono.go
pos syntax.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 Feb 28 00:05:29 UTC 2024 - 9.1K bytes - Viewed (0) -
src/cmd/go/testdata/script/mod_tidy_convergence_loop.txt
# because it is willing to drop dependencies on non-root modules that do not # otherwise provide imported packages. # # On the first iteration, it adds x.1 as a root, which upgrades z and w, # dropping w.1's requirement on y. w.1 was initially a root, so the upgraded # w.2-pre is retained as a root. # # On the second iteration, it adds y.1 as a root, which upgrades w and x,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Jun 03 21:13:11 UTC 2023 - 9.2K bytes - Viewed (0)