NewTypedComparisonExprWithSubOp returns a new ComparisonExpr that is verified to be well-typed.
( op, subOp treecmp.ComparisonOperator, left, right TypedExpr, )
| 399 | |
| 400 | // NewTypedComparisonExprWithSubOp returns a new ComparisonExpr that is verified to be well-typed. |
| 401 | func NewTypedComparisonExprWithSubOp( |
| 402 | op, subOp treecmp.ComparisonOperator, left, right TypedExpr, |
| 403 | ) *ComparisonExpr { |
| 404 | node := &ComparisonExpr{Operator: op, SubOperator: subOp, Left: left, Right: right} |
| 405 | node.typ = types.Bool |
| 406 | MemoizeComparisonExprOp(node) |
| 407 | return node |
| 408 | } |
| 409 | |
| 410 | // NewTypedIndirectionExpr returns a new IndirectionExpr that is verified to be well-typed. |
| 411 | func NewTypedIndirectionExpr(expr, index TypedExpr, typ *types.T) *IndirectionExpr { |
nothing calls this directly
no test coverage detected
searching dependent graphs…