- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 112 for Walks (0.03 sec)
-
src/cmd/link/internal/ld/stackcheck.go
// target of an indirect/closure call. const stackCheckIndirect loader.Sym = ^loader.Sym(0) // doStackCheck walks the call tree to check that there is always // enough stack space for call frames, especially for a chain of // nosplit functions. // // It walks all functions to accumulate the number of bytes they can // grow the stack by without a split check and checks this against the // limit.
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/regexp/syntax/regexp.go
b.WriteString(`}`) } } // MaxCap walks the regexp to find the maximum capture index. func (re *Regexp) MaxCap() int { m := 0 if re.Op == OpCapture { m = re.Cap } for _, sub := range re.Sub { if n := sub.MaxCap(); m < n { m = n } } return m } // CapNames walks the regexp to find the names of capturing groups.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 29 16:41:51 UTC 2024 - 11.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/nowb.go
// visible during later analysis. It maps from the ODCLFUNC of // the caller to a list of callees. extraCalls map[*ir.Func][]nowritebarrierrecCall // curfn is the current function during AST walks. curfn *ir.Func } type nowritebarrierrecCall struct { target *ir.Func // caller or callee lineno src.XPos // line of call } // newNowritebarrierrecChecker creates a nowritebarrierrecChecker. It
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 17:29:46 UTC 2024 - 5.9K bytes - Viewed (0) -
testing/internal-integ-testing/src/main/groovy/org/gradle/integtests/fixtures/resolve/GenerateGraphTask.groovy
* This is meant to be Configuration Cache compatible, so it does not store and test the {@link org.gradle.api.artifacts.result.ResolutionResult ResolutionResult} * directly, but stores the root node of the graph and walks it to compare the components and dependencies instead. */ abstract class GenerateGraphTask extends DefaultTask { @Internal File outputFile @Internal boolean buildArtifacts @Internal
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 9.7K bytes - Viewed (0) -
src/cmd/compile/internal/types2/union.go
panic("empty or top union term") } } if !(*term)(x).disjoint((*term)(y)) { return i } } return -1 } // flattenUnion walks a union type expression of the form A | B | C | ..., // extracting both the binary exprs (blist) and leaf types (tlist). func flattenUnion(list []syntax.Expr, x syntax.Expr) (blist, tlist []syntax.Expr) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 15 16:16:58 UTC 2023 - 6.3K bytes - Viewed (0) -
src/path/filepath/path.go
} } else { err = walk(filename, fileInfo, walkFn) if err != nil { if !fileInfo.IsDir() || err != SkipDir { return err } } } } return nil } // WalkDir walks the file tree rooted at root, calling fn for each file or // directory in the tree, including root. // // All errors that arise visiting files and directories are filtered by fn:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 15.5K bytes - Viewed (0) -
guava/src/com/google/common/base/Throwables.java
* </pre> * * @throws IllegalArgumentException if there is a loop in the causal chain */ public static Throwable getRootCause(Throwable throwable) { // Keep a second pointer that slowly walks the causal chain. If the fast pointer ever catches // the slower pointer, then there's a loop. Throwable slowPointer = throwable; boolean advanceSlowPointer = false; Throwable cause;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 06 15:38:58 UTC 2024 - 20.6K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/unreachable/unreachable.go
case *ast.CommClause: for _, stmt := range x.Body { d.findLabels(stmt) } case *ast.CaseClause: for _, stmt := range x.Body { d.findLabels(stmt) } } } // findDead walks the statement looking for dead code. // If d.reachable is false on entry, stmt itself is dead. // When findDead returns, d.reachable tells whether the // statement following stmt is reachable.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 09 01:28:01 UTC 2023 - 7.6K bytes - Viewed (0) -
cmd/preferredimports/preferredimports.go
var files []*ast.File for _, f := range fs { files = append(files, f) } return files } type collector struct { dirs []string regex *regexp.Regexp } // handlePath walks the filesystem recursively, collecting directories, // ignoring some unneeded directories (hidden/vendored) that are handled // specially later. func (c *collector) handlePath(path string, info os.FileInfo, err error) error {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Mar 01 06:06:44 UTC 2024 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Throwables.java
* </pre> * * @throws IllegalArgumentException if there is a loop in the causal chain */ public static Throwable getRootCause(Throwable throwable) { // Keep a second pointer that slowly walks the causal chain. If the fast pointer ever catches // the slower pointer, then there's a loop. Throwable slowPointer = throwable; boolean advanceSlowPointer = false; Throwable cause;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 06 15:38:58 UTC 2024 - 20.6K bytes - Viewed (0)