- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 65 for Innermost (0.17 sec)
-
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/copylock/copylock.go
func (path typePath) String() string { n := len(path) var buf bytes.Buffer for i := range path { if i > 0 { fmt.Fprint(&buf, " contains ") } // The human-readable path is in reverse order, outermost to innermost. fmt.Fprint(&buf, path[n-i-1]) } return buf.String() } func lockPathRhs(pass *analysis.Pass, x ast.Expr) typePath { x = astutil.Unparen(x) // ignore parens on rhs
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 9.9K bytes - Viewed (0) -
src/text/template/doc.go
of the array, slice, or map and T1 is executed. {{break}} The innermost {{range pipeline}} loop is ended early, stopping the current iteration and bypassing all remaining iterations. {{continue}} The current iteration of the innermost {{range pipeline}} loop is stopped, and the loop starts the next iteration. {{template "name"}}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Feb 24 21:59:12 UTC 2024 - 17.9K bytes - Viewed (0) -
src/cmd/compile/internal/rangefunc/rewrite.go
} # Nested Loops So far we've only considered a single loop. If a function contains a sequence of loops, each can be translated individually. But loops can be nested. It would work to translate the innermost loop and then translate the loop around it, and so on, except that there'd be a lot of rewriting of rewritten code and the overall traversals could end up taking time quadratic in the depth of the nesting. To avoid all that,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:05:44 UTC 2024 - 41.6K bytes - Viewed (0) -
src/go/types/decl.go
saved := obj.color_ obj.color_ = black fdecl := decl.fdecl check.funcType(sig, fdecl.Recv, fdecl.Type) obj.color_ = saved // Set the scope's extent to the complete "func (...) { ... }" // so that Scope.Innermost works correctly. sig.scope.pos = fdecl.Pos() sig.scope.end = fdecl.End() if fdecl.Type.TypeParams.NumFields() > 0 && fdecl.Body == nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 31K bytes - Viewed (0) -
src/cmd/compile/internal/syntax/branches.go
if l.parent == b { return l.lstmt } } } return nil } var invalid = new(LabeledStmt) // singleton to signal invalid enclosing target // enclosingTarget returns the innermost enclosing labeled statement matching // the given name. The result is nil if the label is not defined, and invalid // if the label is defined but doesn't label a valid labeled statement.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Jun 26 00:21:29 UTC 2022 - 9.8K bytes - Viewed (0) -
src/go/ast/commentmap.go
const maxLen = 40 var buf bytes.Buffer // collect comments text loop: for _, group := range list { // Note: CommentGroup.Text() does too much work for what we // need and would only replace this innermost loop. // Just do it explicitly. for _, comment := range group.List { if buf.Len() >= maxLen { break loop } buf.WriteString(comment.Text) } } // truncate if too long
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 8.9K bytes - Viewed (0) -
src/runtime/stkframe.go
// information. // // - If this frame "called" sigpanic, then pc is the // instruction that panicked, and pc is the correct address // to use for symbolic information. // // - If this is the innermost frame, then PC is where // execution will continue, but it may not be the // instruction following a CALL. This may be from // cooperative preemption, in which case this is the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 15:10:48 UTC 2024 - 9.9K bytes - Viewed (0) -
src/runtime/mgcstack.go
// of a goroutine. type stackScanState struct { // stack limits stack stack // conservative indicates that the next frame must be scanned conservatively. // This applies only to the innermost frame at an async safe-point. conservative bool // buf contains the set of possible pointers to stack objects. // Organized as a LIFO linked list of buffers. // All buffers except possibly the head buffer are full.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 21 21:06:52 UTC 2023 - 10.6K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/internal/analysisinternal/analysis.go
if _, ok = seen[obj]; ok { return true } seen[obj] = struct{}{} // Find the scope for the given position. Then, check whether the object // exists within the scope. innerScope := pkg.Scope().Innermost(pos) if innerScope == nil { return true } _, foundObj := innerScope.LookupParent(ident.Name, pos) if foundObj != obj { return true }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 11.7K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/cfg/builder.go
} // -------- helpers -------- // Destinations associated with unlabeled for/switch/select stmts. // We push/pop one of these as we enter/leave each construct and for // each BranchStmt we scan for the innermost target of the right type. type targets struct { tail *targets // rest of stack _break *Block _continue *Block _fallthrough *Block } // Destinations associated with a labeled block.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 11.4K bytes - Viewed (0)