- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 599 for walkFn (0.14 sec)
-
src/cmd/compile/internal/types2/stdlib_test.go
} func walkPkgDirs(dir string, pkgh func(dir string, filenames []string), errh func(args ...interface{})) { w := walker{pkgh, errh} w.walk(dir) } type walker struct { pkgh func(dir string, filenames []string) errh func(args ...any) } func (w *walker) walk(dir string) { files, err := os.ReadDir(dir) if err != nil { w.errh(err) return }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:18:33 UTC 2024 - 13.3K bytes - Viewed (0) -
platforms/core-runtime/base-services/src/test/groovy/org/gradle/internal/graph/CachingDirectedGraphWalkerTest.groovy
0 * _._ when: walker.add(1) def values = walker.findValues() then: values == ['1', '2', '3', '4'] as Set when: walker.add(2) values = walker.findValues() then: values == ['1', '2', '3', '4'] as Set when: walker.add(3) values = walker.findValues() then:
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:48:02 UTC 2023 - 9.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/sparsetree.go
// // Entry and exit values are assigned in a depth-first dominator tree walk. // For all blocks x and y, one of the following holds: // // (x-dom-y) x dominates y => entry(x) < entry(y) < exit(y) < exit(x) // (y-dom-x) y dominates x => entry(y) < entry(x) < exit(x) < exit(y) // (x-then-y) neither x nor y dominates the other and x walked before y => entry(x) < exit(x) < entry(y) < exit(y)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 8.1K bytes - Viewed (0) -
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/cmd/compile/internal/ssagen/nowb.go
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 // must be called before walk. func newNowritebarrierrecChecker() *nowritebarrierrecChecker { c := &nowritebarrierrecChecker{
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 17:29:46 UTC 2024 - 5.9K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/ast/astutil/rewrite.go
// Files and packages case *ast.File: a.apply(n, "Doc", nil, n.Doc) a.apply(n, "Name", nil, n.Name) a.applyList(n, "Decls") // Don't walk n.Comments; they have either been walked already if // they are Doc comments, or they can be easily walked explicitly. case *ast.Package: // collect and sort names for reproducible behavior var names []string for name := range n.Files {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 18 21:28:13 UTC 2023 - 12.2K bytes - Viewed (0) -
src/cmd/cgo/ast.go
f.walk(n.Body, ctxTypeSwitch, visit) case *ast.CommClause: f.walk(n.Comm, ctxStmt, visit) f.walk(n.Body, ctxStmt, visit) case *ast.SelectStmt: f.walk(n.Body, ctxStmt, visit) case *ast.ForStmt: f.walk(n.Init, ctxStmt, visit) f.walk(&n.Cond, ctxExpr, visit) f.walk(n.Post, ctxStmt, visit) f.walk(n.Body, ctxStmt, visit) case *ast.RangeStmt: f.walk(&n.Key, ctxExpr, visit)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 07 16:54:27 UTC 2023 - 14.3K bytes - Viewed (0) -
platforms/core-configuration/file-collections/src/test/groovy/org/gradle/api/internal/file/collections/DirectoryFileTreeTest.groovy
} /** file structure: root rootFile1 dir1 dirFile1 dirFile2 rootFile2 Test that the files are really walked breadth first */ def "walk breadth first - isReproducible: #visitor.isReproducibleFileOrder"() { given: def root = temporaryFolder.createDir("root") def rootFile1 = root.createFile("rootFile1")
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Sep 28 09:51:04 UTC 2023 - 9.6K bytes - Viewed (0) -
src/cmd/compile/internal/walk/closure.go
clofn.SetNeedctxt(true) // The closure expression may be walked more than once if it appeared in composite // literal initialization (e.g, see issue #49029). // // Don't add the closure function to compilation queue more than once, since when // compiling a function twice would lead to an ICE. if !clofn.Walked() { clofn.SetWalked(true) ir.CurFunc.Closures = append(ir.CurFunc.Closures, clofn) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 20 15:56:08 UTC 2023 - 6.5K bytes - Viewed (0) -
pkg/kubelet/pluginmanager/pluginwatcher/plugin_watcher.go
func (w *Watcher) Start(stopCh <-chan struct{}) error { klog.V(2).InfoS("Plugin Watcher Start", "path", w.path) // Creating the directory to be watched if it doesn't exist yet, // and walks through the directory to discover the existing plugins. if err := w.init(); err != nil { return err } fsWatcher, err := fsnotify.NewWatcher() if err != nil {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Jan 01 00:26:37 UTC 2023 - 6.1K bytes - Viewed (0)