- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 66 for visitEnd (0.18 sec)
-
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/loopclosure/loopclosure.go
}) } // forEachLastStmt calls onLast on each "last" statement in a list of statements. // "Last" is defined recursively so, for example, if the last statement is // a switch statement, then each switch case is also visited to examine // its last statements. func forEachLastStmt(stmts []ast.Stmt, onLast func(last ast.Stmt)) { if len(stmts) == 0 { return } s := stmts[len(stmts)-1] switch s := s.(type) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 10.3K bytes - Viewed (0) -
src/cmd/cover/cover.go
// existing import may be shadowed at any given place we want // to refer to it, and our name (_cover_atomic_) is less likely to // be shadowed. The one exception is if we're visiting the // sync/atomic package itself, in which case we can refer to // functions directly without an import prefix. See also #57445. if pkgconfig.PkgPath != "sync/atomic" {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 14 19:41:17 UTC 2024 - 34.5K bytes - Viewed (0) -
src/cmd/compile/internal/liveness/intervals.go
// order scan over instructions // - invoke b.Finish() to produce final set // // See the Live method comment for an IR example. type IntervalsBuilder struct { s Intervals // index of last instruction visited plus 1 lidx int } func (c *IntervalsBuilder) last() int { return c.lidx - 1 } func (c *IntervalsBuilder) setLast(x int) { c.lidx = x + 1 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 29 21:55:27 UTC 2024 - 10K bytes - Viewed (0) -
plugin/pkg/auth/authorizer/node/node_authorizer.go
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 07 21:22:55 UTC 2024 - 16K bytes - Viewed (0) -
platforms/software/dependency-management/src/test/groovy/org/gradle/api/internal/artifacts/ivyservice/resolveengine/DependencyGraphBuilderTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed May 22 19:04:04 UTC 2024 - 45.1K bytes - Viewed (0) -
src/go/types/unify.go
// are extremely short (bounded by the nesting depth of interface // type declarations that recur via parameter types, an extremely // rare occurrence). An alternative implementation might use a // "visited" map, but that is probably less efficient overall. q := &ifacePair{xi, yi, p} for p != nil { if p.identical(q) { return true // same pair was compared before } p = p.prev }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 11 16:24:39 UTC 2024 - 27.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/transforms/legalize_tf_communication.cc
/*flatten_tuple=*/true); // auto new_token = new_if_results[new_if_results.size() - 1]; region_if.erase(); // Next op to visit. The replacement is visited but at its first region. // The new region use the same implicit token used by the If op. ops_to_visit.push_back({/*region_idx=*/0, token, new_if}); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 40.5K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/DefaultConfigurationResolver.java
// set of build dependencies than actually required. This is because it takes a lot of extra information // from the visited graph to properly filter artifacts by dependencySpec, and we don't want capture that when // calculating build dependencies. dependencySpec -> visitedArtifacts.select(getImplicitSelectionSpec(resolveContext))
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu May 23 17:29:40 UTC 2024 - 28.5K bytes - Viewed (0) -
src/cmd/compile/internal/types2/unify.go
// are extremely short (bounded by the nesting depth of interface // type declarations that recur via parameter types, an extremely // rare occurrence). An alternative implementation might use a // "visited" map, but that is probably less efficient overall. q := &ifacePair{xi, yi, p} for p != nil { if p.identical(q) { return true // same pair was compared before } p = p.prev }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 11 16:24:39 UTC 2024 - 27.8K bytes - Viewed (0) -
src/cmd/go/internal/mvs/mvs.go
// // reqs describes the module requirement graph and provides an opaque method // for comparing versions. // // BuildList traverses the graph and returns a list containing the highest // version for each visited module. The first element of the returned list is // target itself; reqs.Max requires target.Version to compare higher than all // other versions, so no other version can be selected. The remaining elements
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 21:58:12 UTC 2024 - 14.5K bytes - Viewed (0)