- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 141 for iterations (0.28 sec)
-
tensorflow/compiler/jit/deadness_analysis.cc
// true on iteration 0, 1, 2 respectively. This is made more precise in the // comment on the AndRecurrence class. // // The general algorithm that deals with cycles does two topological-order // iterations over the graph. On the first iteration it assigns a symbolic // predicate to merge nodes with backedges. On the second iteration it tries
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 60.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug.go
// predecessors have been visited. po := state.f.Postorder() converged := false // The iteration rule is that by default, run until converged, but // if a particular iteration count is specified, run that many // iterations, no more, no less. A count is specified as the // thousands digit of the location lists debug flag, // e.g. -d=locationlists=4000
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/rewrite.go
// As of Sep 2021, 90% of rewrites complete in 4 iterations or fewer // and the maximum value encountered during make.bash is 12. // Start checking for cycles. (This is too expensive to do routinely.) // Note: we avoid this path for deadChange-only iterations, to fix #51639. if states == nil { states = make(map[string]bool) } h := f.rewriteHash()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:02:52 UTC 2024 - 64.2K bytes - Viewed (0) -
src/cmd/compile/internal/ppc64/ssa.go
// STXV VS32,32(R20) // STXV VS32,48(R20) // ADD $64,R20 // BC 16, 0, loop // Bytes per iteration ctr := v.AuxInt / 64 // Remainder bytes rem := v.AuxInt % 64 // Only generate a loop if there is more // than 1 iteration. if ctr > 1 { // Set up VS32 (V0) to hold 0s p := s.Prog(ppc64.AXXLXOR) p.From.Type = obj.TYPE_REG
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 19:59:38 UTC 2024 - 55.4K bytes - Viewed (0) -
src/cmd/go/internal/test/test.go
-fuzztime t Run enough iterations of the fuzz target during fuzzing to take t, specified as a time.Duration (for example, -fuzztime 1h30s). The default is to run forever. The special syntax Nx means to run the fuzz target N times (for example, -fuzztime 1000x). -fuzzminimizetime t Run enough iterations of the fuzz target during each minimization
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 16 14:34:32 UTC 2024 - 71.9K bytes - Viewed (0) -
src/runtime/pprof/pprof_test.go
"testing" "time" _ "unsafe" ) 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: Thu May 23 18:42:28 UTC 2024 - 68.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterators.java
* Returns an iterator over the merged contents of all given {@code iterators}, traversing every * element of the input iterators. Equivalent entries will not be de-duplicated. * * <p>Callers must ensure that the source {@code iterators} are in non-descending order as this * method does not sort its input. * * <p>For any equivalent elements across all {@code iterators}, it is undefined which element is * returned first.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 03 14:46:32 UTC 2024 - 50.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/Iterators.java
* Returns an iterator over the merged contents of all given {@code iterators}, traversing every * element of the input iterators. Equivalent entries will not be de-duplicated. * * <p>Callers must ensure that the source {@code iterators} are in non-descending order as this * method does not sort its input. * * <p>For any equivalent elements across all {@code iterators}, it is undefined which element is * returned first.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 03 14:46:32 UTC 2024 - 50.2K bytes - Viewed (0) -
src/cmd/go/internal/modload/load.go
// and all requested packages are in "all", then loading completes in a single // iteration. // TODO(bcmills): We should also be able to load in a single iteration if the // requested packages all come from modules that are themselves tidy, regardless // of whether those packages are in "all". Today, that requires two iterations // if those packages are not found in existing dependencies of the main module. import ( "context"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 14:56:56 UTC 2024 - 84K bytes - Viewed (0) -
tensorflow/compiler/jit/mark_for_compilation_pass.cc
// tensor from A being computed and copied. // // To choose better maximal clusterings we make multiple iterations over the // graph in post-order, where each such iteration is called a "phase". // Phase 0: contract metadata operations with their producer. VLOG(4) << "Running phase 0"; TF_RETURN_IF_ERROR( ForEachEdgeInPostOrder([&](Cluster* from,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 21 12:19:41 UTC 2024 - 85.3K bytes - Viewed (0)