提交 0d8a7dc6 编写于 作者: B Bruce Momjian

BETWEEN and LIKE patch from Thomas

上级 3b40fd9e
......@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/parser/parse_expr.c,v 1.23 1998/02/27 16:07:02 vadim Exp $
* $Header: /cvsroot/pgsql/src/backend/parser/parse_expr.c,v 1.24 1998/03/26 21:08:10 momjian Exp $
*
*-------------------------------------------------------------------------
*/
......@@ -301,6 +301,21 @@ transformExpr(ParseState *pstate, Node *expr, int precedence)
result = (Node *) expr;
break;
}
/* These nodes do _not_ come from the original parse tree.
* They result from parser transformation in this phase.
* At least one construct (BETWEEN/AND) puts the same nodes
* into two branches of the parse tree. Hence, some nodes
* are transformed twice. These nodes come from transforming
* a function call. Let's try just passing them through...
* - thomas 1998-03-14
*/
case T_Expr:
case T_Var:
case T_Const:
{
result = (Node *) expr;
break;
}
default:
/* should not reach here */
elog(ERROR, "transformExpr: does not know how to transform node %d",
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册