Examples of BetweenPredicate

Examples of com.facebook.presto.sql.tree.BetweenPredicate

1010
1011
1012
1013
1014
1015
1016
        return new InPredicate(reference(symbol), new InListExpression(LiteralInterpreter.toExpressions(values, Collections.nCopies(values.size(), type))));
    }

    private static BetweenPredicate between(Symbol symbol, Expression min, Expression max)
    {
        return new BetweenPredicate(reference(symbol), min, max);
    }
View Full Code Here

Examples of com.facebook.presto.sql.tree.BetweenPredicate

100
101
102
103
104
105
106
107
108
109
110
            if (range.isSingleValue()) {
                singleValues.add(toExpression(range.getLow().getValue()));
            }
            else if (isBetween(range)) {
                // Specialize the range with BETWEEN expression if possible b/c it is currently more efficient
                disjuncts.add(new BetweenPredicate(reference, toExpression(range.getLow().getValue()), toExpression(range.getHigh().getValue())));
            }
            else {
                List<Expression> rangeConjuncts = new ArrayList<>();
                if (!range.getLow().isLowerUnbounded()) {
                    switch (range.getLow().getBound()) {
View Full Code Here

Examples of com.facebook.presto.sql.tree.BetweenPredicate

610
611
612
613
614
615
616
            }
            else if (value instanceof Slice && min instanceof Slice && max instanceof Slice) {
                return ((Slice) min).compareTo((Slice) value) <= 0 && ((Slice) value).compareTo((Slice) max) <= 0;
            }

            return new BetweenPredicate(toExpression(value), toExpression(min), toExpression(max));
        }
View Full Code Here

Examples of com.facebook.presto.sql.tree.BetweenPredicate

610
611
612
613
614
615
616
            }
            else if (value instanceof Slice && min instanceof Slice && max instanceof Slice) {
                return ((Slice) min).compareTo((Slice) value) <= 0 && ((Slice) value).compareTo((Slice) max) <= 0;
            }

            return new BetweenPredicate(toExpression(value), toExpression(min), toExpression(max));
        }
View Full Code Here

Examples of com.facebook.presto.sql.tree.BetweenPredicate

492
493
494
495
496
497
498
499
500
501
502
            if (max == null) {
                return null;
            }

            if (hasUnresolvedValue(value, min, max)) {
                return new BetweenPredicate(
                        toExpression(value, expressionTypes.get(node.getValue())),
                        toExpression(min, expressionTypes.get(node.getMin())),
                        toExpression(max, expressionTypes.get(node.getMax())));
            }
View Full Code Here

Examples of com.facebook.presto.sql.tree.BetweenPredicate

610
611
612
613
614
615
616
            }
            else if (value instanceof Slice && min instanceof Slice && max instanceof Slice) {
                return ((Slice) min).compareTo((Slice) value) <= 0 && ((Slice) value).compareTo((Slice) max) <= 0;
            }

            return new BetweenPredicate(toExpression(value), toExpression(min), toExpression(max));
        }
View Full Code Here

Examples of com.facebook.presto.sql.tree.BetweenPredicate

110
111
112
113
114
115
116
117
118
119
120
            if (range.isSingleValue()) {
                singleValues.add(toExpression(range.getLow().getValue(), type));
            }
            else if (isBetween(range)) {
                // Specialize the range with BETWEEN expression if possible b/c it is currently more efficient
                disjuncts.add(new BetweenPredicate(reference, toExpression(range.getLow().getValue(), type), toExpression(range.getHigh().getValue(), type)));
            }
            else {
                List<Expression> rangeConjuncts = new ArrayList<>();
                if (!range.getLow().isLowerUnbounded()) {
                    switch (range.getLow().getBound()) {
View Full Code Here

Examples of com.facebook.presto.sql.tree.BetweenPredicate

481
482
483
484
485
486
487
488
489
490
491
            if (max == null) {
                return null;
            }

            if (hasUnresolvedValue(value, min, max)) {
                return new BetweenPredicate(
                        toExpression(value, expressionTypes.get(node.getValue())),
                        toExpression(min, expressionTypes.get(node.getMin())),
                        toExpression(max, expressionTypes.get(node.getMax())));
            }
View Full Code Here

Examples of com.facebook.presto.sql.tree.BetweenPredicate

495
496
497
498
499
500
501
502
503
504
505
            if (max == null) {
                return null;
            }

            if (hasUnresolvedValue(value, min, max)) {
                return new BetweenPredicate(
                        toExpression(value, expressionTypes.get(node.getValue())),
                        toExpression(min, expressionTypes.get(node.getMin())),
                        toExpression(max, expressionTypes.get(node.getMax())));
            }
View Full Code Here

Examples of com.facebook.presto.sql.tree.BetweenPredicate

667
668
669
670
671
672
673
            }
            else if (value instanceof Slice && min instanceof Slice && max instanceof Slice) {
                return ((Slice) min).compareTo((Slice) value) <= 0 && ((Slice) value).compareTo((Slice) max) <= 0;
            }

            return new BetweenPredicate(toExpression(value), toExpression(min), toExpression(max));
        }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.