- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 599 for walkFn (0.18 sec)
-
hack/boilerplate/boilerplate.py
files = args.filenames else: for root, dirs, walkfiles in os.walk(args.rootdir): # don't visit certain dirs. This is just a performance improvement # as we would prune these later in normalize_files(). But doing it # cuts down the amount of filesystem walking we do and cuts down # the size of the file list for dname in skipped_names:
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Mar 01 06:06:51 UTC 2024 - 7.2K bytes - Viewed (0) -
platforms/core-execution/snapshots/src/test/groovy/org/gradle/internal/snapshot/impl/DirectorySnapshotterAsDirectoryWalkerTest.groovy
fileTree.visit(fileVisitor) visited } @Override protected List<String> walkDirForPaths(DirectorySnapshotter walker, File rootDir, PatternSet patternSet) { def snapshot = walker.snapshot(rootDir.absolutePath, directoryWalkerPredicate(patternSet), [:], completeSnapshotConsumer) return SnapshotVisitorUtil.getAbsolutePaths(snapshot) }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Nov 22 09:41:32 UTC 2023 - 4.5K bytes - Viewed (0) -
src/go/types/mono.go
var stack []int seen := make([]bool, len(check.mono.vertices)) // We have a path that contains a cycle and ends at v, but v may // only be reachable from the cycle, not on the cycle itself. We // start by walking backwards along the path until we find a vertex // that appears twice. for !seen[v] { stack = append(stack, v) seen[v] = true v = check.mono.edges[check.mono.vertices[v].pre].src }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadstore.go
} // Walk backwards looking for dead stores. Keep track of shadowed addresses. // A "shadowed address" is a pointer, offset, and size describing a memory region that // is known to be written. We keep track of shadowed addresses in the shadowed map, // mapping the ID of the address to a shadowRange where future writes will happen. // Since we're walking backwards, writes to a shadowed region are useless,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 20:07:26 UTC 2024 - 11K bytes - Viewed (0) -
platforms/software/version-control/src/main/java/org/gradle/vcs/git/internal/GitVersionControlSystem.java
} } } private static void updateSubModules(Git git) throws IOException, GitAPIException { try (SubmoduleWalk walker = SubmoduleWalk.forIndex(git.getRepository())) { while (walker.next()) { try (Repository submodule = walker.getRepository()) { if (submodule != null) { Git submoduleGit = Git.wrap(submodule);
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Jan 31 14:54:52 UTC 2024 - 8K bytes - Viewed (0) -
src/cmd/compile/internal/types2/mono.go
var stack []int seen := make([]bool, len(check.mono.vertices)) // We have a path that contains a cycle and ends at v, but v may // only be reachable from the cycle, not on the cycle itself. We // start by walking backwards along the path until we find a vertex // that appears twice. for !seen[v] { stack = append(stack, v) seen[v] = true v = check.mono.edges[check.mono.vertices[v].pre].src }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 28 00:05:29 UTC 2024 - 9.1K bytes - Viewed (0) -
src/cmd/compile/internal/walk/assign.go
if as.X != nil && as.Y != nil { return convas(as, init) } return as } // walkAssignDotType walks an OAS2DOTTYPE node. func walkAssignDotType(n *ir.AssignListStmt, init *ir.Nodes) ir.Node { walkExprListSafe(n.Lhs, init) n.Rhs[0] = walkExpr(n.Rhs[0], init) return n } // walkAssignFunc walks an OAS2FUNC node. func walkAssignFunc(init *ir.Nodes, n *ir.AssignListStmt) ir.Node { init.Append(ir.TakeInit(n)...)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:09:06 UTC 2024 - 20.3K bytes - Viewed (0) -
src/cmd/compile/internal/ir/visit.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // IR visitors for walking the IR tree. // // The lowest level helpers are DoChildren and EditChildren, which // nodes help implement and provide control over whether and when // recursion happens during the walk of the IR. // // Although these are both useful directly, two simpler patterns // are fairly common and also provided: Visit and Any.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 23 14:29:16 UTC 2023 - 6K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/phi.go
// resolveFwdRefs links all FwdRef uses up to their nearest dominating definition. func (s *phiState) resolveFwdRefs() { // Do a depth-first walk of the dominator tree, keeping track // of the most-recently-seen value for each variable. // Map from variable ID to SSA value at the current point of the walk. values := make([]*ssa.Value, len(s.varnum)) for i := range values { values[i] = s.placeholder } // Stack of work to do.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 15.2K bytes - Viewed (0) -
src/cmd/compile/internal/walk/builtin.go
r := ir.NewBlockStmt(base.Pos, nil) r.List = calls return walkStmt(typecheck.Stmt(r)) } // walkRecoverFP walks an ORECOVERFP node. func walkRecoverFP(nn *ir.CallExpr, init *ir.Nodes) ir.Node { return mkcall("gorecover", nn.Type(), init, walkExpr(nn.Args[0], init)) } // walkUnsafeData walks an OUNSAFESLICEDATA or OUNSAFESTRINGDATA expression. func walkUnsafeData(n *ir.UnaryExpr, init *ir.Nodes) ir.Node {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 22:35:22 UTC 2024 - 31.2K bytes - Viewed (0)