- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 263 for recursion (0.23 sec)
-
src/runtime/debug/garbage.go
// There may be a system-imposed maximum stack limit regardless // of the value provided to SetMaxStack. // // SetMaxStack is useful mainly for limiting the damage done by // goroutines that enter an infinite recursion. It only limits future // stack growth. func SetMaxStack(bytes int) int { return setMaxStack(bytes) } // SetMaxThreads sets the maximum number of operating system
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 9.9K bytes - Viewed (0) -
src/cmd/link/internal/ld/stackcheck.go
} func (sc *stackCheck) report(sym loader.Sym, depth int, chain *[]stackCheckChain) { // Walk the out-edges of sym. We temporarily pull the edges // out of the graph to detect cycles and prevent infinite // recursion. edges, ok := sc.graph[sym] isCycle := !(ok || sym == 0) delete(sc.graph, sym) for _, out := range edges { *chain = append(*chain, stackCheckChain{out, false}) sc.report(out.target, depth-out.growth, chain)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 24 16:49:08 UTC 2023 - 11.9K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/telemetry/start.go
// child. // // On the other hand, if telemetryChildVar were simply unset, then the // delegated go commands would fork themselves recursively. Short-circuit // this recursion. os.Setenv(telemetryChildVar, "2") upload := os.Getenv(telemetryUploadVar) == "1" child(reportCrashes, upload, config.UploadStartTime, config.UploadURL) os.Exit(0) case "2":
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 14:52:56 UTC 2024 - 10.8K bytes - Viewed (0) -
src/bufio/bufio.go
func (b *Reader) Reset(r io.Reader) { // If a Reader r is passed to NewReader, NewReader will return r. // Different layers of code may do that, and then later pass r // to Reset. Avoid infinite recursion in that case. if b == r { return } if b.buf == nil { b.buf = make([]byte, defaultBufSize) } b.reset(b.buf, r) } func (b *Reader) reset(buf []byte, r io.Reader) { *b = Reader{
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 12 14:39:08 UTC 2023 - 21.8K bytes - Viewed (0) -
src/cmd/asm/internal/lex/input.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 29 07:48:38 UTC 2023 - 12.6K bytes - Viewed (0) -
guava-testlib/test/com/google/common/testing/ArbitraryInstancesTest.java
static final NonPublicConstantIgnored INSTANCE = new NonPublicConstantIgnored(); private NonPublicConstantIgnored() {} } public static class NonStaticFieldIgnored { // This should cause infinite recursion. But it shouldn't be used anyway. public final NonStaticFieldIgnored instance = new NonStaticFieldIgnored(); private NonStaticFieldIgnored() {} }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 22.1K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/ast/astutil/enclosing.go
ast.Inspect(n, func(node ast.Node) bool { if node == n { // push n return true // recur } if node != nil { // push child children = append(children, node) } return false // no recursion }) // Then add fake Nodes for bare tokens. switch n := n.(type) { case *ast.ArrayType: children = append(children, tok(n.Lbrack, len("[")), tok(n.Elt.End(), len("]")))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 18 21:28:13 UTC 2023 - 15.9K bytes - Viewed (0) -
src/index/suffixarray/suffixarray_test.go
// We use this pattern: // 1 255 1 254 1 253 1 ... 1 2 1 255 2 254 2 253 2 252 2 ... // This gives approximately 2¹⁵ distinct LMS-substrings. // We need to repeat at least one substring, though, // or else the recursion can be bypassed entirely. x := make([]byte, 100000, 100001) lo := byte(1) hi := byte(255) for i := range x { if i%2 == 0 { x[i] = lo } else { x[i] = hi hi--
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 14.1K bytes - Viewed (0) -
src/log/slog/doc.go
details. A LogValue method may return a Value that itself implements [LogValuer]. The [Value.Resolve] method handles these cases carefully, avoiding infinite loops and unbounded recursion. Handler authors and others may wish to use [Value.Resolve] instead of calling LogValue directly. # Wrapping output methods The logger functions use reflection over the call stack to find the file name
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 15 14:35:48 UTC 2024 - 12.3K bytes - Viewed (0) -
tensorflow/compiler/jit/flags.cc
bool SetterForXlaAutoJitFlag(const string& value) { int32_t opt_level; // We need to use the mark_for_compilation_flags directly here instead of // going via GetMarkForCompilationPassFlags() to avoid infinite recursion. The // latter will try to setup and parse flags, which would bring us back to this // setter. if (absl::SimpleAtoi(value, &opt_level)) { mark_for_compilation_flags->xla_auto_jit_flag
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Apr 17 18:52:57 UTC 2024 - 24.5K bytes - Viewed (0)