type go/ast.BinaryExpr
30 uses
go/ast (current package)
ast.go#L413: BinaryExpr struct {
ast.go#L512: func (x *BinaryExpr) Pos() token.Pos { return x.X.Pos() }
ast.go#L546: func (x *BinaryExpr) End() token.Pos { return x.Y.End() }
ast.go#L577: func (*BinaryExpr) exprNode() {}
walk.go#L129: case *BinaryExpr:
go/doc
exports.go#L182: case *ast.BinaryExpr:
go/parser
parser.go#L1202: t := new(ast.BinaryExpr)
parser.go#L1876: x = &ast.BinaryExpr{X: x, OpPos: pos, Op: op, Y: y}
parser.go#L2685: case *ast.BinaryExpr:
parser.go#L2723: case *ast.BinaryExpr:
go/printer
nodes.go#L411: case *ast.BinaryExpr:
nodes.go#L427: case *ast.BinaryExpr:
nodes.go#L650: func walkBinary(e *ast.BinaryExpr) (has4, has5 bool, maxProblem int) {
nodes.go#L659: case *ast.BinaryExpr:
nodes.go#L672: case *ast.BinaryExpr:
nodes.go#L699: func cutoff(e *ast.BinaryExpr, depth int) int {
nodes.go#L717: x, ok := expr.(*ast.BinaryExpr)
nodes.go#L768: func (p *printer) binaryExpr(x *ast.BinaryExpr, prec1, cutoff, depth int) {
nodes.go#L809: _, ok := expr.(*ast.BinaryExpr)
nodes.go#L823: case *ast.BinaryExpr:
go/types
decl.go#L719: case *ast.BinaryExpr:
expr.go#L92: case *ast.BinaryExpr:
expr.go#L103: case *ast.BinaryExpr:
expr.go#L285: case *ast.BinaryExpr:
expr.go#L1129: case *ast.BinaryExpr:
exprstring.go#L120: case *ast.BinaryExpr:
union.go#L194: if o, _ := x.(*ast.BinaryExpr); o != nil && o.Op == token.OR {
golang.org/x/tools/internal/typesinternal
zerovalue.go#L377: union = &ast.BinaryExpr{
gotest.tools/v3/internal/assert
assert.go#L118: if binaryExpr, ok := expr.(*ast.BinaryExpr); ok {
result.go#L104: case *ast.BinaryExpr, *ast.UnaryExpr: