Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for SliceExpr (0.15 sec)

  1. src/go/types/expr.go

    			if !enableReverseTypeInference {
    				T = nil
    			}
    			check.funcInst(T, e.Pos(), x, ix, true)
    		}
    		if x.mode == invalid {
    			goto Error
    		}
    
    	case *ast.SliceExpr:
    		check.sliceExpr(x, e)
    		if x.mode == invalid {
    			goto Error
    		}
    
    	case *ast.TypeAssertExpr:
    		check.expr(nil, x, e.X)
    		if x.mode == invalid {
    			goto Error
    		}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 29 02:09:54 UTC 2024
    - 49.7K bytes
    - Viewed (0)
  2. src/cmd/compile/internal/types2/expr.go

    			if !enableReverseTypeInference {
    				T = nil
    			}
    			check.funcInst(T, e.Pos(), x, e, true)
    		}
    		if x.mode == invalid {
    			goto Error
    		}
    
    	case *syntax.SliceExpr:
    		check.sliceExpr(x, e)
    		if x.mode == invalid {
    			goto Error
    		}
    
    	case *syntax.AssertExpr:
    		check.expr(nil, x, e.X)
    		if x.mode == invalid {
    			goto Error
    		}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 29 02:09:54 UTC 2024
    - 51.7K bytes
    - Viewed (0)
  3. src/go/printer/testdata/parser.go

    		isSlice = true
    		p.next()
    		if p.tok != token.RBRACK {
    			high = p.parseRhs()
    		}
    	}
    	p.exprLev--
    	rbrack := p.expect(token.RBRACK)
    
    	if isSlice {
    		return &ast.SliceExpr{x, lbrack, low, high, rbrack}
    	}
    	return &ast.IndexExpr{x, lbrack, low, rbrack}
    }
    
    func (p *parser) parseCallOrConversion(fun ast.Expr) *ast.CallExpr {
    	if p.trace {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Jul 20 20:19:51 UTC 2023
    - 50.5K bytes
    - Viewed (0)
  4. src/cmd/compile/internal/syntax/parser.go

    			if !p.got(_Colon) {
    				p.syntaxError("expected comma, : or ]")
    				p.advance(_Comma, _Colon, _Rbrack)
    			}
    			p.xnest++
    			t := new(SliceExpr)
    			t.pos = pos
    			t.X = x
    			t.Index[0] = i
    			if p.tok != _Colon && p.tok != _Rbrack {
    				// x[i:j...
    				t.Index[1] = p.expr()
    			}
    			if p.tok == _Colon {
    				t.Full = true
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 19:19:55 UTC 2024
    - 62.9K bytes
    - Viewed (0)
  5. src/go/printer/nodes.go

    		p.expr1(x.X, token.HighestPrec, 1)
    		p.setPos(x.Lbrack)
    		p.print(token.LBRACK)
    		p.exprList(x.Lbrack, x.Indices, depth+1, commaTerm, x.Rbrack, false)
    		p.setPos(x.Rbrack)
    		p.print(token.RBRACK)
    
    	case *ast.SliceExpr:
    		// TODO(gri): should treat[] like parentheses and undo one level of depth
    		p.expr1(x.X, token.HighestPrec, 1)
    		p.setPos(x.Lbrack)
    		p.print(token.LBRACK)
    		indices := []ast.Expr{x.Low, x.High}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Oct 17 18:53:17 UTC 2023
    - 52.6K bytes
    - Viewed (0)
  6. src/go/parser/parser.go

    			}
    			if index[2] == nil {
    				p.error(colons[1], "final index required in 3-index slice")
    				index[2] = &ast.BadExpr{From: colons[1] + 1, To: rbrack}
    			}
    		}
    		return &ast.SliceExpr{X: x, Lbrack: lbrack, Low: index[0], High: index[1], Max: index[2], Slice3: slice3, Rbrack: rbrack}
    	}
    
    	if len(args) == 0 {
    		// index expression
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Dec 08 20:07:50 UTC 2023
    - 72.2K bytes
    - Viewed (0)
  7. src/cmd/cgo/gcc.go

    		if !ok || len(c.Args) != 1 {
    			break
    		}
    		if !p.isType(c.Fun) && !p.isUnsafeData(c.Fun, false) {
    			break
    		}
    		px = &c.Args[0]
    	}
    	if _, ok := (*px).(*ast.SliceExpr); !ok {
    		return false
    	}
    
    	fmt.Fprintf(sb, "_cgoSlice%d := %s; ", i, gofmtPos(*px, (*px).Pos()))
    
    	origX := *px
    	*px = ast.NewIdent(fmt.Sprintf("_cgoSlice%d", i))
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 20 15:50:06 UTC 2024
    - 97K bytes
    - Viewed (0)
Back to top