- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 522 for recursion (0.16 sec)
-
src/runtime/debug.go
// // This must be deeply nosplit because it is called from a function // prologue before the stack is set up and because the compiler will // call it from any splittable prologue (leading to infinite // recursion). // // Ideally it should also use very little stack because the linker // doesn't currently account for this in nosplit stack depth checking. // // Ensure mayMoreStackPreempt can be called for all ABIs. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 11 20:38:24 UTC 2024 - 4.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/utils/eval_util.cc
// attribute of the MLIR op. The assigned device might be remote, not // available during compilation or compilation only device for on demand // execution which may create a recursion if used for constant folding. constexpr char kHostCpu[] = "/job:localhost/replica:0/task:0/CPU:0"; TFE_OpSetDevice(op, kHostCpu, status); RETURN_FAILURE_IF_ERROR(status); for (const auto& attr : node_def->attr()) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Dec 13 06:02:14 UTC 2023 - 5.7K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/report/stacks.go
// StackSet.Stacks[a].Sources[b] points to this source. // // No stack will be referenced twice in the Places slice for a given // StackSource. In case of recursion, Places will contain the outer-most // entry in the recursive stack. E.g., if stack S has source X at positions // 4,6,9,10, the Places entry for X will contain [S,4]. Places []StackSlot // Combined count of stacks where this source is the leaf.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 16 15:19:53 UTC 2024 - 5.6K bytes - Viewed (0) -
src/go/types/subst.go
return subst.tuple(t) case *Signature: // Preserve the receiver: it is handled during *Interface and *Named type // substitution. // // Naively doing the substitution here can lead to an infinite recursion in // the case where the receiver is an interface. For example, consider the // following declaration: // // type T[A any] struct { f interface{ m() } } //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:04:07 UTC 2024 - 11.1K bytes - Viewed (0) -
src/cmd/compile/internal/types2/subst.go
return subst.tuple(t) case *Signature: // Preserve the receiver: it is handled during *Interface and *Named type // substitution. // // Naively doing the substitution here can lead to an infinite recursion in // the case where the receiver is an interface. For example, consider the // following declaration: // // type T[A any] struct { f interface{ m() } } //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:04:07 UTC 2024 - 11K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/excludes/factories/CachingExcludeFactory.java
} } /** * A shareable backing cache for different caching exclude factories. * Synchronization is ad-hoc, since `computeIfAbsent` on a concurrent hash map * will not allow for recursion, which is the case for us whenever a cache is * found at different levels. */ public static class MergeCaches {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Dec 11 13:37:56 UTC 2023 - 6.4K bytes - Viewed (0) -
src/slices/zsortanyfunc.go
// // symMerge assumes non-degenerate arguments: a < m && m < b. // Having the caller check this condition eliminates many leaf recursion calls, // which improves performance. func symMergeCmpFunc[E any](data []E, a, m, b int, cmp func(a, b E) int) { // Avoid unnecessary recursions of symMerge // by direct insertion of data[a] into data[m:b] // if data[a:m] only contains one element. if m-a == 1 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 23 23:33:29 UTC 2023 - 12.8K bytes - Viewed (0) -
test/nosplit.go
start 0 call big big 10000 # But not if the frame is nosplit. start 0 call big big 10000 nosplit REJECT # Recursion is okay. start 0 call start # Recursive nosplit runs out of space. start 0 nosplit call start REJECT # Non-trivial recursion runs out of space. start 0 call f1 f1 0 nosplit call f2 f2 0 nosplit call f1 REJECT # Same but cycle starts below nosplit entry.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:25 UTC 2023 - 11.3K bytes - Viewed (0) -
src/slices/zsortordered.go
// // symMerge assumes non-degenerate arguments: a < m && m < b. // Having the caller check this condition eliminates many leaf recursion calls, // which improves performance. func symMergeOrdered[E cmp.Ordered](data []E, a, m, b int) { // Avoid unnecessary recursions of symMerge // by direct insertion of data[a] into data[m:b] // if data[a:m] only contains one element. if m-a == 1 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 23 23:33:29 UTC 2023 - 12.4K bytes - Viewed (0) -
src/cmd/compile/internal/types2/typeset.go
} // An infinitely expanding interface (due to a cycle) is detected // elsewhere (Checker.validType), so here we simply assume we only // have valid interfaces. Mark the interface as complete to avoid // infinite recursion if the validType check occurs later for some // reason. ityp.tset = &_TypeSet{terms: allTermlist} // TODO(gri) is this sufficient? var unionSets map[*Union]*_TypeSet if check != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 13.6K bytes - Viewed (0)