- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for lhes (0.13 sec)
-
src/cmd/cgo/ast.go
case *ast.SendStmt: f.walk(&n.Chan, ctxExpr, visit) f.walk(&n.Value, ctxExpr, visit) case *ast.IncDecStmt: f.walk(&n.X, ctxExpr, visit) case *ast.AssignStmt: f.walk(n.Lhs, ctxExpr, visit) if len(n.Lhs) == 2 && len(n.Rhs) == 1 { f.walk(n.Rhs, ctxAssign2, visit) } else { f.walk(n.Rhs, ctxExpr, visit) } case *ast.GoStmt: f.walk(n.Call, ctxExpr, visit) case *ast.DeferStmt:
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Jun 07 16:54:27 GMT 2023 - 14.3K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
p.errorf("expected simple register reference") } a.Type = obj.TYPE_REG a.Reg = r1 if r2 != 0 { // Form is R1:R2. It is on RHS and the second register // needs to go into the LHS. panic("cannot happen (Addr.Reg2)") } } // fmt.Printf("REG %s\n", obj.Dconv(&emptyProg, 0, a)) p.expectOperandEnd() return } // Constant. haveConstant := false
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Feb 21 14:34:57 GMT 2024 - 36.9K bytes - Viewed (0) -
doc/go_spec.html
<p> Type inference solves type equations through <i>type unification</i>. Type unification recursively compares the LHS and RHS types of an equation, where either or both types may be or contain bound type parameters, and looks for type arguments for those type parameters such that the LHS and RHS match (become identical or assignment-compatible, depending on context).
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Thu May 02 22:43:51 GMT 2024 - 279.6K bytes - Viewed (0)