- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 550 for recursion (0.19 sec)
-
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/asmdecl/asmdecl.go
func componentsOfType(arch *asmArch, t types.Type) []component { return appendComponentsRecursive(arch, t, nil, "", 0) } // appendComponentsRecursive implements componentsOfType. // Recursion is required to correct handle structs and arrays, // which can contain arbitrary other types. func appendComponentsRecursive(arch *asmArch, t types.Type, cc []component, suffix string, off int) []component { s := t.String()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 02:38:00 UTC 2024 - 22.8K bytes - Viewed (0) -
src/cmd/compile/internal/types2/named.go
// (for example, in recursive type declarations). assert(check != nil) } if orig.tparams.Len() != targs.Len() { // Mismatching arg and tparam length may be checked elsewhere. return Typ[Invalid] } // Ensure that an instance is recorded before substituting, so that we // resolve n for any recursive references. h := n.inst.ctxt.instanceHash(orig, targs.list())
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 20:03:31 UTC 2024 - 23.9K bytes - Viewed (0) -
src/runtime/pprof/proto.go
// // Frame's Func is nil (note: also true for non-Go functions), and // Frame's Entry matches its entry function frame's Entry (note: could also be true for recursive calls and non-Go functions), and // Frame's Name does not match its entry function frame's name (note: inlined functions cannot be directly recursive). // // As reading and processing the pcs in a stack trace one by one (from leaf to the root),
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Dec 13 20:40:52 UTC 2023 - 25.7K bytes - Viewed (0) -
src/go/types/named.go
// (for example, in recursive type declarations). assert(check != nil) } if orig.tparams.Len() != targs.Len() { // Mismatching arg and tparam length may be checked elsewhere. return Typ[Invalid] } // Ensure that an instance is recorded before substituting, so that we // resolve n for any recursive references. h := n.inst.ctxt.instanceHash(orig, targs.list())
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 20:03:31 UTC 2024 - 24K bytes - Viewed (0) -
src/cmd/go/internal/fsys/fsys.go
volumeLen, dir = cleanGlobPathWindows(dir) } else { dir = cleanGlobPath(dir) } if !hasMeta(dir[volumeLen:]) { return glob(dir, file, nil) } // Prevent infinite recursion. See issue 15879. if dir == pattern { return nil, filepath.ErrBadPattern } var m []string m, err = Glob(dir) if err != nil { return } for _, d := range m {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 18:35:34 UTC 2024 - 22.7K bytes - Viewed (0) -
src/runtime/traceback_test.go
} } func tte0(n int) string { return tte4(n - 1) } func tte1(n int) string { return tte0(n - 1) } func tte2(n int) string { // tte2 opens n%5 == 2 frames. It's also the base case of the recursion, // since we can open no fewer than two frames to call debug.Stack(). if n < 2 { panic("bad n") } if n == 2 { return string(debug.Stack()) } return tte1(n - 1) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Dec 14 17:22:18 UTC 2023 - 22.9K bytes - Viewed (0) -
src/cmd/compile/internal/types/type.go
// TODO(josharian): make this safe for recursive interface types // and use in signatlist sorting. See issue 19869. func (t *Type) cmp(x *Type) Cmp { // This follows the structure of function identical in identity.go // with two exceptions. // 1. Symbols are compared more carefully because a <,=,> result is desired. // 2. Maps are treated specially to avoid endless recursion -- maps
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:29:45 UTC 2024 - 49.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/analysis/side_effect_analysis.cc
auto it = is_pure_function_.find(func_op); if (it == is_pure_function_.end()) { bool is_pure = true; is_pure_function_[func_op] = is_pure; // prevent infinite recursion func_op->walk([&](Operation* op) { if (op == func_op) { return WalkResult::advance(); } // AssertOp is not, technically, pure. However, we treat functions
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 15 09:04:13 UTC 2024 - 41.2K bytes - Viewed (0) -
src/runtime/crash_test.go
} func TestGoexitInPanic(t *testing.T) { // External linking brings in cgo, causing deadlock detection not working. testenv.MustInternalLink(t, false) // see issue 8774: this code used to trigger an infinite recursion output := runTestProg(t, "testprog", "GoexitInPanic") want := "fatal error: no goroutines (main called runtime.Goexit) - deadlock!" if !strings.HasPrefix(output, want) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 19:46:10 UTC 2024 - 27K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/cmd/bisect/main.go
MatchFull []string // full match lines for the IDs, with match markers kept } // &searchFatal is a special panic value to signal that Search failed. // This lets us unwind the search recursion on a fatal error // but have Search return normally. var searchFatal int // Search runs a bisect search according to the configuration in b. // It reports whether any failing change sets were found.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 22 18:11:19 UTC 2023 - 23.9K bytes - Viewed (0)