type go/ast.BinaryExpr
28 uses
go/ast (current package)
ast.go#L401: BinaryExpr struct {
ast.go#L502: func (x *BinaryExpr) Pos() token.Pos { return x.X.Pos() }
ast.go#L536: func (x *BinaryExpr) End() token.Pos { return x.Y.End() }
ast.go#L568: func (*BinaryExpr) exprNode() {}
walk.go#L153: case *BinaryExpr:
go/doc
exports.go#L187: case *ast.BinaryExpr:
go/parser
parser.go#L1093: t := new(ast.BinaryExpr)
parser.go#L1624: case *ast.BinaryExpr:
parser.go#L1827: x = &ast.BinaryExpr{X: x, OpPos: pos, Op: op, Y: y}
parser.go#L1834: bx, ok := x.(*ast.BinaryExpr)
parser.go#L2649: case *ast.BinaryExpr:
go/printer
nodes.go#L625: func walkBinary(e *ast.BinaryExpr) (has4, has5 bool, maxProblem int) {
nodes.go#L634: case *ast.BinaryExpr:
nodes.go#L649: case *ast.BinaryExpr:
nodes.go#L680: func cutoff(e *ast.BinaryExpr, depth int) int {
nodes.go#L698: x, ok := expr.(*ast.BinaryExpr)
nodes.go#L749: func (p *printer) binaryExpr(x *ast.BinaryExpr, prec1, cutoff, depth int) {
nodes.go#L789: _, ok := expr.(*ast.BinaryExpr)
nodes.go#L803: case *ast.BinaryExpr:
go/types
decl.go#L659: case *ast.BinaryExpr:
expr.go#L122: case *ast.BinaryExpr:
expr.go#L534: case *ast.BinaryExpr:
expr.go#L991: if b, _ := e.(*ast.BinaryExpr); b != nil {
expr.go#L1624: case *ast.BinaryExpr:
exprstring.go#L118: case *ast.BinaryExpr:
union.go#L189: if o, _ := x.(*ast.BinaryExpr); o != nil && o.Op == token.OR {
gotest.tools/v3/internal/assert
assert.go#L118: if binaryExpr, ok := expr.(*ast.BinaryExpr); ok {
result.go#L104: case *ast.BinaryExpr, *ast.UnaryExpr: