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

com.facebook.presto.sql.tree.Expression


    private List<Boolean> executeFilterWithAll(String filter, Session session, boolean executeWithNoInputColumns, ExpressionCompiler compiler)
    {
        checkNotNull(filter, "filter is null");


        Expression filterExpression = createExpression(filter, metadata, SYMBOL_TYPES);


        List<Boolean> results = new ArrayList<>();


        // execute as standalone operator
        OperatorFactory operatorFactory = compileFilterProject(filterExpression, TRUE_LITERAL, compiler);

View Full Code Here

        return results;
    }


    public static Expression createExpression(String expression, Metadata metadata, Map<Symbol, Type> symbolTypes)
    {
        Expression parsedExpression = SQL_PARSER.createExpression(expression);


        final ExpressionAnalysis analysis = analyzeExpressionsWithSymbols(TEST_SESSION, metadata, SQL_PARSER, symbolTypes, ImmutableList.of(parsedExpression));
        Expression rewrittenExpression = ExpressionTreeRewriter.rewriteWith(new ExpressionRewriter<Void>()
        {
            @Override
            public Expression rewriteExpression(Expression node, Void context, ExpressionTreeRewriter<Void> treeRewriter)
            {
                Expression rewrittenExpression = treeRewriter.defaultRewrite(node, context);


                // cast expression if coercion is registered
                Type coercion = analysis.getCoercion(node);
                if (coercion != null) {
                    rewrittenExpression = new Cast(rewrittenExpression, coercion.getName());

View Full Code Here

                case OR:
                    TupleDomain columnUnionedTupleDomain = leftResult.getTupleDomain().columnWiseUnion(rightResult.getTupleDomain());


                    // In most cases, the columnUnionedTupleDomain is only a superset of the actual strict union
                    // and so we can return the current node as the remainingExpression so that all bounds will be double checked again at execution time.
                    Expression remainingExpression = complementIfNecessary(node, complement);


                    // However, there are a few cases where the column-wise union is actually equivalent to the strict union, so we if can detect
                    // some of these cases, we won't have to double check the bounds unnecessarily at execution time.


                    // We can only make inferences if the remaining expressions on both side are equal and deterministic

View Full Code Here

        }


        @Override
        protected Object visitSearchedCaseExpression(SearchedCaseExpression node, Object context)
        {
            Expression resultClause = node.getDefaultValue();
            for (WhenClause whenClause : node.getWhenClauses()) {
                Object value = process(whenClause.getOperand(), context);
                if (value instanceof Expression) {
                    // TODO: optimize this case
                    return node;

View Full Code Here

            if (operand instanceof Expression) {
                // TODO: optimize this case
                return node;
            }


            Expression resultClause = node.getDefaultValue();
            if (operand != null) {
                for (WhenClause whenClause : node.getWhenClauses()) {
                    Object value = process(whenClause.getOperand(), context);
                    if (value instanceof Expression) {
                        // TODO: optimize this case

View Full Code Here

            Object value = process(node.getValue(), context);
            if (value == null) {
                return null;
            }


            Expression valueListExpression = node.getValueList();
            if (!(valueListExpression instanceof InListExpression)) {
                if (!optimize) {
                    throw new UnsupportedOperationException("IN predicate value list type not yet implemented: " + valueListExpression.getClass().getName());
                }
                return node;
            }
            InListExpression valueList = (InListExpression) valueListExpression;

View Full Code Here

                if (!stringPattern.contains("%") && !stringPattern.contains("_")) {
                    return new ComparisonExpression(ComparisonExpression.Type.EQUAL, toExpression(value), toExpression(pattern));
                }
            }


            Expression optimizedEscape = null;
            if (node.getEscape() != null) {
                optimizedEscape = toExpression(escape);
            }


            return new LikePredicate(toExpression(value), toExpression(pattern), optimizedEscape);

View Full Code Here

        @Override
        public PhysicalOperation visitFilter(FilterNode node, LocalExecutionPlanContext context)
        {
            PlanNode sourceNode = node.getSource();


            Expression filterExpression = node.getPredicate();


            List<Expression> projectionExpressions = new ArrayList<>();
            for (int i = 0; i < node.getOutputSymbols().size(); i++) {
                Symbol symbol = node.getOutputSymbols().get(i);
                projectionExpressions.add(new QualifiedNameReference(symbol.toQualifiedName()));

View Full Code Here


        @Override
        public PhysicalOperation visitProject(ProjectNode node, LocalExecutionPlanContext context)
        {
            PlanNode sourceNode;
            Expression filterExpression;
            if (node.getSource() instanceof FilterNode) {
                FilterNode filterNode = (FilterNode) node.getSource();
                sourceNode = filterNode.getSource();
                filterExpression = filterNode.getPredicate();
            }

View Full Code Here

            Map<Symbol, Input> outputMappings = outputMappingsBuilder.build();


            try {
                // compiler uses inputs instead of symbols, so rewrite the expressions first
                SymbolToInputRewriter symbolToInputRewriter = new SymbolToInputRewriter(sourceLayout);
                Expression rewrittenFilter = ExpressionTreeRewriter.rewriteWith(symbolToInputRewriter, filterExpression);


                List<Expression> rewrittenProjections = new ArrayList<>();
                List<Type> outputTypes = new ArrayList<>();
                for (int i = 0; i < projectionExpressions.size(); i++) {
                    Expression projection = projectionExpressions.get(i);
                    rewrittenProjections.add(ExpressionTreeRewriter.rewriteWith(symbolToInputRewriter, projection));
                    outputTypes.add(context.getTypes().get(outputSymbols.get(i)));
                }


                IdentityHashMap<Expression, Type> expressionTypes = getExpressionTypesFromInput(

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of com.facebook.presto.sql.tree.Expression

com.facebook.presto.operator.scalar.FunctionAssertions

com.facebook.presto.split.TestNativeSplitManager

com.facebook.presto.sql.analyzer.AggregationAnalyzer$Visitor

com.facebook.presto.sql.analyzer.ExpressionAnalyzer$Visitor

com.facebook.presto.sql.analyzer.StatementAnalyzer

com.facebook.presto.sql.analyzer.TupleAnalyzer

com.facebook.presto.sql.ExpressionUtils

com.facebook.presto.sql.gen.ByteCodeExpressionVisitor

com.facebook.presto.sql.gen.ExpressionCompiler

com.facebook.presto.sql.gen.ExpressionKey

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.