type go/ast.UnaryExpr

26 uses

	go/ast (current package)
		ast.go#L394: 	UnaryExpr struct {
		ast.go#L501: func (x *UnaryExpr) Pos() token.Pos      { return x.OpPos }
		ast.go#L535: func (x *UnaryExpr) End() token.Pos      { return x.X.End() }
		ast.go#L567: func (*UnaryExpr) exprNode()      {}
		walk.go#L150: 	case *UnaryExpr:

	go/doc
		exports.go#L183: 	case *ast.UnaryExpr:

	go/parser
		parser.go#L1109: 		t := new(ast.UnaryExpr)
		parser.go#L1623: 	case *ast.UnaryExpr:
		parser.go#L1736: 		return &ast.UnaryExpr{OpPos: pos, Op: op, X: p.checkExpr(x)}
		parser.go#L1782: 		return &ast.UnaryExpr{OpPos: arrow, Op: token.ARROW, X: p.checkExpr(x)}
		parser.go#L1910: 			y = []ast.Expr{&ast.UnaryExpr{OpPos: pos, Op: token.RANGE, X: p.parseRhs()}}
		parser.go#L2364: 				y := []ast.Expr{&ast.UnaryExpr{OpPos: pos, Op: token.RANGE, X: p.parseRhs()}}
		parser.go#L2406: 		x := as.Rhs[0].(*ast.UnaryExpr).X
		resolver.go#L432: 					Rhs:    []ast.Expr{&ast.UnaryExpr{Op: token.RANGE, X: n.X}},

	go/printer
		nodes.go#L667: 	case *ast.UnaryExpr:
		nodes.go#L829: 	case *ast.UnaryExpr:

	go/types
		decl.go#L657: 	case *ast.UnaryExpr:
		expr.go#L126: 	case *ast.UnaryExpr:
		expr.go#L157: func (check *Checker) unary(x *operand, e *ast.UnaryExpr) {
		expr.go#L523: 	case *ast.UnaryExpr:
		expr.go#L1614: 	case *ast.UnaryExpr:
		exprstring.go#L114: 	case *ast.UnaryExpr:
		stmt.go#L779: 				if x, _ := unparen(rhs).(*ast.UnaryExpr); x != nil && x.Op == token.ARROW {
		union.go#L141: 	if op, _ := x.(*ast.UnaryExpr); op != nil && op.Op == token.TILDE {

	gotest.tools/v3/internal/assert
		assert.go#L144: 	if unaryExpr, ok := expr.(*ast.UnaryExpr); ok && unaryExpr.Op == token.NOT {
		result.go#L104: 	case *ast.BinaryExpr, *ast.UnaryExpr: