Package org.apache.pig.newplan.logical.expression

Examples of org.apache.pig.newplan.logical.expression.BinaryExpression

94
95
96
97
98
99
100
101
102
103
104
    // we will visit the leaf and it will recursively walk the plan
    LogicalExpression leaf = (LogicalExpression)plan.getSources().get( 0 );
    // if the leaf is a unary operator it should be a FilterFunc in
    // which case we don't try to extract partition filter conditions
    if(leaf instanceof BinaryExpression) {
      BinaryExpression binExpr = (BinaryExpression)leaf;
      visit( binExpr );
      replaceChild( binExpr );
      // if the entire expression is to be removed, then the above
      // replaceChild will not set sawKey to false (sawKey is set to
      // false only in replaceChild()
View Full Code Here
414
415
416
417
418
419
420
421
422
423
424
            return new Expression.Column(fieldName);
        } else {
      if( !( op instanceof BinaryExpression ) ) {
        throwException();
      }
      BinaryExpression binOp = (BinaryExpression)op;
      if(binOp instanceof AddExpression) {
        return getExpression( binOp, OpType.OP_PLUS );
      } else if(binOp instanceof SubtractExpression) {
        return getExpression(binOp, OpType.OP_MINUS);
      } else if(binOp instanceof MultiplyExpression) {
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
        // if the leaf is a unary operator it should be a FilterFunc in
        // which case we don't try to extract partition filter conditions
        if(leaf instanceof BinaryExpression) {
            // recursively traverse the tree bottom up
            // checkPushdown returns KeyState which is pair of LogicalExpression
            BinaryExpression binExpr = (BinaryExpression)leaf;
            KeyState finale = checkPushDown(binExpr);
            this.filterExpr = finale.filterExpr;
            this.pushdownExpr = getExpression(finale.pushdownExpr);
        }
    }
View Full Code Here
314
315
316
317
318
319
320
321
322
323
324
        } else {
            if( !( op instanceof BinaryExpression ) ) {
                LOG.error("Unsupported conversion of LogicalExpression to Expression: " + op.getName());
                throw new FrontendException("Unsupported conversion of LogicalExpression to Expression: " + op.getName());
            }
            BinaryExpression binOp = (BinaryExpression)op;
            if(binOp instanceof AddExpression) {
                return getExpression( binOp, OpType.OP_PLUS );
            } else if(binOp instanceof SubtractExpression) {
                return getExpression(binOp, OpType.OP_MINUS);
            } else if(binOp instanceof MultiplyExpression) {
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
        // if the leaf is a unary operator it should be a FilterFunc in
        // which case we don't try to extract partition filter conditions
        if(leaf instanceof BinaryExpression) {
            // recursively traverse the tree bottom up
            // checkPushdown returns KeyState which is pair of LogicalExpression
            BinaryExpression binExpr = (BinaryExpression)leaf;
            KeyState finale = checkPushDown(binExpr);
            this.filterExpr = finale.filterExpr;
            this.pushdownExpr = getExpression(finale.pushdownExpr);
        }
    }
View Full Code Here
337
338
339
340
341
342
343
344
345
346
347
        } else if (op instanceof ProjectExpression) {
            ProjectExpression projExpr = (ProjectExpression)op;
            String fieldName = projExpr.getFieldSchema().alias;
            return new Expression.Column(fieldName);
        } else if(op instanceof BinaryExpression) {
            BinaryExpression binOp = (BinaryExpression)op;
            if(binOp instanceof AddExpression) {
                return getExpression( binOp, OpType.OP_PLUS );
            } else if(binOp instanceof SubtractExpression) {
                return getExpression(binOp, OpType.OP_MINUS);
            } else if(binOp instanceof MultiplyExpression) {
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
        // if the leaf is a unary operator it should be a FilterFunc in
        // which case we don't try to extract partition filter conditions
        if(leaf instanceof BinaryExpression) {
            // recursively traverse the tree bottom up
            // checkPushdown returns KeyState which is pair of LogicalExpression
            BinaryExpression binExpr = (BinaryExpression)leaf;
            KeyState finale = checkPushDown(binExpr);
            this.filterExpr = finale.filterExpr;
            this.pushdownExpr = getExpression(finale.pushdownExpr);
        }
    }
View Full Code Here
326
327
328
329
330
331
332
333
334
335
336
        } else {
            if( !( op instanceof BinaryExpression ) ) {
                LOG.error("Unsupported conversion of LogicalExpression to Expression: " + op.getName());
                throw new FrontendException("Unsupported conversion of LogicalExpression to Expression: " + op.getName());
            }
            BinaryExpression binOp = (BinaryExpression)op;
            if(binOp instanceof AddExpression) {
                return getExpression( binOp, OpType.OP_PLUS );
            } else if(binOp instanceof SubtractExpression) {
                return getExpression(binOp, OpType.OP_MINUS);
            } else if(binOp instanceof MultiplyExpression) {
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
        // we will visit the leaf and it will recursively walk the plan
        LogicalExpression leaf = (LogicalExpression)plan.getSources().get( 0 );
        // if the leaf is a unary operator it should be a FilterFunc in
        // which case we don't try to extract partition filter conditions
        if(leaf instanceof BinaryExpression) {
            BinaryExpression binExpr = (BinaryExpression)leaf;
            visit( binExpr );
            replaceChild( binExpr );
            // if the entire expression is to be removed, then the above
            // replaceChild will not set sawKey to false (sawKey is set to
            // false only in replaceChild()
View Full Code Here
478
479
480
481
482
483
484
485
486
487
488
        } else {
            if( !( op instanceof BinaryExpression ) ) {
                logInternalErrorAndSetFlag();
                return null;
            }
            BinaryExpression binOp = (BinaryExpression)op;
            if(binOp instanceof AddExpression) {
                return getExpression( binOp, OpType.OP_PLUS );
            } else if(binOp instanceof SubtractExpression) {
                return getExpression(binOp, OpType.OP_MINUS);
            } else if(binOp instanceof MultiplyExpression) {
View Full Code Here
TOP

Related Classes of org.apache.pig.newplan.logical.expression.BinaryExpression

  • org.apache.pig.newplan.FilterExtractor
  • org.apache.pig.newplan.PColFilterExtractor
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.